Essays in computing science
Communications of the ACM
SIGMETRICS '94 Proceedings of the 1994 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Future Generation Computer Systems - Special double issue: high performance computing and networking (HPCN)
Implementation of decentralized load sharing in networked workstations using the Condor package
Journal of Parallel and Distributed Computing
COBRA fundamentals and programming
COBRA fundamentals and programming
Parallel application scheduling on networks of workstations
Journal of Parallel and Distributed Computing
Solving Scheduling Problems by Simulated Annealing
SIAM Journal on Control and Optimization
Hierarchical resource management in the polder metacomputing initiative
Parallel Computing - Special issue on applications
Analysis of first-come-first-serve parallel job scheduling
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
A Case for NOW (Networks of Workstations)
IEEE Micro
Metacomputing to Overcome the Power Limits of a Single Machine
HPCN Europe '97 Proceedings of the International Conference and Exhibition on High-Performance Computing and Networking
High-Performance Computer Management Based on JAVA
HPCN Europe 1998 Proceedings of the International Conference and Exhibition on High-Performance Computing and Networking
Job Characteristics of a Production Parallel Scientivic Workload on the NASA Ames iPSC/860
IPPS '95 Proceedings of the Workshop on Job Scheduling Strategies for Parallel Processing
Packing Schemes for Gang Scheduling
IPPS '96 Proceedings of the Workshop on Job Scheduling Strategies for Parallel Processing
Architecture-Independent Request-Scheduling with Tight Waiting-Time Estimations
IPPS '96 Proceedings of the Workshop on Job Scheduling Strategies for Parallel Processing
Implementing Multiprocessor Scheduling Disciplines
IPPS '97 Proceedings of the Job Scheduling Strategies for Parallel Processing
Theory and Practice in Parallel Job Scheduling
IPPS '97 Proceedings of the Job Scheduling Strategies for Parallel Processing
Predicting Application Run Times Using Historical Information
IPPS/SPDP '98 Proceedings of the Workshop on Job Scheduling Strategies for Parallel Processing
Metrics and Benchmarking for Parallel Job Scheduling
IPPS/SPDP '98 Proceedings of the Workshop on Job Scheduling Strategies for Parallel Processing
PHASE and MICA: Application Specific Metacomputing
Euro-Par '97 Proceedings of the Third International Euro-Par Conference on Parallel Processing
Mapping and Scheduling by Genetic Algorithms
CONPAR 94 - VAPP VI Proceedings of the Third Joint International Conference on Vector and Parallel Processing: Parallel Processing
Preemptive Weighted Completion Time Scheduling of Parallel Jobs
ESA '96 Proceedings of the Fourth Annual European Symposium on Algorithms
A Comparative Analysis of Static Processor Partitioning Policies for Parallel Computers
MASCOTS '93 Proceedings of the International Workshop on Modeling, Analysis, and Simulation On Computer and Telecommunication Systems
Breaking the Curse of Dynamics by Task Migration: Pilot Experiments in the Polder Metacomputer
Proceedings of the 4th European PVM/MPI Users' Group Meeting on Recent Advances in Parallel Virtual Machine and Message Passing Interface
The MOL project: an open, extensible metacomputer
HCW '97 Proceedings of the 6th Heterogeneous Computing Workshop (HCW '97)
A Model For Speedup of Parallel Programs
A Model For Speedup of Parallel Programs
A Parallel Workload Model and its Implications for Processor
A Parallel Workload Model and its Implications for Processor
Resource Management in Legion
A Characterization of the Variation in Time of Workload Arrival Patterns
IEEE Transactions on Computers
Distributed Job Scheduling on Computational Grids Using Multiple Simultaneous Requests
HPDC '02 Proceedings of the 11th IEEE International Symposium on High Performance Distributed Computing
Job Scheduling for Grid Computing on Metacomputers
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 4 - Volume 05
Job scheduling and processor allocation for grid computing on metacomputers
Journal of Parallel and Distributed Computing - Special issue: Design and performance of networks for super-, cluster-, and grid-computing: Part II
CASP: a community-aware scheduling protocol
International Journal of Grid and Utility Computing
Optimizing the access to read-only data in grid computing
DAIS'05 Proceedings of the 5th IFIP WG 6.1 international conference on Distributed Applications and Interoperable Systems
| Hi-index | 0.01 |
The main advantage of a metacomputer is not its peak performance but better utilization of its machines. Therefore, efficient scheduling strategies are vitally important to any metacomputing project. A real metacomputer management system will not gain exclusive access to all its resources, because participating centers will not be willing to give up autonomy. As a consequence, the scheduling algorithm has to deal with a set of local sub-schedulers performing individual machine management. Based on the proposal made by Feitelson and Rudolph in 1998 we developed a scheduling model that takes these circumstances into account. It has been implemented as a generic simulation environment, which we make available to the public. Using this tool, we examined the behavior of several well known scheduling algorithms in a metacomputing scenario. The results demonstrate that interaction with the sub-schedulers, communication of parallel applications, and the huge size of the metacomputer are among the most important aspects for scheduling a metacomputer. Based upon these observations we developed a new technique that makes it possible to use scheduling algorithms developed for less realistic machine models for real world metacomputing projects. Simulation runs demonstrate that this technique leads to far better results than the algorithms currently used in metacomputer management systems.