Policy Driven Heterogeneous Resource Co-Allocation with Gangmatching
HPDC '03 Proceedings of the 12th IEEE International Symposium on High Performance Distributed Computing
A solver for the network testbed mapping problem
ACM SIGCOMM Computer Communication Review
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)
An integrated experimental environment for distributed systems and networks
OSDI '02 Proceedings of the 5th symposium on Operating systems design and implementationCopyright restrictions prevent ACM from being able to make the PDFs for this conference available for downloading
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
| Hi-index | 0.00 |
An increased number of applications, such as computational grids, testbeds, peer-to-peer networks, and sensor networks (among many others) rely on finding a set of resources that meet certain criteria for their operation. In particular, in many of these cases their requirements may be described as a labeled graph where nodes represent computational resources and links represent connectivity/communication requirements. Similarly, the infrastructure where the service will be deployed is also described by a labeled graph, where the attributes of nodes and links represent their capabilities. The problem of finding a feasible set of links and nodes on which to deploy the service is what we call the embedding problem.