The grid: blueprint for a new computing infrastructure
The grid: blueprint for a new computing infrastructure
Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical Processors
Journal of the ACM (JACM)
Dynamic mapping of a class of independent tasks onto heterogeneous computing systems
Journal of Parallel and Distributed Computing - Special issue on software support for distributed computing
Segmented Min-Min: A Static Mapping Algorithm for Meta-Tasks on Heterogeneous Computing Systems
HCW '00 Proceedings of the 9th Heterogeneous Computing Workshop
Case-Based Classification Using Similarity-Based Retrieval
ICTAI '96 Proceedings of the 8th International Conference on Tools with Artificial Intelligence
The impact of runtime estimation inaccuracy on scheduler performance
PDCS '07 Proceedings of the 19th IASTED International Conference on Parallel and Distributed Computing and Systems
ServiceWave'11 Proceedings of the 4th European conference on Towards a service-based internet
Hi-index | 0.00 |
Effective and efficient use of grid resources is achieved by using scheduling heuristics. Many such heuristics have been developed over the last decade. However, as none of the heuristics performs well in all conditions, how can we dynamically determine the best one to choose? In this paper, we describe CasSim (Centre for Advanced Studies Simulator), and use it to dynamically select the best heuristic. In contrast to other grid simulators, CasSim has a simple abstract model, and can easily and quickly compare different scheduling heuristics. Experimental validation of CasSim shows that CasSim selects heuristics accurately and it can be used in the real system. In addition, we extend CasSim to support a wider range of applications by enabling users to define costs.