A constraint language approach to matchmaking

摘要: The need to discover and select entities that match specified requirements arises in many contexts distributed systems. Meeting this is complicated by the fact not only may potential consumer specify constraints on resources, but owner of entity question consumer. This observation has motivated Raman et al. propose discovery selection be implemented as symmetric matching process, an approach they take their ClassAds system. We present here a new achieves significant advances expressivities relative current - for example, allowing multi-way matches, expression location resource with negotiable capability. key our we reinterpret constraint problem exploit constraint-solving technologies implement operations. have prototyped matchmaking mechanism, named Redline, used it model solve several challenging problems.