OPTIMAL TWO PROCESSOR SCHEDULING OF TREE PRECEDENCE CONSTRAINED TASKS WITH TWO EXECUTION TIMES.

Kazuo Nakajima, Joseph Leung, S. Louis Hakimi

Research output: Contribution to journalArticlepeer-review

7 Scopus citations

Abstract

Authors consider a set of n tasks with a tree precedence relation and execution time of 1 or 2 units, and present an O(n log n) time algorithm to find a minimum length schedule of these tasks on two identical processors. Possible generalizations, as well as the relations between this algorithm and other scheduling algorithms, are described.

Original languageEnglish (US)
Pages (from-to)320-330
Number of pages11
JournalPerformance Evaluation
Volume1
Issue number4
StatePublished - Jan 1 1981

All Science Journal Classification (ASJC) codes

  • Software
  • Modeling and Simulation
  • Hardware and Architecture
  • Computer Networks and Communications

Fingerprint

Dive into the research topics of 'OPTIMAL TWO PROCESSOR SCHEDULING OF TREE PRECEDENCE CONSTRAINED TASKS WITH TWO EXECUTION TIMES.'. Together they form a unique fingerprint.

Cite this