Abstract
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.
- All86 V.H. Allan. A Critical Analysis of the Global Optimization Problem for Horizontal Microcode. PhD thesis, Computer Science Department, Colorado State University, Fort Collins, 1986. Google Scholar
Digital Library
- AM87 V.H. Allan and R.A. Mueller. Phase Coupling for Horizontal Microcode Generation. In Proceedings of the 23th Microprogramming Workshop (MICRO-20), Colorado Springs, CO, December 1987. Google Scholar
Digital Library
- AM88 V.H. Allan and R.A. Mueller. Compaction with general synchronous timing. IEEE Transactions on Software Engineering, 14(5):595-599, May 1988. Google Scholar
Digital Library
- AWSW89 V.H. Allan, P. Wijaya, B. Su, and J Wang. Foresighted Compaction under Timing Constraints. Technical Report CS-89-10, Department of Computer Science, Utah State University, Logan, Utah, 1989.Google Scholar
- SDWX87 B. Su, S. Ding, J. Wang, and J. Xia. Microcode Compaction with Timing Constraints. In Proceedings of the 20 Microprogramming Workshop (MICRO-SO), Colorado Springs, CO, December 1987. Google Scholar
Digital Library
- Veg82 S.R. Vegdahl. Local Code Generation and Compaction in Optimizing Microcode Compilers. PhD thesis, Department of Computer Science, Carnegie-Mellon University, Pittsburgh, PA, 1982. Google Scholar
Digital Library
Index Terms
Incremental foresighted local compaction
Recommendations
Incremental foresighted local compaction
MICRO 22: Proceedings of the 22nd annual workshop on Microprogramming and microarchitectureUnder 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 ...
Foresighted Instruction Scheduling Under Timing Constraints
When data dependency graph arcs representing data dependency information are annotated with minimum and maximum timing information, new algorithms are required. Foresighted compaction is a list scheduling technique in which look ahead is used in making ...






Comments