Parallel code generation via scheduling

Graduation date: 1988A translator has been designed and implemented which generates\ud parallel code for a long instruction word parallel computer with local\ud memories. Its main methods are to translate the sequential source code into\ud single assignment, two-operand form, and to then assign the operations to\ud processors so as to minimize the number of resulting long instruction words.\ud The scheduling of an operation can be myopic, or it can look ahead at the\ud consequences of scheduling on the next several operations. The system can\ud generate optimal code if all subsequent operations are included in the\ud lookahead. For computational reasons, the operational system is limited to a\ud fixed number of lookahead steps