An Optimal Instruction-Scheduling Model for a Class of Vector Processors
- 1 November 1985
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-34 (11) , 981-995
- https://doi.org/10.1109/tc.1985.1676531
Abstract
An integer programming model that portrays the architectural features of a class of vector and array processors has been developed. This model is used to produce optimal schedules for low-level-instruction codes of such processors. Optimal schedules are produced for both straight codes and instruction loops. Loop scheduling is separately considered because of special consideration that must be given to the effects of the instructions of consecutive loop iterations on each other that are hidden when static instruction scheduling approach is used. Using the model, a number of experiments have been conducted in optimal scheduling of Cray assembly codes.Keywords
This publication has 11 references indexed in Scilit:
- MANIP—A Multicomputer Architecture for Solving Combinatonal Extremum-Search ProblemsIEEE Transactions on Computers, 1984
- Branch and Bound Methods for Multi-Item SchedulingOperations Research, 1981
- On the complexity of integer programmingJournal of the ACM, 1981
- Optimization of MicroprogramsIEEE Transactions on Computers, 1981
- Logical Reduction Methods in Zero-One Programming—Minimal Preferred VariablesOperations Research, 1981
- Multiple Resource–Constrained Scheduling Using Branch and BoundA I I E Transactions, 1978
- A CRAY-1 Simulator.Published by Defense Technical Information Center (DTIC) ,1978
- An empirical study of FORTRAN programsSoftware: Practice and Experience, 1971
- Multiproject Scheduling with Limited Resources: A Zero-One Programming ApproachManagement Science, 1969
- A Branch-Bound Solution to the General Scheduling ProblemOperations Research, 1968