Change search
ReferencesLink to record
Permanent link

Direct link
Priority Operators for Fairshare Scheduling
Umeå University, Faculty of Science and Technology, Department of Computing Science.
Umeå University, Faculty of Science and Technology, Department of Computing Science.
Umeå University, Faculty of Science and Technology, Department of Computing Science.
2015 (English)In: JOB SCHEDULING STRATEGIES FOR PARALLEL PROCESSING (JSSPP 2014), 2015, 70-89 p.Conference paper (Refereed)
Abstract [en]

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.

Place, publisher, year, edition, pages
2015. 70-89 p.
, Lecture Notes in Computer Science, ISSN 0302-9743 ; 8828
National Category
Computer Science
URN: urn:nbn:se:umu:diva-106517DOI: 10.1007/978-3-319-15789-4_5ISI: 000355729800005ISBN: 978-3-319-15788-7ISBN: 978-3-319-15789-4OAI: diva2:841913
18th International Workshop on Job Scheduling Strategies for Parallel Processing (JSSPP), MAY 23, 2014, Phoenix, AZ
Available from: 2015-07-15 Created: 2015-07-14 Last updated: 2015-07-15Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full text

Search in DiVA

By author/editor
Rodrigo, Gonzalo P.Östberg, Per-OlovElmroth, Erik
By organisation
Department of Computing Science
Computer Science

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 64 hits
ReferencesLink to record
Permanent link

Direct link