Abstract-Microcode compaction is the conversion of sequential microcode into efficient parallel (horizontal) microcode. Local compaction 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.

No abstract

A three-level modified Robinson cervical discectomy and fusion results in an unacceptably high rate of pseudarthrosis. Although not all pseudarthroses are painful, these data suggest that those with a successful fusion have a better outcome. It is recommended that these patients undergo additional or alternative measures to achieve arthrodesis consistently.