Skip to main content
SpringerLink
Log in

Fair Share Is Not Enough: Measuring Fairness in Scheduling with Cooperative Game Theory

  • Conference paper
  • First Online:
Parallel Processing and Applied Mathematics (PPAM 2013)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8385))

Abstract

We consider the problem of fair scheduling in a multi-organizational system in which organizations contribute their own resources to the global pool and the jobs to be processed on the common resources. We consider on-line, non-clairvoyant scheduling of sequential jobs without preemption. To ensure that the organizations are willing to cooperate the scheduling algorithm must be fair.

To characterize fairness, we use a cooperative game theory approach. The contribution of an organization is computed based on how this organization influences the utility (which can be any metric, e.g., flow time, turnaround, resource allocation) of all organizations. Formally, the contribution of the organization is its Shapley value in the cooperative game. The scheduling algorithm should ensure that the contributions of the organizations are close to their utilities. Our previous work proves that this problem is NP-hard and hard to approximate.

In this paper we propose a heuristic scheduling algorithm for the fair scheduling problem. We experimentally evaluate the heuristic and compare its fairness to fair share, round robin and the exact exponential algorithm. Our results show that fairness of the heuristic algorithm is close to the optimal. The difference between our heuristic and the fair share algorithm is more visible on longer traces with more organizations. These results show that assigning static target shares (as in the fair share algorithm) is not fair in multi-organizational systems and that instead dynamic measures of organizations’ contributions should be used.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    http://www.cs.huji.ac.il/labs/parallel/workload/l_lpc/index.html

  2. 2.

    http://www.cs.huji.ac.il/labs/parallel/workload/l_pik_iplex/index.html

  3. 3.

    http://www.cs.huji.ac.il/labs/parallel/workload/l_ricc/index.html

  4. 4.

    http://www.cs.huji.ac.il/labs/parallel/workload/l_sharcnet/index.html

References

  1. Carroll, T.E., Grosu, D.: Divisible load scheduling: an approach using coalitional games. In: Proceedings of the ISPDC (2007)

    Google Scholar 

  2. Chaskar, H.M., Madhow, U.: Fair scheduling with tunable latency: a round-robin approach. IEEE/ACM Trans. Netw. 11(4), 592–601 (2003)

    Article  Google Scholar 

  3. Cohen, J., Cordeiro, D., Trystram, D., Wagner, F.: Multi-organization scheduling approximation algorithms. Concurr. Comput. Pract. Exp. 23(17), 2220–2234 (2011)

    Article  Google Scholar 

  4. Dutot, P.-F., Pascual, F., Rzadca, K., Trystram, D.: Approximation algorithms for the multi-organization scheduling problem. IEEE Trans. Parallel Distrib. Syst. 22, 1888–1895 (2011)

    Article  Google Scholar 

  5. Feitelson, D.G.: Parallel workloads archive. http://www.cs.huji.ac.il/labs/parallel/workload/

  6. Goyal, P., Vin, H.M., Chen, H.: Start-time fair queueing: a scheduling algorithm for integrated services packet switching networks. In: Proceedings of the SIGCOMM, pp. 157–168 (1996)

    Google Scholar 

  7. Gulati, A., Ahmad, I.: Towards distributed storage resource management using flow control. SIGOPS Oper. Syst. Rev. 42(6), 10–16 (2008)

    Article  Google Scholar 

  8. Gulati, A., Ahmad, I., Waldspurger, C.A.: PARDA: proportional allocation of resources for distributed storage access. In: FAST Proceedings, February 2009

    Google Scholar 

  9. Jin, W., Chase, J.S., Kaur, J.: Interposed proportional sharing for a storage service utility. SIGMETRICS Perform. Eval. Rev. 32(1), 37–48 (2004)

    Article  Google Scholar 

  10. Kay, J., Lauder, P.: A fair share scheduler. Commun. ACM 31(1), 44–55 (1988)

    Article  Google Scholar 

  11. Kostreva, M.M., Ogryczak, W., Wierzbicki, A.: Equitable aggregations and multiple criteria analysis. Eur. J. Oper. Res. 158(2), 362–377 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  12. Mashayekhy, L., Grosu, D.: A merge-and-split mechanism for dynamic virtual organization formation in grids. In: PCCC Proceedings, pp. 1–8 (2011)

    Google Scholar 

  13. Mishra, D., Rangarajan, B.: Cost sharing in a job scheduling problem using the Shapley value. In: Proceedings of the EC, pp. 232–239 (2005)

    Google Scholar 

  14. Moulin, H.: On scheduling fees to prevent merging, splitting, and transferring of jobs. Math. Oper. Res. 32(2), 266–283 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  15. Osborne, M.J., Rubinstein, A.: A Course in Game Theory, vol. 1. MIT Press, Cambridge (1994)

    MATH  Google Scholar 

  16. Rzadca, K., Trystram, D., Wierzbicki, A.: Fair game-theoretic resource management in dedicated grids. In: CCGRID Proceedings (2007)

    Google Scholar 

  17. Skowron, P., Rzadca, K.: Non-monetary fair scheduling – cooperative game theory approach. In: SPAA (see also the extended arxiv version) (2013)

    Google Scholar 

  18. Wang, Y., Merchant, A.: Proportional-share scheduling for distributed storage systems. In: FAST Proceedings, pp. 4–4 (2007)

    Google Scholar 

Download references

Acknowledgements

This work is partly supported by Polish National Science Center Sonata grant UMO-2012/07/D/ST6/02440

Author information

Authors and Affiliations

  1. Faculty of Mathematics, Informatics and Mechanics, University of Warsaw, Warsaw, Poland

    Piotr Skowron & Krzysztof Rzadca

Authors
  1. Piotr Skowron
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Krzysztof Rzadca
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Piotr Skowron .

Editor information

Editors and Affiliations

  1. Institute of Computer and Information Science, Czestochowa University of Technology, Czestochowa, Poland

    Roman Wyrzykowski

  2. University of Tennessee, Department of Computer Science, Knoxville, Tennessee, USA

    Jack Dongarra

  3. Institute of Computer and Information Science, Czestochowa University of Technology, Czestochowa, Poland

    Konrad Karczewski

  4. Technical University of Denmark Informatics and Mathematical Modelling, Kongens Lyngby, Denmark

    Jerzy Waśniewski

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Skowron, P., Rzadca, K. (2014). Fair Share Is Not Enough: Measuring Fairness in Scheduling with Cooperative Game Theory. In: Wyrzykowski, R., Dongarra, J., Karczewski, K., Waśniewski, J. (eds) Parallel Processing and Applied Mathematics. PPAM 2013. Lecture Notes in Computer Science(), vol 8385. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-55195-6_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-55195-6_4

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-55194-9

  • Online ISBN: 978-3-642-55195-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation