Scheduling multi-component applications in heterogeneous wide-area networks
- 7 November 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 209-215
- https://doi.org/10.1109/hcw.2000.843745
Abstract
In this paper, we present a scalable scheduling heuristic for several common classes of multi-component applications (meta-applications). We consider this scheduling problem in a wide-area heterogeneous computing environment, or metasystem. The heterogeneity and scale of the computing environment and the heterogeneity of the application make this a challenging problem.We have studied the performance of the heuristic in simulation and the results are encouraging. Completion times for three common classes of meta-applications were within 10-20% of optimal on average with a worst-case variance of 60%. The results suggest that effective scheduling of meta-applications is possible, if sufficient application and system resource cost information is provided.Keywords
This publication has 7 references indexed in Scilit:
- Running a climate model in a heterogeneous, distributed computer environmentPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Gallop: The Benefits of Wide-Area Computing for Parallel ProcessingJournal of Parallel and Distributed Computing, 1998
- How application domains define requirements for the GridCommunications of the ACM, 1997
- Globus: a Metacomputing Infrastructure ToolkitThe International Journal of Supercomputer Applications and High Performance Computing, 1997
- The Legion vision of a worldwide virtual computerCommunications of the ACM, 1997
- Scheduling from the perspective of the applicationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1996
- A framework for partitioning parallel computations in heterogeneous environmentsConcurrency: Practice and Experience, 1995