# SCM Repository

# View of /sml/trunk/src/MLRISC/Doc/latex/ILP.tex

Parent Directory | Revision Log

Revision

File size: 989 byte(s)

**651**- (**download**) (**as text**) (**annotate**)*Thu Jun 1 18:34:03 2000 UTC*(19 years, 2 months ago) by*monnier*File size: 989 byte(s)

bring revisions from the vendor branch to the trunk

\section{ILP Optimizations} \subsection{Introduction} This section is under construction. A new scheduler framework for superscalars that ties into the machine description language is currently being developed. \subsection{The ILP ToolBox} \subsubsection{List Scheduler} \subsubsection{Ranking Algorithms} Some more complex ranking algorithms (than say critical path) have been implemented. These are: \begin{itemize} \item The algorithm of \mlrischref{scheduling/PalemSimons.sig}{Palem and Simons} which appeared in TOPLAS '93. This algorithm computes the modified deadlines of a set instructions, with precedence, latency, and deadlines constraints. \item The algorithm of \mlrischref{scheduling/LeungPalemPnueli.sig}{Leung, Palem, and Pnueli} which appeared in PACT '98. This algorithm computes the modified deadlines of a set of instructions, with precedence, latency, release-times and deadline constraints. \end{itemize}

root@smlnj-gforge.cs.uchicago.edu | ViewVC Help |

Powered by ViewVC 1.0.0 |