Start-time fair queueing: a scheduling algorithm for integrated services packet switching networks
Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
A game theoretic framework for bandwidth allocation and pricing in broadband networks
IEEE/ACM Transactions on Networking (TON)
Core Algorithms of the Maui Scheduler
JSSPP '01 Revised Papers from the 7th International Workshop on Job Scheduling Strategies for Parallel Processing
A Game-Theoretic Model and Algorithm for Load Balancing in Distributed Systems
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
A Truthful Mechanism for Fair Load Balancing in Distributed Systems
NCA '03 Proceedings of the Second IEEE International Symposium on Network Computing and Applications
Fair scheduling with tunable latency: a round-robin approach
IEEE/ACM Transactions on Networking (TON)
Grid resource commercialization: economic engineering and delivery scenarios
Grid resource management
Multi-dimensional storage virtualization
Proceedings of the joint international conference on Measurement and modeling of computer systems
Interposed proportional sharing for a storage service utility
Proceedings of the joint international conference on Measurement and modeling of computer systems
A Survey of Peer-to-Peer Storage Techniques for Distributed File Systems
ITCC '05 Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II - Volume 02
The price of anarchy of finite congestion games
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Cost sharing in a job scheduling problem using the Shapley value
Proceedings of the 6th ACM conference on Electronic commerce
An interposed 2-Level I/O scheduling framework for performance virtualization
SIGMETRICS '05 Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Triage: Performance differentiation for storage systems using adaptive control
ACM Transactions on Storage (TOS)
Journal of Parallel and Distributed Computing - Special issue: Design and performance of networks for super-, cluster-, and grid-computing: Part II
Fair Game-Theoretic Resource Management in Dedicated Grids
CCGRID '07 Proceedings of the Seventh IEEE International Symposium on Cluster Computing and the Grid
IEEE Transactions on Parallel and Distributed Systems
Divisible Load Scheduling: An Approach Using Coalitional Games
ISPDC '07 Proceedings of the Sixth International Symposium on Parallel and Distributed Computing
On the User-Scheduler Dialogue: Studies of User-Provided Runtime Estimates and Utility Functions
International Journal of High Performance Computing Applications
Towards distributed storage resource management using flow control
ACM SIGOPS Operating Systems Review
What does control theory bring to systems research?
ACM SIGOPS Operating Systems Review
The Price of Malice in Linear Congestion Games
WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
Disk Scheduling with Quality of Service Guarantees
ICMCS '99 Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02
On Scheduling Fees to Prevent Merging, Splitting, and Transferring of Jobs
Mathematics of Operations Research
Price-based user-optimal job allocation scheme for grid systems
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Design space analysis for modeling incentives in distributed systems
Proceedings of the ACM SIGCOMM 2011 conference
Approximation Algorithms for the Multiorganization Scheduling Problem
IEEE Transactions on Parallel and Distributed Systems
A merge-and-split mechanism for dynamic virtual organization formation in grids
PCCC '11 Proceedings of the 30th IEEE International Performance Computing and Communications Conference
Network Delay-Aware Load Balancing in Selfish and Cooperative Distributed Systems
IPDPSW '13 Proceedings of the 2013 IEEE 27th International Symposium on Parallel and Distributed Processing Workshops and PhD Forum
Hi-index | 0.00 |
We consider a multi-organizational system in which each organization contributes processors to the global pool but also jobs to be processed on the common resources. The fairness of the scheduling algorithm is essential for the stability and even for the existence of such systems (as organizations may refuse to join an unfair system). We consider on-line, non-clairvoyant scheduling of sequential jobs. The started jobs cannot be stopped, canceled, preempted, or moved to other processors. We consider identical processors, but most of our results can be extended to related or unrelated processors. We model the fair scheduling problem as a cooperative game and we use the Shapley value to determine the ideal fair schedule. In contrast to the current literature, we do not use money to assess the relative utilities of jobs. Instead, to calculate the contribution of an organization, we determine how the presence of this organization influences the performance of other organizations. Our approach can be used with arbitrary utility function (e.g., flow time, tardiness, resource utilization), but we argue that the utility function should be strategy resilient. The organizations should be discouraged from splitting, merging or delaying their jobs. We present the unique (to within a multiplicative and additive constants) strategy resilient utility function. We show that the problem of fair scheduling is NP-hard and hard to approximate. However, for unit-size jobs, we present a fully polynomial-time randomized approximation scheme (FPRAS). We also show that the problem parametrized with the number of organizations is fixed parameter tractable (FPT). In cooperative game theory, the Shapley value is considered in many contexts as "the" fair solution. Our results show that, although the problem for the large number of organizations is computationally hard, this solution concept can be used in scheduling (for instance, as a benchmark for measuring fairness of heuristic algorithms).