This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Foresighted Instruction Scheduling Under Timing Constraints
September 1992 (vol. 41 no. 9)
pp. 1169-1172

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 decisions. Foresighted compaction is very effective in reducing, failure inherent in greedy compaction algorithms.

[1] J. A. Fisher, D. Landskov, and B. D. Shriver, "Microcode compaction: Looking backward and looking forward," inProc. Nat. Comput. Conf., vol. 50, Montvale, NJ, July 1981, AFIPS Press, pp. 95-102.
[2] D. Landskov, S. Davidson, B. D. Shriver, and P. W. Mallett, "Local microcode compaction techniques,"ACM Comput. Surveys, vol. 12, no. 3, pp. 261-294, Sept. 1980.
[3] T. Nakatani and K. Ebcioglu, "Using a lookahead window in compaction-based parallelzing compiler, " inProc. 23rd Microprogramming Workshop (MICRO-23), Orlando, FL, Nov. 1990.
[4] U. Banerjee, S. Shen, D. J. Kuck, and R. A. Towle, "Time and parallel processor bounds for fortran-like loops,"IEEE Trans. Comput., vol. C-28, no. 9, pp. 660-670, Sept. 1979.
[5] S. R. Vegdahl, "Local code generation and compaction in optimizing microcode compilers," Ph.D. dissertation, Dep. Comput. Sci., Carnegie-Mellon Univ., Pittsburgh, PA, 1982.
[6] K. V. Palem and B. B. Simons, "Scheduling time-critical instructions on rise machines," inProc. Seventeenth Annu. ACM Symp. Principles Programming Languages, Jan. 1990, pp. 270-280.
[7] A. Aiken and A. Nicolau, "Optimal loop parallelization," inProc. SIGPLAN '88 Conf. Programming Language Design and Implementation, Atlanta, GA, June 1988, pp. 308-317.
[8] A. Nicolau and R. Postasman, "An environment for the development of microcode for pipelined architectures," inProc. 23rd Symp. and Workshop Microprogramming and Microarchitecture, Orlando, FL, Nov. 1990, pp. 69-79.
[9] B. Su, S. Ding, J. Wang, and J. Xia, "Microcode compaction with timing constraints," inProc. 20th Microprogramming Workshop (MICRO-20), Colorado Springs, CO, Dec. 1987, pp. 59-68.
[10] V. H. Allan and R. A. Mueller, "Compaction with general synchronous timing,"IEEE Trans. Software Eng., vol. 14, no. 5, pp. 595-599, May 1988.
[11] H. F. Smith,Data Structures Form and Function, San Diego, CA: Harcourt Brace Jovanovich, 1987.
[12] V. H. Allan, "A critical analysis of the global optimization problem for horizontal microcode," Ph.D. dissertation, Comput. Sci. Dep., Colorado State Univ., Fort Collins, CO 80523, 1986.
[13] P. Wijaya, "Incremental foresighted microcode compaction," Master's thesis, Utah State Univ., Logan, UT, 1990.
[14] P. Wijaya and V. H. Allan, "Incremental foresighted local compaction," inProc. 22th Microprogramming Workshop (MICRO-22), Dublin, Ireland, Aug. 1989.

Index Terms:
foresighted instruction scheduling; minimum timing information; foresighted compaction; timing constraints; data dependency graph arcs; data dependency information; maximum timing information; list scheduling; look ahead; greedy compaction algorithms; graph theory; parallel algorithms; parallel programming; programming theory; scheduling.
Citation:
V.H. Allan, B. Su, P. Wijaya, J. Wang, "Foresighted Instruction Scheduling Under Timing Constraints," IEEE Transactions on Computers, vol. 41, no. 9, pp. 1169-1172, Sept. 1992, doi:10.1109/12.165397
Usage of this product signifies your acceptance of the Terms of Use.