List scheduling in the presence of branches A theoretical evaluation

Theoretical Computer Science

Volumn 196, Issue 1-2, 1998, Pages 347-363

  Gasperoni, Franco ^a   Schwiegelshohn, Uwe ^b  

^a TELECOM PARISTECH   (France)

^b TU DORTMUND UNIVERSITY   (Germany)

Author keywords

Instruction scheduling; Parallelizing compilers; Performance guarantee

Indexed keywords

EID: 0347174898     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(97)00207-7     Document Type: Article

References (10)

1. A. Aiken, A. Nicolau, A development environment for horizontal microcode, IEEE Trans. Software Eng. 14 (1988) 584-594.
2. F. Allen, M. Burke, P. Charles, R. Cytron, J. Ferrante, An overview of the PTRAN analysis system for multiprocessing, J. Parallel Distributed Comput. 5 (1988) 617-640.
3. E.G. Coffman, Computer and Job-shop Scheduling Theory, Wiley, New York, 1976.
4. K. Ebcioǧlu, Some design ideas for a VLIW architecture for sequential-natured software, in: Proc. IFIP WG 10.3 Conf. on Parallel Processing, North-Holland, Amsterdam, 1988, pp. 1-21.
5. J.A. Fisher, J.R. Ellis, J.C. Ruttenberg, A. Nicolau, Parallel processing: A smart compiler and a dumb machine, in: Proc. SIGPLAN 1984, June 1984, ACM, pp. 37-47.
6. M.R. Garey, D.S. Johnson, Computers and Intractability - A Guide to the Theory of NP-Completeness, Freeman, New York, 1979.
7. F. Gasperoni, Scheduling for horizontal systems: the VLIW paradigm in perspective, Ph.D thesis, New York University, New York, July 1991.
8. R. Gupta, M.L. Soffa, Region scheduling: An approach for detecting and redistributing parallelism, IEEE Trans. Software Eng. 16 (1990) 421-431.
9. K. Karplus, A. Nicolau, A compiler-driven supercomputer, Appl. Math. Comput. 20 (1986) 95-110.
10. A. Nicolau, J.A. Fisher, Measuring the parallelism available for very long instruction word architectures, IEEE Trans. Comput. C-33 (1984) 968-976.