research-article

REF: resource elasticity fairness with sharing incentives for multiprocessors

Authors:

Seyed Majid Zahedi,

Benjamin C. LeeAuthors Info & Claims

ASPLOS '14: Proceedings of the 19th international conference on Architectural support for programming languages and operating systems

Pages 145 - 160

https://doi.org/10.1145/2541940.2541962

Published: 24 February 2014 Publication History

Abstract

With the democratization of cloud and datacenter computing, users increasingly share large hardware platforms. In this setting, architects encounter two challenges: sharing fairly and sharing multiple resources. Drawing on economic game-theory, we rethink fairness in computer architecture. A fair allocation must provide sharing incentives (SI), envy-freeness (EF), and Pareto efficiency (PE).

We show that Cobb-Douglas utility functions are well suited to modeling user preferences for cache capacity and memory bandwidth. And we present an allocation mechanism that uses Cobb-Douglas preferences to determine each user's fair share of the hardware. This mechanism provably guarantees SI, EF, and PE, as well as strategy-proofness in the large (SPL). And it does so with modest performance penalties, less than 10\% throughput loss, relative to an unfair mechanism.

References

[1]

Luiz André Barroso and Urs Hölzle. The datacenter as a computer: An introduction to the design of warehouse-scale machines. Synthesis Lectures on Computer Architecture, 4(1):1--108, 2009.

[2]

Christian Bienia. Benchmarking Modern Multiprocessors. PhD thesis, Princeton University, January 2011.

Digital Library

[3]

Christian Bienia, Sanjeev Kumar, Jaswinder Pal Singh, and Kai Li. The parsec benchmark suite: Characterization and architectural implications. In Proc. International Conference on Parallel Architectures and Compilation Techniques (PACT), pages 72--81, 2008.

Digital Library

[4]

Ramazan Bitirgen, Engin Ipek, and Jose F Martinez. Coordinated management of multiple interacting resources in chip multiprocessors: A machine learning approach. In Proc. International Symposium on Microarchitecture (MICRO), 2008.

Digital Library

[5]

Stephen Boyd, Seung-Jean Kim, Lieven Vandenberghe, and Arash Hassibi. A tutorial on geometric programming. Optimization and Engineering, 8(1):67--127, 2007.

[6]

Jeffrey S Chase, Darrell C Anderson, Prachi N Thakar, Amin M Vahdat, and Ronald P Doyle. Managing energy and server resources in hosting centers. In Proc. Symposium on Operating System Principles (SOSP), 2001.

Digital Library

[7]

Reetuparna Das, Onur Mutlu, Thomas Moscibroda, and Chita R Das. Application-aware prioritization mechanisms for on-chip networks. In Proc. International Symposium on Microarchitecture (MICRO), pages 280--291. IEEE, 2009.

Digital Library

[8]

Alan Demers, Srinivasan Keshav, and Scott Shenker. Analysis and simulation of a fair queueing algorithm. In ACM SIGCOMM Computer Communication Review, volume 19, pages 1--12. ACM, 1989.

Digital Library

[9]

Danny Dolev, Dror G Feitelson, Joseph Y Halpern, Raz Kupferman, and Nathan Linial. No justified complaints: On fair sharing of multiple resources. In Proc. Innovations in Theoretical Computer Science Conference, pages 68--75. ACM, 2012.

Digital Library

[10]

Eiman Ebrahimi, Chang Joo Lee, Onur Mutlu, and Yale N Patt. Fairness via source throttling: a configurable and high-performance fairness substrate for multi-core memory systems. In Proc. International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS), pages 335--346. ACM, 2010.

Digital Library

[11]

Francis Ysidro Edgeworth. Mathematical psychics: An essay on the application of mathematics to the moral sciences. Number 10. C. Kegan Paul & Company, 1881.

[12]

Stijn Eyerman and Lieven Eeckhout. System-level performance metrics for multiprogram workloads. Micro, IEEE, 28(3):42--53, 2008.

Digital Library

[13]

Ron Gabor, Shlomo Weiss, and Avi Mendelson. Fairness and throughput in switch on event multithreading. In Proc. International Symposium on Microarchitecture (MICRO), pages 149--160. IEEE, 2006.

Digital Library

[14]

Ron Gabor, Shlomo Weiss, and Avi Mendelson. Fairness enforcement in switch on event multithreading. ACM Transactions on Architecture and Code Optimization (TACO), 4(3):15, 2007.

Digital Library

[15]

Ali Ghodsi, Matei Zaharia, Benjamin Hindman, Andy Konwinski, Scott Shenker, and Ion Stoica. Dominant resource fairness: fair allocation of multiple resource types. In Proc. USENIX NSDI, 2011.

Digital Library

[16]

Michael Grant and Stephen Boyd. Cvx: Matlab software for disciplined convex programming, version 1.21, 2010.

[17]

Marisabel Guevara, Benjamin Lubin, and Benjamin C Lee. Navigating heterogeneous processors with market mechanisms. In Proc. International Symposium on High Performance Computer Architecture (HPCA), pages 95--106, 2013.

Digital Library

[18]

Avital Gutman and Noam Nisan. Fair allocation without trade. In Proc. International Conference on Autonomous Agents and Multiagent Systems (AAMAS), pages 719--728, 2012.

Digital Library

[19]

Kazuhiko Hashimoto. Strategy-proofness versus efficiency on the cobb-douglas domain of exchange economies. Social choice and welfare, 31(3):457--473, 2008.

[20]

Mark D Hill and Michael R Marty. Amdahl's law in the multicore era. Computer, 41(7):33--38, 2008.

Digital Library

[21]

Carlee Joe-Wong, Soumya Sen, Tian Lan, and Mung Chiang. Multi-resource allocation: Fairness-efficiency tradeoffs in a unifying framework. In Proc. INFOCOM, pages 1206--1214. IEEE, 2012.

[22]

Yoongu Kim, Dongsu Han, Onur Mutlu, and Mor Harchol-Balter. Atlas: A scalable and high-performance scheduling algorithm for multiple memory controllers. In Proc. International Symposium on High Performance Computer Architecture (HPCA), pages 1--12. IEEE, 2010.

[23]

Benjamin Lee and David Brooks. Accurate and efficient regression modeling for microarchitectural performance and power prediction. In Proc. International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS), 2006.

Digital Library

[24]

Benjamin Lubin, Jeffrey O Kephart, Rajarshi Das, and David C Parkes. Expressive power-based resource allocation for data centers. In Proc. International Joint Conferences on Artificial Intelligence (IJCAI), pages 1451--1456, 2009.

Digital Library

[25]

Jason Mars, Lingjia Tang, Robert Hundt, Kevin Skadron, and Mary Lou Soffa. Bubble-up: Increasing utilization in modern warehouse scale computers via sensible co-locations. In Proc. International Symposium on Microarchitecture (MICRO), pages 248--259. ACM, 2011.

Digital Library

[26]

Hervé Moulin. Fair division and collective welfare. MIT press, 2004.

[27]

Abhinay Muthoo. Bargaining theory with applications. Cambridge University Press, 1999.

Digital Library

[28]

Onur Mutlu and Thomas Moscibroda. Stall-time fair memory access scheduling for chip multiprocessors. In Proc. International Symposium on Microarchitecture (MICRO), pages 146--160. IEEE Computer Society, 2007.

Digital Library

[29]

Onur Mutlu and Thomas Moscibroda. Parallelism-aware batch scheduling: Enhancing both performance and fairness of shared dram systems. In Proc. International Symposium on Computer Architecture (ISCA), pages 63--74. IEEE Computer Society, 2008.

Digital Library

[30]

John F Nash Jr. The bargaining problem. Econometrica: Journal of the Econometric Society, pages 155--162, 1950.

[31]

Kyle J Nesbit, Nidhi Aggarwal, James Laudon, and James E Smith. Fair queuing memory systems. In Proc. International Symposium on Microarchitecture (MICRO), pages 208--222. IEEE, 2006.

Digital Library

[32]

David C Parkes, Ariel D Procaccia, and Nisarg Shah. Beyond dominant resource fairness: extensions, limitations, and indivisibilities. In Proc. Conference on Electronic Commerce (EC), pages 808--825. ACM, 2012.

Digital Library

[33]

Avadh Patel, Furat Afram, Shunfei Chen, and Kanad Ghose. MARSSx86: A Full System Simulator for x86 CPUs. In Design Automation Conference 2011 (DAC'11), 2011.

Digital Library

[34]

Colby Ranger, Ramanan Raghuraman, Arun Penmetsa, Gary Bradski, and Christos Kozyrakis. Evaluating MapReduce for multi-core and multiprocessor systems. In Proc. International Symposium on High Performance Computer Architecture (HPCA), pages 13--24. IEEE, 2007.

Digital Library

[35]

Paul Rosenfeld, Elliott Cooper-Balis, and Bruce Jacob. Dramsim2: A cycle accurate memory system simulator. Computer Architecture Letters, 10(1):16--19, 2011.

Digital Library

[36]

Alejandro Toriello and Juan Pablo Vielma. Fitting piecewise linear continuous functions. European Journal of Operational Research, 219(1):86--95, 2012.

[37]

Hal Varian. Equity, envy, and efficiency. Journal of economic theory, 9(1):63--91, 1974.

[38]

Carl A Waldspurger and William E Weihl. Lottery scheduling: Flexible proportional-share resource management. In Proc. USENIX Conference on Operating Systems Design and Implementation (OSDI), page 1. USENIX Association, 1994.

Digital Library

Cited By

Gupta NNarayanan IHanda SChakraborti SThapar PShan BRao ALiu YWang PWu YGao QCheng CYou SHuang LFan JYu KLin KMu TMalani PWang HLu TZhang P(2024)Dynamic Idle Resource Leasing To Safely Oversubscribe Capacity At MetaProceedings of the 2024 ACM Symposium on Cloud Computing10.1145/3698038.3698537(792-810)Online publication date: 20-Nov-2024
https://dl.acm.org/doi/10.1145/3698038.3698537
Tang SYu CLi Y(2022)Fairness-Efficiency Scheduling for Cloud Computing With Soft Fairness GuaranteesIEEE Transactions on Cloud Computing10.1109/TCC.2020.302108410:3(1806-1818)Online publication date: 1-Jul-2022
https://doi.org/10.1109/TCC.2020.3021084
Wang NZhou RHan LChen HLi Z(2022)Online Scheduling of Distributed Machine Learning Jobs for Incentivizing Sharing in Multi-Tenant SystemsIEEE Transactions on Computers10.1109/TC.2022.3174566(1-1)Online publication date: 2022
https://doi.org/10.1109/TC.2022.3174566
Show More Cited By

Index Terms

REF: resource elasticity fairness with sharing incentives for multiprocessors
1. Computer systems organization
  1. Architectures
    1. Parallel architectures
      1. Multiple instruction, multiple data
2. Hardware
  1. Integrated circuits
    1. Semiconductor memory

Recommendations

REF: resource elasticity fairness with sharing incentives for multiprocessors
ASPLOS '14

With the democratization of cloud and datacenter computing, users increasingly share large hardware platforms. In this setting, architects encounter two challenges: sharing fairly and sharing multiple resources. Drawing on economic game-theory, we ...
REF: resource elasticity fairness with sharing incentives for multiprocessors
ASPLOS '14

With the democratization of cloud and datacenter computing, users increasingly share large hardware platforms. In this setting, architects encounter two challenges: sharing fairly and sharing multiple resources. Drawing on economic game-theory, we ...
Interplay between Buy-It-Now price and last minute bidding on online bidding strategies

Sellers and buyers on online auction sites like eBay have the option of setting and executing auction parameters such as auction length, Buy-It-Now price, starting price, reserve price, etc. Understanding why bidders choose to execute the Buy-It-Now ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

ASPLOS '14: Proceedings of the 19th international conference on Architectural support for programming languages and operating systems

February 2014

780 pages

ISBN:9781450323055

DOI:10.1145/2541940

General Chairs:
Rajeev Balasubramonian
University of Utah
,
Al Davis
University of Utah
,
Program Chair:
Sarita Adve
University of Illinois at Urbana-Champ

ACM SIGARCH Computer Architecture News Volume 42, Issue 1
ASPLOS '14
March 2014
729 pages
ISSN:0163-5964
DOI:10.1145/2654822
Editor:
Doug DeGroot
acm dot org
Issue’s Table of Contents
ACM SIGPLAN Notices Volume 49, Issue 4
ASPLOS '14
April 2014
729 pages
ISSN:0362-1340
EISSN:1558-1160
DOI:10.1145/2644865
Editors:
Mark W. Bailey
Hamilton College, Clinton, NY
,
Rajeev Balasubramonian
University of Utah
,
Al Davis
University of Utah
,
Sarita Adve
University of Illinois at Urbana-Champ
Issue’s Table of Contents

Copyright © 2014 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

In-Cooperation

SIGBED: ACM Special Interest Group on Embedded Systems

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 24 February 2014

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

ASPLOS '14

Sponsor:

ASPLOS '14: Architectural Support for Programming Languages and Operating Systems

March 1 - 5, 2014

Utah, Salt Lake City, USA

Acceptance Rates

ASPLOS '14 Paper Acceptance Rate 49 of 217 submissions, 23%;

Overall Acceptance Rate 535 of 2,713 submissions, 20%

Upcoming Conference

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

89
Total Citations
View Citations
673
Total Downloads

Downloads (Last 12 months)18
Downloads (Last 6 weeks)2

Reflects downloads up to 03 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

Gupta NNarayanan IHanda SChakraborti SThapar PShan BRao ALiu YWang PWu YGao QCheng CYou SHuang LFan JYu KLin KMu TMalani PWang HLu TZhang P(2024)Dynamic Idle Resource Leasing To Safely Oversubscribe Capacity At MetaProceedings of the 2024 ACM Symposium on Cloud Computing10.1145/3698038.3698537(792-810)Online publication date: 20-Nov-2024
https://dl.acm.org/doi/10.1145/3698038.3698537
Tang SYu CLi Y(2022)Fairness-Efficiency Scheduling for Cloud Computing With Soft Fairness GuaranteesIEEE Transactions on Cloud Computing10.1109/TCC.2020.302108410:3(1806-1818)Online publication date: 1-Jul-2022
https://doi.org/10.1109/TCC.2020.3021084
Wang NZhou RHan LChen HLi Z(2022)Online Scheduling of Distributed Machine Learning Jobs for Incentivizing Sharing in Multi-Tenant SystemsIEEE Transactions on Computers10.1109/TC.2022.3174566(1-1)Online publication date: 2022
https://doi.org/10.1109/TC.2022.3174566
Islam MMahmud HRen SWang X(2020)A Carbon-Aware Incentive Mechanism for Greening Colocation Data CentersIEEE Transactions on Cloud Computing10.1109/TCC.2017.27670438:1(4-16)Online publication date: 1-Jan-2020
https://doi.org/10.1109/TCC.2017.2767043
Narayanan ISivasubramaniam A(2020)Mediating Power Struggles on a Shared Server2020 IEEE International Symposium on Performance Analysis of Systems and Software (ISPASS)10.1109/ISPASS48437.2020.00030(149-159)Online publication date: Aug-2020
https://doi.org/10.1109/ISPASS48437.2020.00030
Kulkarni NQi FDelimitrou C(2019)Pliant: Leveraging Approximation to Improve Datacenter Resource Efficiency2019 IEEE International Symposium on High Performance Computer Architecture (HPCA)10.1109/HPCA.2019.00035(159-171)Online publication date: Feb-2019
https://doi.org/10.1109/HPCA.2019.00035
Freeman RZahedi SConitzer VLee B(2018)Dynamic Proportional SharingACM SIGMETRICS Performance Evaluation Review10.1145/3292040.321963146:1(33-35)Online publication date: 12-Jun-2018
https://dl.acm.org/doi/10.1145/3292040.3219631
Freeman RZahedi SConitzer VLee BPsounis KAkella AWierman A(2018)Dynamic Proportional SharingAbstracts of the 2018 ACM International Conference on Measurement and Modeling of Computer Systems10.1145/3219617.3219631(33-35)Online publication date: 12-Jun-2018
https://dl.acm.org/doi/10.1145/3219617.3219631
Zahedi SFan SLee B(2018)Managing Heterogeneous Datacenters with TokensACM Transactions on Architecture and Code Optimization10.1145/319182115:2(1-23)Online publication date: 23-May-2018
https://dl.acm.org/doi/10.1145/3191821
Freeman RZahedi SConitzer VLee B(2018)Dynamic Proportional SharingProceedings of the ACM on Measurement and Analysis of Computing Systems10.1145/31794062:1(1-36)Online publication date: 3-Apr-2018
https://dl.acm.org/doi/10.1145/3179406
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten