Future Generation Computer Systems - Special issue on metacomputing
SETI@HOME—massively distributed computing for SETI
Computing in Science and Engineering
Viewpoint: From TeraGrid to knowledge grid
Communications of the ACM
Netbed: an integrated experimental environment
ACM SIGCOMM Computer Communication Review
Job Scheduling Under the Portable Batch System
IPPS '95 Proceedings of the Workshop on Job Scheduling Strategies for Parallel Processing
A Resource Management Architecture for Metacomputing Systems
IPPS/SPDP '98 Proceedings of the Workshop on Job Scheduling Strategies for Parallel Processing
A blueprint for introducing disruptive technology into the Internet
ACM SIGCOMM Computer Communication Review
Matchmaking: Distributed Resource Management for High Throughput Computing
HPDC '98 Proceedings of the 7th IEEE International Symposium on High Performance Distributed Computing
Resource Co-Allocation in Computational Grids
HPDC '99 Proceedings of the 8th IEEE International Symposium on High Performance Distributed Computing
Design and Evaluation of a Resource Selection Framework for Grid Applications
HPDC '02 Proceedings of the 11th IEEE International Symposium on High Performance Distributed Computing
Policy Driven Heterogeneous Resource Co-Allocation with Gangmatching
HPDC '03 Proceedings of the 12th IEEE International Symposium on High Performance Distributed Computing
XenoSearch: Distributed Resource Discovery in the XenoServer Open Platform
HPDC '03 Proceedings of the 12th IEEE International Symposium on High Performance Distributed Computing
Constrained Component Deployment in Wide-Area Networks Using AI Planning Techniques
IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
Grid Information Services for Distributed Resource Sharing
HPDC '01 Proceedings of the 10th IEEE International Symposium on High Performance Distributed Computing
Condor-G: A Computation Management Agent for Multi-Institutional Grids
HPDC '01 Proceedings of the 10th IEEE International Symposium on High Performance Distributed Computing
BRITE: An Approach to Universal Topology Generation
MASCOTS '01 Proceedings of the Ninth International Symposium in Modeling, Analysis and Simulation of Computer and Telecommunication Systems
A Constraint Language Approach to Matchmaking
RIDE '04 Proceedings of the 14th International Workshop on Research Issues on Data Engineering: Web Services for E-Commerce and E-Government Applications (RIDE'04)
Building Self-Configuring Services Using Service-Specific Knowledge
HPDC '04 Proceedings of the 13th IEEE International Symposium on High Performance Distributed Computing
SpiderNet: An Integrated Peer-to-Peer Service Composition Framework
HPDC '04 Proceedings of the 13th IEEE International Symposium on High Performance Distributed Computing
The Grid2003 Production Grid: Principles and Practice
HPDC '04 Proceedings of the 13th IEEE International Symposium on High Performance Distributed Computing
Realistic Modeling and Svnthesis of Resources for Computational Grids
Proceedings of the 2004 ACM/IEEE conference on Supercomputing
Nondeterministic Queries in a Relational Grid Information Service
Proceedings of the 2003 ACM/IEEE conference on Supercomputing
Efficient resource description and high quality selection for virtual grids
CCGRID '05 Proceedings of the Fifth IEEE International Symposium on Cluster Computing and the Grid - Volume 01
Experiences with the KOALA co-allocating scheduler in multiclusters
CCGRID '05 Proceedings of the Fifth IEEE International Symposium on Cluster Computing and the Grid (CCGrid'05) - Volume 2 - Volume 02
Design and implementation tradeoffs for wide-area resource discovery
HPDC '05 Proceedings of the High Performance Distributed Computing, 2005. HPDC-14. Proceedings. 14th IEEE International Symposium
Co-scheduling with user-settable reservations
JSSPP'05 Proceedings of the 11th international conference on Job Scheduling Strategies for Parallel Processing
VGrADS: enabling e-Science workflows on grids and clouds with fault tolerance
Proceedings of the Conference on High Performance Computing Networking, Storage and Analysis
A reputation-driven scheduler for autonomic and sustainable resource sharing in Grid computing
Journal of Parallel and Distributed Computing
Multi-agent distributed adaptive resource allocation (MADARA)
International Journal of Communication Networks and Distributed Systems
BTS: Resource capacity estimate for time-targeted science workflows
Journal of Parallel and Distributed Computing
Cost optimized provisioning of elastic resources for application workflows
Future Generation Computer Systems
An Analysis of Provisioning and Allocation Policies for Infrastructure-as-a-Service Clouds
CCGRID '12 Proceedings of the 2012 12th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (ccgrid 2012)
Scheduling Concurrent Applications on a Cluster of CPU-GPU Nodes
CCGRID '12 Proceedings of the 2012 12th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (ccgrid 2012)
Scheduling concurrent applications on a cluster of CPU-GPU nodes
Future Generation Computer Systems
Hi-index | 0.00 |
Discovering and acquiring appropriate, complex resource collections in large-scale distributed computing environments is a fundamental challenge and is critical to application performance. This paper presents a new formulation of the resource selection problem and a new solution to the resource selection and binding problem called integrated selection and binding. Composition operators in our resource description language and efficient data organization enable our approach to allocate complex resource collections efficiently and effectively even in the presence of competition for resources. Our empirical evaluation shows that the integrated approach can produce solutions of significantly higher quality at higher success rate and lower cost than the traditional separate approach. The success rate of the integrated approach can tolerate as much as 15%-60% lower resource availability than the separate approach. Moreover, most requests have at least the 98th percentile rank and can be served in 6 seconds with a population of 1 million hosts.