Strathprints Home | Open Access | Browse | Search | User area | Copyright | Help | Library Home | SUPrimo

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.

[img]
Preview
PDF - Submitted Version
Download (219Kb) | 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.

    Item type: Book Section
    ID code: 32847
    Keywords: covariant hirerachies, matchmaking, computer science, Electronic computers. Computer science
    Subjects: Science > Mathematics > Electronic computers. Computer science
    Department: Faculty of Science > Computer and Information Sciences
    Related URLs:
    Depositing user: Pure Administrator
    Date Deposited: 29 Aug 2011 11:45
    Last modified: 06 Sep 2014 13:40
    URI: http://strathprints.strath.ac.uk/id/eprint/32847

    Actions (login required)

    View Item

    Fulltext Downloads: