Exploiting process lifetime distributions for dynamic load balancing
ACM Transactions on Computer Systems (TOCS)
IEEE Transactions on Parallel and Distributed Systems
Algorithms for minimizing weighted flow time
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Pricing WiFi at Starbucks: issues in online mechanism design
Proceedings of the 4th ACM conference on Electronic commerce
A Case For Grid Computing On Virtual Machines
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
User-Centric Performance Analysis of Market-Based Cluster Batch Schedulers
CCGRID '02 Proceedings of the 2nd IEEE/ACM International Symposium on Cluster Computing and the Grid
Truthful Mechanisms for One-Parameter Agents
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Market-based Proportional Resource Sharing for Clusters
Market-based Proportional Resource Sharing for Clusters
Mechanism design for online real-time scheduling
EC '04 Proceedings of the 5th ACM conference on Electronic commerce
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
Analyzing Market-Based Resource Allocation Strategies for the Computational Grid
International Journal of High Performance Computing Applications
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
Algorithmic Game Theory
Bridging the Adoption Gap-Developing a Roadmap for Trading in Grids
Electronic Markets
Decentralization and mechanism design for online machine scheduling
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
On Multi-dimensional Envy-Free Mechanisms
ADT '09 Proceedings of the 1st International Conference on Algorithmic Decision Theory
Envy-Free Allocations for Budgeted Bidders
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
The Effects of Untruthful Bids on User Utilities and Stability in Computing Markets
CCGRID '10 Proceedings of the 2010 10th IEEE/ACM International Conference on Cluster, Cloud and Grid Computing
| Hi-index | 0.00 |
Until recently, only few grid and cluster systems provided preemptive migration (e.g. [4]), which is the ability of dynamically moving computational tasks across machines during runtime. The emergent technology of virtualization (e.g. [10]) provides off-the-shelf support for migration, thus making the use of this feature widely accessible. Existing literature largely neglects the close interrelationship between technical migration and economic fairness. In this paper we take a first step towards closing this gap. We present fairness and quality of service properties for economic online scheduling algorithms. Under mild assumptions we analytically 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. In order to evaluate the effect of migration cost on the scheduling algorithm, we performed extensive empirical analysis based on real data. The results indicate that migration gives designers of economic online schedulers a tremendous pull on the algorithmpsilas fairness properties even in the presence of worst-case realistic migration cost.