Matchmaking for covariant hierarchies

  • Authors:
  • Fabio Simeoni;David Lievens

  • Affiliations:
  • University of Strathclyde, Glasgow, United Kingdom;Trinity College, Dublin, Ireland

  • Venue:
  • Proceedings of the 8th workshop on Aspects, components, and patterns for infrastructure software
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

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.