

ILP Optimizations
Introduction
This section is under construction. A new scheduler framework
for superscalars that ties into the machine description language
is currently being developed.
The ILP ToolBox
List Scheduler
Ranking Algorithms
Some more complex ranking algorithms (than say critical path) have been
implemented. These are:
 The algorithm of
Palem and Simons
which appeared in TOPLAS '93. This algorithm
computes the modified deadlines of a set instructions, with
precedence, latency, and deadlines constraints.
 The algorithm of
Leung, Palem, and Pnueli
which appeared in PACT '98.
This algorithm computes the modified deadlines of a set of instructions,
with precedence, latency, releasetimes and deadline constraints.


Generated by
mltex2html

Last modified: Thu Jan 9 19:38:15 EST 2003 by leunga@slinky

