
- 1 S. Melvin and Y. Patt Exploiting Fine-Grain Parallelism Through a Combination of Hardware and Software Techniques. In Proceedings o/the 18th Annual ISCA, pages 287-296, 1991. Google Scholar
Digital Library
- 2 M. Smith, M. Lam, and M. Horowitz. Boosting Beyond Static Scheduling in a Superscalar Processor. In Proceedings o/the 17th Annual ISCA, pages 344-354, 1990. Google Scholar
Digital Library
- 3 D. Bernstein and M. Rodeh. Global Instruction Scheduling for Superscalar Machines. In Proceedings o/the SIGPLAN Conference, pages 241-255, 1991. Google Scholar
Digital Library
- 4 A. Nicolau. Percolation Scheduling: A Parallel Compilation Technique. Technical Report TR-85-678, Cornell University, 1985. Google Scholar
Digital Library
- 5 T. Nakatani and K. Ebcio~lu. Using a Lookahead Window in a Compaction-Based Parallelizing Compiler. In Proceedings of the Micro-23, pages 57-68, 1990. Google Scholar
Digital Library
- 6 A. Aho, R. Sethi, and J. Ullman. Compilers: Principles, Techniques and Tools. Addison-Wesley, 1986. Google Scholar
Digital Library
- 7 A. Aiken and A. Nicolau. A Development Environment for Horizontal Microcode. IEEE Transactions on Software Engineering, pages 584-594, May 1988. Google Scholar
Digital Library
- 8 K. Ebcioglu. Some Design ideas for a VLIW Architecture for Sequential Natured Software. In M. Cosnard et al., editor, Parallel Processing(proceedings of IFIP WG 10.3 Working Conference on Parallel Processing (Pisa, Italy), pages 3-21. North Holland, April 1988.Google Scholar
- 9 S.-M. Moon, S. Carson, and A. Agrawala. Hardware Implementation of a General Multi-way Jump Mechanism. In Proceedings of Micro-~3, pages 38-45, 1990. Google Scholar
Digital Library
- 10 K. Ebcioglu and A. Nicolau. A Global Resource- Constrained Parallelization Technique. In Proceedings of the International Conference on Supercomputing, pages 154-163, Jun 1989. Google Scholar
Digital Library
- 11 K. Ebcio~,lu and T. Nakatani. A New Compilation Technique for Parallelizing Loops with Unpredictable Branches on a VLIW architecture. In D. Gelernter et al., editor, Languages and Compilers for Parallel Computing, pages 213-229. MIT Press, 1989. Google Scholar
- 12 S.-M. Moon and K. Ebcioglu. An Efficient Resource- Constrained Global Scheduling Techniques for Superscalar and VLIW processors. Research Report RC 17962, IBM Research Division, T.J. Watson Research Center, Apr 1992.Google Scholar
- 13 R. Jones and V. Allan. Software Pipelining: A Comparison and Improvement. In Proceedings of the Micro-~3, pages 46-56, 1990. Google Scholar
Digital Library
- 14 J. Schwartz and M. Sharir. A design for optimizations of the bit vectoring class. Technical Report 17, Courant Institute Computer Science, Sep 1979.Google Scholar
- 15 J. Ellis. Bulldog: A compiler for VLIW architecture. PhD thesis, Yale University, Feb 1985. Google Scholar
Digital Library
- 16 D. Maydan, J. Hennessy, and M. Lam. Efficient and Exact Data Dependence Analysis. In Proceedings of A CM SIGPLAN '91 PLDI Conference, pages 1-14, June 1991. Google Scholar
Digital Library
- 17 G. Goff, K. Kennedy, and C. Tseng. Practical Dependence Testing. in Proceedings of A CM SIGPLAN '91 PLDI Conference, pages 15-29, June 1991. Google Scholar
Digital Library
- 18 IBM. A Special Issue on IBM RISC System/6000. IBM Journal of Research and Development, 34(1), Jan 1990.Google Scholar
- 19 K. Ebcio~,lu. An efficient logic programming language and its application to music. In Proceedings of the fourth International Conference on Logic Programming, pages 513-532, May 1987.Google Scholar
- 20 T. Gross and M. Ward. The Suppression of Compensation Code. In D. Gelernter et al., editor, Proceedings of the 3rd workshop on Programming Languages and Compilers for Parallel Computing, pages 260-273. Pitman/MIT Press, 1990.Google Scholar
- 21 J. Ferrante, K. Ottenstein, and J. Warren. The Program Dependency Graph and its Use in Optimization. A CM Transactions on Programming Language and Systems, pages 319-349, July 1987. Google Scholar
Digital Library
- 22 R. Gupta and M.L. Sofia. Region Scheduling. In Proceedings of the second International Conference on Supercomputing, pages 3:141-148, May 1987.Google Scholar
- 23 R. Cytron J. Ferrante B. Rosen M. Wegman and F. Zadeck. An Efficient Method for Computing Static Single Assignment Form. In Proceedings of Sixteenth Annual A CM Symposium on Principles of Programming Languages, pages 25-35, Jan 1989. Google Scholar
Digital Library
Index Terms
An efficient resource-constrained global scheduling technique for superscalar and VLIW processors
Recommendations
An efficient resource-constrained global scheduling technique for superscalar and VLIW processors
MICRO 25: Proceedings of the 25th annual international symposium on MicroarchitectureA fill-unit approach to multiple instruction issue
MICRO 27: Proceedings of the 27th annual international symposium on MicroarchitectureMultiple issue of instructions occurs in superscalar and VLIW machines. This paper investigates a third type of machine design, which combines the advantages of code compatibility as in superscalars and the absence of complex dependency-checking logic ...
Dynamically Scheduling VLIW Instructions
Very long instruction word (VLIW) machines potentially provide the most direct way to exploit instruction-level parallelism; however, they cannot be used to emulate current general-purpose instruction set architectures. In addition, programs scheduled ...






Comments