Bibliography: leaves 211-234. The general problem of scheduling is investigated, with focus on jobs consisting of both independent and dependent programs. Using the constraint of restricted placement of programs, presents a scheduling system that produces heuristically good execution schedules in the absence of complete global system state information.
| Identifer | oai:union.ndltd.org:ADTP/90795 |
| Date | January 1999 |
| Creators | James, Heath A. (Heath Alexander) |
| Source Sets | Australiasian Digital Theses Program |
| Language | English |
| Detected Language | English |
| Relation | SUA |
Page generated in 0.0021 seconds