Exploiting process lifetime distributions for dynamic load balancing
ACM Transactions on Computer Systems (TOCS)
A Case For Grid Computing On Virtual Machines
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
On approximately fair allocations of indivisible goods
EC '04 Proceedings of the 5th ACM conference on Electronic commerce
Online ascending auctions for gradually expiring items
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
On profit-maximizing envy-free pricing
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
An organizational grid of federated MOSIX clusters
CCGRID '05 Proceedings of the Fifth IEEE International Symposium on Cluster Computing and the Grid - Volume 01
An approximation algorithm for max-min fair allocation of indivisible goods
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Setting lower bounds on truthfulness: extended abstract
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Harnessing migrations in a market-based grid OS
GRID '08 Proceedings of the 2008 9th IEEE/ACM International Conference on Grid Computing
Using SLA mapping to increase market liquidity
ICSOC/ServiceWave'09 Proceedings of the 2009 international conference on Service-oriented computing
| Hi-index | 0.00 |
Computational grids offer users a simple access to tremendous computer resources for solving large scale computing problems. Traditional performance analysis of scheduling algorithms considers overall system performance while fairness analysis focuses on the individual performance each user receives. Until recently, only few grids and cluster systems provided preemptive migration (e.g. [2]), which is the ability of dynamically moving computational tasks across machines during runtime. The emergent technology of virtualization (e.g. [4]) provides off-the-shelf support for migration, thus making the use of this feature more accessible (even across different OS's). In this paper, we study the close relation between migration and fairness. We present fairness and quality of service properties for economic online scheduling algorithms. Under mild assumptions we show that it is impossible to achieve these properties without the use of migration. On the other hand, if zero cost migration is used, then these properties can be satisfied.