Scheduling time-constrained instructions on pipelined processors

This work presents a generic algorithm that runs in O(n2logn&agr;(n)+ne) time, given n instructions and e edges in the precedence DAG, where &agr;(n) is the functional inverse of the Ackermann function.