Matchmaking for covariant hierarchies

ACP4IS '09: Proceedings of the 8th workshop on Aspects, components, and patterns for infrastructure software（2009）

Cited 2|Views0

No score

Abstract

We describe a model of matchmaking suitable for the implementation of services, rather than for their discovery and composition. In the model, processing requirements are modelled by client requests and computational resources are software processors that compete for request processing as the covariant implementations of an open service interface. Matchmaking then relies on type analysis to rank processors against requests in support of a wide range of dispatch strategies. We relate the model to the autonomicity of service provision and briefly report on its deployment within a production-level infrastructure for scientific computing.

Translated text

Key words

open service interface,production-level infrastructure,service extensibility and autonomicity,dispatch strategy,covariant hierarchy,dynamic deployment,client request,service provision,request processing,covariant implementation,computational resource,covariance,scientific computing,processing requirement,matchmaking

AI Read Science

Must-Reading Tree

Example

Generate MRT to find the research sequence of this paper

Chat Paper

Summary is being generated by the instructions you defined