Matchmaking for covariant hierarchies

F. Simeoni, D. Lievens

Research output: Chapter in Book/Report/Conference proceedingConference contribution book

2 Citations (Scopus)
43 Downloads (Pure)

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.
Original languageEnglish
Title of host publicationACP4IS '09: Proceedings of the 8th workshop on Aspects, components, and patterns for infrastructure software
Pages13-18
Number of pages6
Publication statusPublished - 2009

Keywords

  • covariant hirerachies
  • matchmaking
  • computer science

Fingerprint Dive into the research topics of 'Matchmaking for covariant hierarchies'. Together they form a unique fingerprint.

  • Cite this

    Simeoni, F., & Lievens, D. (2009). Matchmaking for covariant hierarchies. In ACP4IS '09: Proceedings of the 8th workshop on Aspects, components, and patterns for infrastructure software (pp. 13-18)