An Almost-Linear Algorithm for Two-Processor Scheduling

Abstract

A well-known problem m scheduling theory is to execute n umt-lengthjobs subject to precedence constraints on two processors m mmunum fimsh time Previous algorithms begin by finding the transmve closure of the precedence dag and so use time O(mm(en, n261)). An O(e + ha(n)) algorithm is presented which Is based on the idea of a “highest-level-first” (HLF) schedule Such a schedule always executes nodes on the longest paths of the precedence dag An HLF schedule is guaranteed to be optimum and can be constructed efficiently. © 1982, ACM. All rights reserved.