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 language | English (US) |
|---|---|
| Pages (from-to) | 320-330 |
| Number of pages | 11 |
| Journal | Performance Evaluation |
| Volume | 1 |
| Issue number | 4 |
| State | Published - 1981 |
| Externally published | Yes |
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
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver