Lessons from resource allocators for large-scale multiuser testbeds
ACM SIGOPS Operating Systems Review
web services customization: a composition-based approach
ICWE '06 Proceedings of the 6th international conference on Web engineering
Collaborative data visualization for earth sciences with the OptIPuter
Future Generation Computer Systems - IGrid 2005: The global lambda integrated facility
Improving grid resource allocation via integrated selection and binding
Proceedings of the 2006 ACM/IEEE conference on Supercomputing
netEmbed: a service for embedding distributed applications
Proceedings of the 2007 ACM/IFIP/USENIX international conference on Middleware companion
Design and implementation trade-offs for wide-area resource discovery
ACM Transactions on Internet Technology (TOIT)
Composing adaptable-resources for answering complex queries in distributed systems
Proceedings of the 10th International Conference on Information Integration and Web-based Applications & Services
GPC'07 Proceedings of the 2nd international conference on Advances in grid and pervasive computing
A grid computing based virtual laboratory for environmental simulations
PPAM'07 Proceedings of the 7th international conference on Parallel processing and applied mathematics
SPARQL-based set-matching for semantic grid resource selection
BPM'07 Proceedings of the 2007 international conference on Business process management
A better way to negotiate for testbed resources
Proceedings of the Second Asia-Pacific Workshop on Systems
Customizable-Resources description, selection, and composition: a feature logic based approach
ODBASE'06/OTM'06 Proceedings of the 2006 Confederated international conference on On the Move to Meaningful Internet Systems: CoopIS, DOA, GADA, and ODBASE - Volume Part I
Preference---Based Matchmaking of Grid Resources with CP---Nets
Journal of Grid Computing
Feature logic for web resources customization: Design and implementation
International Journal of Knowledge-based and Intelligent Engineering Systems
| Hi-index | 0.00 |
The need to discover and select entities that match specified requirements arises in many contect in distributed systems. Meeting this need is complicated by the fact that not only may the potential consumer specify constraints on resources, but the owner of the entity in question may specify constraints on the consumer. This observation has motivated Raman et al. to propose that discovery and selection be implemented as symmetric matching process, an approach they take in their ClassAds system. We present here a new approach to symmetric matching that achieves significant advances in expressivities relative to the current ClassAds 驴 for example, allowing for multi-way matches, expression and location of resource with negotiable capability. The key to our approach is that we reinterpret matching as a constraint problem and exploit constraint-solving technologies to implement matching operations. We have prototyped a matchmaking mechanism, named Redline, and used it to model and solve several challenging matching problems.