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

Fingerprint

Processing
Chemical analysis

Keywords

  • covariant hirerachies
  • matchmaking
  • computer science

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)
Simeoni, F. ; Lievens, D. / Matchmaking for covariant hierarchies. ACP4IS '09: Proceedings of the 8th workshop on Aspects, components, and patterns for infrastructure software. 2009. pp. 13-18
@inproceedings{5dd41494c9754d27a50287a575c2af3b,
title = "Matchmaking for covariant hierarchies",
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 aresoftware 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 dispatchstrategies. We relate the model to the autonomicity of service provision and brieflyreport on its deployment within a production-level infrastructure for scientic computing.",
keywords = "covariant hirerachies, matchmaking, computer science",
author = "F. Simeoni and D. Lievens",
year = "2009",
language = "English",
pages = "13--18",
booktitle = "ACP4IS '09: Proceedings of the 8th workshop on Aspects, components, and patterns for infrastructure software",

}

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.

Matchmaking for covariant hierarchies. / Simeoni, F.; Lievens, D.

ACP4IS '09: Proceedings of the 8th workshop on Aspects, components, and patterns for infrastructure software. 2009. p. 13-18.

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

TY - GEN

T1 - Matchmaking for covariant hierarchies

AU - Simeoni, F.

AU - Lievens, D.

PY - 2009

Y1 - 2009

N2 - 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 aresoftware 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 dispatchstrategies. We relate the model to the autonomicity of service provision and brieflyreport on its deployment within a production-level infrastructure for scientic computing.

AB - 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 aresoftware 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 dispatchstrategies. We relate the model to the autonomicity of service provision and brieflyreport on its deployment within a production-level infrastructure for scientic computing.

KW - covariant hirerachies

KW - matchmaking

KW - computer science

UR - http://www.d4science.eu/files/docs/aosd09/acp4is03-simeoni.pdf

UR - http://portal.acm.org/ft_gateway.cfm?id=1509281&type=pdf&coll=Portal&dl=GUIDE&CFID=76298374&CFTOKEN=30615543

M3 - Conference contribution book

SP - 13

EP - 18

BT - ACP4IS '09: Proceedings of the 8th workshop on Aspects, components, and patterns for infrastructure software

ER -

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