A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
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 precludedoi:10.1109/soca.2011.6166216 dblp:conf/soca/CucinottaA11 fatcat:cw2w6enucvgk7kreboz7atk63i