1609 search results - page 152 / 322 » A Microeconomic Scheduler for Parallel Computers |
189
click to vote
ICDCS
1992
IEEE
15 years 10 months ago
1992
IEEE
In a distributed system or communication network tasks may need to be executed on more than one processor. For time-critical tasks, the timing constraints are typically given as e...
170
click to vote
GCC
2006
Springer
15 years 10 months ago
2006
Springer
In this paper, we propose a new scheduling algorithm with economic theory, called Black Scholes Market (BSM) algorithm for a class of Dynamic Jobs (DJ). BSM is based on the classi...
181
click to vote
GRID
2006
Springer
15 years 6 months ago
2006
Springer
Desktop Grids have proved to be a suitable platform for the execution of Bag-of-Tasks applications but, being characterized by a high resource volatility, require the availability ...
192
click to vote
AINA
2010
IEEE
15 years 6 months ago
2010
IEEE
—Virtual machines offer unique advantages to the scientific computing community, such as Quality of Service(QoS) guarantee, performance isolation, easy resource management, and ...
159
click to vote
CP
2004
Springer
15 years 12 months ago
2004
Springer
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve planning and scheduling problems. Tasks are allocated to facilities using MILP and sche...