Static-task scheduling incorporating precedence constraints and deadlines in a heterogeneous-computing environment / Michael D Niedert

Distributed systems have grown in popularity due to the rapid increase in networking of personal computers. A mixture of computers consisting of different architectures can be more powerful, reliable, and scalable than a single supercomputer. The problem of optimally scheduling jobs on a cluster of heterogeneous machines to minimize the time at which the last machine finishes is NP-complete. Nonetheless, the choice of a heuristic algorithm greatly affects the speed of solution. This work evaluates a greedy algorithm, an A* algorithm, and a simulated annealing algorithm applied to the heterogeneous scheduling problem with deadline and dependency constraints. Tradeoffs of speed and schedule quality were noted between the algorithms. The greedy algorithm produced results quicker than the A* and simulated annealing algorithms, but with a lower schedule quality. Because of these offsetting performance criteria, an analysis was conducted to determine which algorithms should be used for which input cases.

Grantor dc:publisher

Monterey, California. Naval Postgraduate School

Year dc:date.issued

2000

Author dc:creator

• Niedert, Michael D.

Advisor dc:contributor.advisor

• Rowe, Neil

Language dc:language.iso

en_US

Identifier URI

http://handle.dtic.mil/100.2/ADA380969

OAI identifier oai:identifier

oai:calhoun.nps.edu:10945/9303