Optimal schedules for data-parallel cycle-stealing in networks of workstations (extended abstract)
Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures
Optimal Schedules for Cycle-Stealing in a Network of Workstations with a Bag-of-Tasks Workload
IEEE Transactions on Parallel and Distributed Systems
Benchmarks and Standards for the Evaluation of Parallel Job Schedulers
IPPS/SPDP '99/JSSPP '99 Proceedings of the Job Scheduling Strategies for Parallel Processing
On Scheduling Mesh-Structured Computations for Internet-Based Computing
IEEE Transactions on Computers
Guidelines for Scheduling Some Common Computation-Dags for Internet-Based Computing
IEEE Transactions on Computers
On Scheduling Complex Dags for Internet-Based Computing
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
Toward a Theory for Scheduling Dags in Internet-Based Computing
IEEE Transactions on Computers
IEEE Transactions on Parallel and Distributed Systems
Extending IC-scheduling via the Sweep Algorithm
Journal of Parallel and Distributed Computing
Batch-Scheduling dags for internet-based computing
Euro-Par'05 Proceedings of the 11th international Euro-Par conference on Parallel Processing
A pebble game for internet-based computing
Theoretical Computer Science
| Hi-index | 0.01 |
We explore the creation of a metacomputer by the aggregation of independent sites. Joining a metacomputer is voluntary, and hence it has to be an endeavor that mutually benefits all parties involved. We identify proportional-share allocation as a key component of such a mutual benefit. Proportional-share allocation is the basis for enforcing the agreement reached among the sites on how to use the metacomputer's resources. We introduce a resource manager that provides proportional-share allocation over a cluster of workstations, assuming applications to be master-slave. This manager is novel because it performs non-preemptive proportional scheduling of multiple processors. A prototype has been implemented and we report on preliminary results. Finally, we discuss how tickets (first-class entities that encapsulate allocation endowments) can be used in practice to enforce the meta-computer agreement, and also how they can ease the site selection to be performed by the application