Microcode compaction with timing constraints
MICRO 20 Proceedings of the 20th annual workshop on Microprogramming
Phase coupling for horizontal microcode generation
MICRO 20 Proceedings of the 20th annual workshop on Microprogramming
Compaction with General Synchronous Timing
IEEE Transactions on Software Engineering
Local code generation and compaction in optimizing microcode compilers
Local code generation and compaction in optimizing microcode compilers
A critical analysis of the global optimization problem for horizontal microcode (phase-coupled, compaction, code motion, compilation)
MICRO 25 Proceedings of the 25th annual international symposium on Microarchitecture
Foresighted Instruction Scheduling Under Timing Constraints
IEEE Transactions on Computers
Lifetime-sensitive modulo scheduling
PLDI '93 Proceedings of the ACM SIGPLAN 1993 conference on Programming language design and implementation
Scheduling time-constrained instructions on pipelined processors
ACM Transactions on Programming Languages and Systems (TOPLAS)
| Hi-index | 0.00 |
Under timing constraints, local compaction may fail because of poor scheduling decisions. Su [SDWX87] uses foresight to avoid some of the poor scheduling decisions. However, the foresight takes a considerable amount of time. In this paper the Incremental Foresight algorithm is introduced. Experiments using four different target architectures show that the Incremental Foresight algorithm works as well as foresight, and saves around 48 percent of the excess time.