Paper Info
Title
A heuristic for optimum allocation of real-time service workflows
Abstract
In this paper, the problem of optimum allocation of real-time service workflows over a set of heterogeneous resources is tackled. In previous works, this problem was formally stated in terms of a Mixed-Integer Non-Linear Programming optimization program, that could be solved by recurring to commercial solvers. However, due to the big dimension of the solution space to be searched, finding the absolutely optimum solution: might take too much time in order to be concretely useful; it may preclude the use of these techniques in large-scale infrastructures; it makes the technique hardly usable adaptively in response to corrective actions that may be needed when some bad event occurs while the services are running (e.g., hardware-level failures). Therefore, in this paper a heuristic algorithm based on graph-matching is introduced that may find very efficiently a reasonably good, albeit non-necessarily optimum, solution. The algorithm is described, and its performance assessed by a set of synthetic experiments.
Year
DOI
Venue
2011
10.1109/SOCA.2011.6166216
Service-Oriented Computing and Applications
Keywords
Field
DocType
big dimension,optimum allocation,corrective action,commercial solvers,bad event,optimum solution,solution space,heuristic algorithm,mixed-integer non-linear programming optimization,real-time service workflows,hardware-level failure,resource allocation,graph matching,graph theory,real time,workflow,heuristic
USable,Graph theory,Heuristic,Computer science,Heuristic (computer science),Real-time computing,Theoretical computer science,Resource allocation,Workflow,Distributed computing
Conference
ISBN
Citations 
PageRank 
978-1-4673-0317-0
4
0.48
References 
Authors
6
2
Name
Order
Citations
PageRank
Tommaso Cucinotta147238.23
Gaetano F. Anastasi21518.66