In this report we describe a greedy algorithm to schedule parallel jobs that consist of independent, identical, compute-bound tasks on desktop grids that consist of volatile compute resources. We assume that the algorithm has full knowledge of future resource availability and we prove that it achieves the optimal schedule (i.e., the one with the minimum makespan). Although this algorithm cannot be implemented in practice, it is a good comparator to evaluate other scheduling heuristics and the makespan it achieves can be computed in a straightforward manner.
The authors of these documents have submitted their reports to this technical report series for the purpose of non-commercial dissemination of scientific work. The reports are copyrighted by the authors, and their existence in electronic format does not imply that the authors have relinquished any rights. You may copy a report for scholarly, non-commercial purposes, such as research or instruction, provided that you agree to respect the author's copyright. For information concerning the use of this document for other than research or instructional purposes, contact the authors. Other information concerning this technical report series can be obtained from the Computer Science and Engineering Department at the University of California at San Diego, email@example.com.
[ Search ]