Priority Operators for Fairshare Scheduling

Collaborative resource sharing in distributed computing requires scalable mechanisms for allocation and control of user quotas. Decentralized fairshare prioritization is a technique for enforcement of user quotas that can be realized without centralized control. The technique is based on influencing the job scheduling order of local resource management systems using an algorithm that establishes a semantic for prioritization of jobs based on the individual distances between user’s quota allocations and user’s historical resource usage (i.e. intended and current system state). This work addresses the design and evaluation of priority operators, mathematical functions to quantify fairshare distances, and identify a set of desirable characteristics for fairshare priority operators. In addition, this work also proposes a set of operators for fairshare prioritization, establishes a methodology for verification and evaluation of operator characteristics, and evaluates the proposed operator set based on this mathematical framework. Limitations in the numerical representation of scheduling factor values are identified as a key challenge in priority operator formulation, and it is demonstrated that the contributed priority operators (the Sigmoid operator family) behave robustly even in the presence of severe resolution limitations.

[1]  Erik Elmroth,et al.  Design and evaluation of a decentralized system for grid-wide fairshare scheduling , 2005, First International Conference on e-Science and Grid Computing (e-Science'05).

[2]  Andy B. Yoo,et al.  Approved for Public Release; Further Dissemination Unlimited X-ray Pulse Compression Using Strained Crystals X-ray Pulse Compression Using Strained Crystals , 2002 .

[3]  Ami Marowka,et al.  The GRID: Blueprint for a New Computing Infrastructure , 2000, Parallel Distributed Comput. Pract..

[4]  Erik Elmroth,et al.  Integration and Evaluation of Decentralized Fairshare Prioritization (Aequus) , 2014, 2014 IEEE International Parallel & Distributed Processing Symposium Workshops.

[5]  Ian Foster,et al.  The Grid 2 - Blueprint for a New Computing Infrastructure, Second Edition , 1998, The Grid 2, 2nd Edition.

[6]  Lui Sha,et al.  Performance of real-time bus scheduling algorithms , 1986, SIGMETRICS '86/PERFORMANCE '86.

[7]  John P. Lehoczky,et al.  The rate monotonic scheduling algorithm: exact characterization and average case behavior , 1989, [1989] Proceedings. Real-Time Systems Symposium.

[8]  Mark J. Clement,et al.  Core Algorithms of the Maui Scheduler , 2001, JSSPP.

[9]  John P. Lehoczky,et al.  Task Scheduling In Distributed Real-Time Systems , 1987, Other Conferences.

[10]  Erik Elmroth,et al.  Decentralized Prioritization-Based Management Systems for Distributed Computing , 2013, 2013 IEEE 9th International Conference on e-Science.

[11]  Gonzalo P. Rodrigo.  Establishing the equivalence between operators : theorem to establish a sufficient condition for two operators to produce the same ordering in a Faishare prioritization system , 2014 .

[12]  Ian T. Foster,et al.  The Anatomy of the Grid: Enabling Scalable Virtual Organizations , 2001, Int. J. High Perform. Comput. Appl..

[13]  Erik Elmroth,et al.  Decentralized scalable fairshare scheduling , 2013, Future Gener. Comput. Syst..

[14]  Rajesh Raman,et al.  Matchmaking: distributed resource management for high throughput computing , 1998, Proceedings. The Seventh International Symposium on High Performance Distributed Computing (Cat. No.98TB100244).

[15]  Gonzalo P. Rodrigo.  Proof of compliance for the relative operator on the proportional distribution of unused share in an ordering fairshare system , 2014 .

[16]  Judy Kay,et al.  A fair share scheduler , 1988, CACM.