Matchmaking for covariant hierarchies

Simeoni, F. and Lievens, D.; (2009) Matchmaking for covariant hierarchies. In: ACP4IS '09: Proceedings of the 8th workshop on Aspects, components, and patterns for infrastructure software. UNSPECIFIED, pp. 13-18. (https://doi.org/10.1145/1509276.1509281)

[thumbnail of acp4is03_simeoni.pdf]
Preview
 PDF. Filename: acp4is03_simeoni.pdf
Accepted Author Manuscript
Download (224kB)| Preview

Abstract

We describe a model of matchmaking suitable for the implementation of services, rather than their 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 scientic computing.

CORE (COnnecting REpositories)