Linear programming: methods and applications (5th ed.)
Linear programming: methods and applications (5th ed.)
Spawn: A Distributed Computational Economy
IEEE Transactions on Software Engineering
Mechanisms for Just-in-Time Allocation of Resources to Adaptive Parallel Programs
IPPS '99/SPDP '99 Proceedings of the 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed Processing
The Globus Project: A Status Report
HCW '98 Proceedings of the Seventh Heterogeneous Computing Workshop
HCW '99 Proceedings of the Eighth Heterogeneous Computing Workshop
Matchmaking: Distributed Resource Management for High Throughput Computing
HPDC '98 Proceedings of the 7th IEEE International Symposium on High Performance Distributed Computing
Legion: An Operating System for Wide-Area Computing
Legion: An Operating System for Wide-Area Computing
The Core Legion Object Model
Resource Management in Legion
User-level resource-constrained sandboxing
WSS'00 Proceedings of the 4th conference on USENIX Windows Systems Symposium - Volume 4
Enforcing Resource Sharing Agreements among Distributed Server Clusters
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Executing multiple pipelined data analysis operations in the grid
Proceedings of the 2002 ACM/IEEE conference on Supercomputing
Usage Policy-Based CPU Sharing in Virtual Organizations
GRID '04 Proceedings of the 5th IEEE/ACM International Workshop on Grid Computing
| Hi-index | 0.00 |
Advances in computing and networking technology, and an explosion in information sources has resulted in a growing number of distributed systems being constructed out of resources contributed by multiple sources. Use of such resources is typically governed by sharing agreements between owning principals, which limit both who can access a resource and in what quantity. Despite their increasing importance, existing resource management infrastructures offer only limited support for the expression and enforcement of sharing agreements, typically restricting themselves to identifying compatible resources. In this paper, we present a novel approach building on the concepts of tickets and currencies to express resource sharing agreements in an abstract, dynamic, and uniform fashion. We also formulate the allocation problem of enforcing these agreements as alinear-programming model, automatically factoring the transitive availability of resources via chained agreements. A case study modeling resource sharing among ISP-level web proxies shows the benefits of enforcing transitive agreements: worst-case waiting times of clients accessing these proxies improves by up to two orders of magnitude.