Exploiting process lifetime distributions for dynamic load balancing
ACM Transactions on Computer Systems (TOCS)
IEEE Transactions on Parallel and Distributed Systems
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
Market-based Proportional Resource Sharing for Clusters
Market-based Proportional Resource Sharing for Clusters
Towards a Characterization of Truthful Combinatorial Auctions
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Mechanism design for online real-time scheduling
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
An organizational grid of federated MOSIX clusters
CCGRID '05 Proceedings of the Fifth IEEE International Symposium on Cluster Computing and the Grid - Volume 01
Setting lower bounds on truthfulness: extended abstract
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
A lower bound for scheduling mechanisms
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Algorithmic Game Theory
Decentralization and mechanism design for online machine scheduling
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
On-line scheduling to minimize average completion time revisited
Operations Research Letters
An Evaluation of the Benefits of Fine-Grained Value-Based Scheduling on General Purpose Clusters
CCGRID '10 Proceedings of the 2010 10th IEEE/ACM International Conference on Cluster, Cloud and Grid Computing
An evaluation of the benefits of fine-grained value-based scheduling on general purpose clusters
Future Generation Computer Systems
An evaluation of the benefits of fine-grained value-based scheduling on general purpose clusters
Future Generation Computer Systems
Performance analysis of preemption-aware scheduling in multi-cluster grid environments
ICA3PP'11 Proceedings of the 11th international conference on Algorithms and architectures for parallel processing - Volume Part I
QoS and preemption aware scheduling in federated and virtualized Grid computing environments
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
In distributed computer networks where resources are under decentralized control, selfish users will generally not work towards one common goal, such as maximizing the overall value provided by the system, but will instead try to strategically maximize their individual benefit. This shifts the scheduling policy in such systems --- the decision about which user may access what resource --- from being a purely algorithmic challenge to the domain of mechanism design.In this paper we will showcase the benefit of allowing preemptionin such economic online settings regarding the performance of market mechanisms by extending the Decentralized Local Greedy Mechanism of Heydenreich et al. [11]. This mechanism was shown to be 3.281-competitive with respect to total weighted completion time if the players act rationally. We show that the preemptive versionof this mechanism is 2-competitive. As a by-product, preemption allows to relax the assumptions on jobs upon which this competitiveness relies. In addition to this worst case analysis, we provide an in-depth empirical analysis of the average case performanceof the original mechanism and its preemptive extension based on real workload traces. Our empirical findings indicate that introducing preemption improves both the utility and the slowdown of the jobs. Furthermore, this improvement does not come at the expense of low-priority jobs.