Premium
A hybrid approach for selecting service‐based real‐time composition algorithms in heterogeneous environments
Author(s) -
EstévezAyres Iria,
GarcíaValls Marisol,
BasantaVal Pablo,
DíezSánchez Jorge
Publication year - 2011
Publication title -
concurrency and computation: practice and experience
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.309
H-Index - 67
eISSN - 1532-0634
pISSN - 1532-0626
DOI - 10.1002/cpe.1766
Subject(s) - computer science , heuristics , flexibility (engineering) , bounded function , service composition , distributed computing , composition (language) , process (computing) , service (business) , algorithm , order (exchange) , web service , mathematics , operating system , mathematical analysis , linguistics , statistics , philosophy , economy , finance , world wide web , economics
Service‐based approach has been successfully applied to distributed environments, modelling them as pieces of functionality that exchange information by means of messages in order to achieve a common goal. The advantages of this approach can be also be applied to distributed real‐time systems, increasing their flexibility and allowing the creation of new brand applications from existing services in the system. If this is an online process, then time‐bounded composition algorithms are needed to not jeopardize the performance of the whole system. Different composition algorithms are studied and proposed, two of them optimal and another two based on heuristics. This paper presents an analytical solution that selects, depending on the structure of the application and on the load of the whole system, the most suitable composition algorithm to be executed in order to obtain a composed application in bounded time. Copyright © 2011 John Wiley & Sons, Ltd.