DMCA
Trace Scheduling: A Technique for Global Microcode Compaction (1981)
| Venue: | IEEE TRANSACTIONS ON COMPUTERS |
| Citations: | 682 - 5 self |
BibTeX
@ARTICLE{Fisher81tracescheduling:,
author = {Joseph A. Fisher},
title = {Trace Scheduling: A Technique for Global Microcode Compaction},
journal = {IEEE TRANSACTIONS ON COMPUTERS},
year = {1981},
volume = {30},
number = {7}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Microcode compaction is the conversion of sequential microcode into efficient parallel (horizontal) microcode. Local com-paction techniques are those whose domain is basic blocks of code, while global methods attack code with a general flow control. Compilation of high-level microcode languages into efficient horizontal microcode and good hand coding probably both require effective global compaction techniques. In this paper "trace scheduling" is developed as a solution to the global compaction problem. Trace scheduling works on traces (or paths) through microprograms. Compacting is thus done with a broad overview of the program. Important operations are given priority, no matter what their source block was. This is in sharp contrast with earlier methods, which compact one block at a time and then attempt iterative improvement. It is argued that those methods suffer from the lack of an overview and make many undesirable compactions, often preventing desirable ones. Loops are handled using the reducible property of most flow graphs. The loop handling technique permits the operations to move around loops, as well as into loops where appropriate. Trace scheduling is developed on a simplified and straightforward model of microinstructions. Guides to the extension to more general models are given.
Keyphrases
trace scheduling global microcode compaction microcode compaction effective global compaction technique high-level microcode parallel instruction scheduling sequential microcode global microcode optimization local com-paction technique global method attack code resource conflict abstract-microcode compaction important operation desirable one loop handling technique index terms-data dependency straightforward model iterative improvement efficient horizontal microcode sharp contrast many undesirable compaction basic block good hand flow graph general model source block efficient parallel parallel pro-cessing reducible property broad overview general flow control global compaction problem
