Divisible load applications consist of a load, that is input data and associated computation, that can be divided arbitrarily into independent pieces. Such applications arise in many fields and are ideally suited to a master-worker execution, but they poseseveral scheduling challenges. While the ``Divisible Load Scheduling'' (DLS) problem has been studied extensively from a theoretical standpoint, in this paper we focus on practical issues: we extend a production Grid application execution environment, APST, to support divisible load applications; we implement previously proposed DLS algorithms as part of APST; we evaluateand compare these algorithms on a real-world two-cluster platform; we show in a casestudy how a user can easily and effectively run a real-world divisible load application; and we uncover several issues that are critical for using DLS theory in practice effectively. To the best of our knowledgethe software resulting from this work, APST-DV, is the first usable and generic tool fordeploying divisible load applications on distributed computing platforms.
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 ]