The grid: blueprint for a new computing infrastructure
The grid: blueprint for a new computing infrastructure
Efficient approximation algorithms for scheduling malleable tasks
Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures
The elusive goal of workload characterization
ACM SIGMETRICS Performance Evaluation Review
Parallel Computer Architecture: A Hardware/Software Approach
Parallel Computer Architecture: A Hardware/Software Approach
Bi-criteria algorithm for scheduling jobs on cluster platforms
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
A batch scheduler with high level components
CCGRID '05 Proceedings of the Fifth IEEE International Symposium on Cluster Computing and the Grid (CCGrid'05) - Volume 2 - Volume 02
A Bi-criteria Algorithm for Scheduling Parallel Task Graphs on Clusters
CCGRID '10 Proceedings of the 2010 10th IEEE/ACM International Conference on Cluster, Cloud and Grid Computing
Energy-Aware Scheduling on Multicore Heterogeneous Grid Computing Systems
Journal of Grid Computing
Hi-index | 0.00 |
Today, large scale parallel systems are available at relatively low cost. Many powerful such systems have been installed all over the world and the number of users is always increasing. The use of such clusters requires special administration tools, which have been developed recently and most frequently rely on intuitive heuristics to solve the underlying difficult scheduling problems. On the other hand, recent theoretical work has designed a number of models, such as the Parallel Task model, specifically aimed at cluster environments. The objective of this work is to study and analyze the path from theoretical models and algorithms to their implementation on an actual environment on a real platform. We outline in detail the divergences between classical models and a real batch scheduling system, and propose solutions to adapt a theoretically well-founded algorithm to such a system. Experimental results show that this implementation performs about as well as FCFS with backfilling, and much better in the difficult instances. We hope that further usage of this algorithm in a live system will show that interaction between theory and practice can be fruitful.