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

K. Nakajima, J. Y.T. Leung, S. L. Hakimi

Research output: Contribution to conferencePaperpeer-review

Abstract

Consider a set of n tasks with a tree precedence relation and two possible execution times, say 1 and 2. An O(n log n) algorithm is presented for optimally scheduling 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)
Pages480-490
Number of pages11
StatePublished - 1981
EventProc Annu Allerton Conf Commun Control Comput 18th - Monticello, IL, USA
Duration: Oct 8 1980Oct 11 1980

Conference

ConferenceProc Annu Allerton Conf Commun Control Comput 18th
CityMonticello, IL, USA
Period10/8/8010/11/80

All Science Journal Classification (ASJC) codes

  • Engineering(all)

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