Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical Processors
Journal of the ACM (JACM)
Future Generation Computer Systems - Special issue on metacomputing
Benchmarking and comparison of the task graph scheduling algorithms
Journal of Parallel and Distributed Computing
Hypertool: A Programming Aid for Message-Passing Systems
IEEE Transactions on Parallel and Distributed Systems
Network topology generators: degree-based vs. structural
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Image Processing or the Grid: A Toolkit or Building Grid-enabled Image Processing Applications.
CCGRID '03 Proceedings of the 3st International Symposium on Cluster Computing and the Grid
GriPhyN and LIGO, Building a Virtual Data Grid for Gravitational Wave Scientists
HPDC '02 Proceedings of the 11th IEEE International Symposium on High Performance Distributed Computing
BRITE: An Approach to Universal Topology Generation
MASCOTS '01 Proceedings of the Ninth International Symposium in Modeling, Analysis and Simulation of Computer and Telecommunication Systems
A first-principles approach to understanding the internet's router-level topology
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Realistic Modeling and Svnthesis of Resources for Computational Grids
Proceedings of the 2004 ACM/IEEE conference on Supercomputing
A taxonomy of scientific workflow systems for grid computing
ACM SIGMOD Record
Efficient resource description and high quality selection for virtual grids
CCGRID '05 Proceedings of the Fifth IEEE International Symposium on Cluster Computing and the Grid - Volume 01
Pegasus: A framework for mapping complex scientific workflows onto distributed systems
Scientific Programming
NP-complete scheduling problems
Journal of Computer and System Sciences
Generating grid resource requirement specifications
Proceedings of the 16th international symposium on High performance distributed computing
Automatic resource specification generation for resource selection
Proceedings of the 2007 ACM/IEEE conference on Supercomputing
Joint Elastic Cloud and Virtual Network Framework for Application Performance-cost Optimization
Journal of Grid Computing
Characterizing and profiling scientific workflows
Future Generation Computer Systems
| Hi-index | 0.00 |
Users and developers of grid applications have access to increasing numbers of resources. While more resources generally mean higher capabilities for an application, they also raise the issue of application scheduling scalability. First, even polynomial time scheduling heuristics may take a prohibitively long time to compute a schedule. Second, and perhaps more critical, it may not be possible to gather all the resource information needed by a scheduling algorithm in a scalable manner. Our application focus is scientific workflows, which can be represented as Directed Acyclic Graphs (DAGs). Our claim is that, in future resource-rich environments, simple scheduling algorithms may be sufficient to achieve good workflow performances. We introduce a scalable scheduling approach that uses a resource abstraction called a virtual grid (VG). Our simulations of a range of typical DAG structures and resources demonstrate that a simple greedy scheduling heuristic combined with the virtual grid abstraction is as effective and more scalable than more complex heuristic DAG scheduling algorithms on large-scale platforms.