research-article

Public Access

ReBudget: Trading Off Efficiency vs. Fairness in Market-Based Multicore Resource Allocation via Runtime Budget Reassignment

Authors:

José F. MartínezAuthors Info & Claims

ACM SIGARCH Computer Architecture News, Volume 44, Issue 2

Pages 19 - 32

https://doi.org/10.1145/2980024.2872382

Published: 25 March 2016 Publication History

Abstract

Efficiently allocating shared resources in computer systems is critical to optimizing execution. Recently, a number of market-based solutions have been proposed to attack this problem. Some of them provide provable theoretical bounds to efficiency and/or fairness losses under market equilibrium. However, they are limited to markets with potentially important constraints, such as enforcing equal budget for all players, or curve-fitting players' utility into a specific function type. Moreover, they do not generally provide an intuitive "knob" to control efficiency vs. fairness. In this paper, we introduce two new metrics, Market Utility Range (MUR) and Market Budget Range (MBR), through which we provide for the first time theoretical bounds on efficiency and fairness of market equilibria under arbitrary budget assignments. We leverage this result and propose ReBudget, an iterative budget re-assignment algorithm that can be used to control efficiency vs. fairness at run-time. We apply our algorithm to a multi-resource allocation problem in multicore chips. Our evaluation using detailed execution-driven simulations shows that our budget re-assignment technique is intuitive, effective, and efficient.

References

[1]

M. Becchi and P. Crowley. Dynamic thread assignment on heterogeneous multiprocessor architectures. In Intl. Conf. on Computing Frontiers (FC), 2006.

Digital Library

[2]

N. Beckmann and D. Sanchez. Talus: A simple way to remove cliffs in cache performance. In Intl. Symp. on High Performance Computer Architecture (HPCA), 2015.

[3]

A. Bhattacharjee and M. Martonosi. Thread criticality predictors for dynamic performance, power, and resource management in chip multiprocessors. In Intl. Symp. on Computer Architecture (ISCA), 2009.

Digital Library

[4]

R. Bitirgen, E. Ipek, and J. F. Martínez. Coordinated management of multiple interacting resources in chip multiprocessors: A machine learning approach. In Intl. Symp. on Microarchitecture (MICRO), 2008.

Digital Library

[5]

S. J. Brams and A. D. Taylor. Fair Division: From cake-cutting to dispute resolution. Cambridge University Press, 1996.

[6]

J. Brock, C. Ye, C. Ding, Y. Li, X. Wang, and Y. Luo. Optimal cache partition-sharing. In Intl. Conf. on Parallel Processing (ICPP), 2015.

Digital Library

[7]

D. Brooks, V. Tiwari, and M. Martonosi. Wattch: a framework for architectural-level power analysis and optimizations. In Intl. Symp. on Computer Architecture (ISCA), 2000.

Digital Library

[8]

B. Calder, T. Sherwood, E. Perelman, and G. Hamerley. Simpoint. http://www.cs.ucsd.edu/ calder/simpoint/, 2003.

[9]

A. B. Canturk Isci, C.-Y. Cher, P. Bose, and M. Martonosi. An analysis of efficient multi-core global power management policies: Maximizing performance for a given power budget. In Intl. Symp. on Microarchitecture (MICRO), 2006.

[10]

P. Chaparro, J. González, and A. González. Thermal-effective clustered microarchitectures. In Workshop on Temperature-Aware Computer Systems, 2004.

[11]

J. S. Chase, D. C. Anderson, P. N. Thakar, A. M. Vahdat, and R. P. Doyle. Managing energy and server resources in hosting centers. In ACM Symp. on Operating Systems Principles (SOSP), 2001.

Digital Library

[12]

J. Chen and L. K. John. Predictive coordination of multiple on-chip resources for chip multiprocessors. In Intl. Conf. on Supercomputing (ICS), 2011.

Digital Library

[13]

J. Chen, L. K. John, and D. Kaseridis. Modeling program resource demand using inherent program characteristics. In Intl. Conf. on Measurement and Modeling of Computer Systems (Sigmetrics), 2011.

Digital Library

[14]

J. Chen, A. Nair, and L. John. Predictive heterogeneity-aware application scheduling for chip multiprocessors. IEEE Trans. on Computers, 63, 2012.

[15]

S. Choi and D. Yeung. Learning-based SMT processor resource distribution via hill-climbing. In Intl. Symp. on Computer Architecture (ISCA), 2006.

Digital Library

[16]

E. Ebrahimi, R. Miftakhutdinov, C. Fallin, C. J. Lee, J. A. Joao, O. Mutlu, and Y. N. Patt. Parallel application memory scheduling. In Intl. Symp. on Microarchitecture (MICRO), 2011.

Digital Library

[17]

M. Feldman, K. Lai, and L. Zhang. A price-anticipating resource allocation mechanism for distributed shared clusters. In Intl. Conf. on Electronic Commerce (EC), 2005.

Digital Library

[18]

G. Hardin. The tragedy of the commons. Science, 162 (3859): 1243--1248, 1968.

[19]

M. T. Inc. 2Gb DDR3 SDRAM component data sheet: MT41J256M8. http://www.micron.com/parts/dram/ddr3-sdram/mt41j256m8da-125, July 2012.

[20]

Intel Corporation. Intel 64 and IA-32 Architectures Software Developer's Manuals. http://www.intel.com/content/www/us/en/processors/architectures-software-developer-manuals.html, 2014.

[21]

R. Johari and J. N. Tsitsiklis. Efficiency loss in a network resource allocation game. Mathematics of Operations Research, 29 (3): 407--435, 2004.

Digital Library

[22]

R. Kumar, K. I. Farkas, N. P. Jouppi, P. Ranganathan, and D. M. Tullsen. Single-isa heterogeneous multi-core architectures: The potential for processor power reduction. In Intl. Symp. on Microarchitecture (MICRO), 2003.

[23]

K. Lai, L. Rasmusson, E. Adar, L. Zhang, and B. A. Huberman. Tycoon: An implementation of a distributed, market-based resource allocation system. Multiagent and Grid Systems, 1, 2005.

[24]

R. Miftakhutdinov, E. Ebrahimi, and Y. N. Patt. Predicting performance impact of dvfs for realistic memory systems. In Intl. Symp. on Microarchitecture (MICRO), 2012.

Digital Library

[25]

N. Nisan, T. Roughgarden, E. Tardos, and V. V. Vazirani. Algorithmic game theory. Cambridge University Press, 2007.

Digital Library

[26]

C. Papadimitriou. Algorithms, games, and the Internet. In Intl. Symp. on Theory of computing, 2001.

[27]

M. K. Qureshi and Y. N. Patt. Utility-based cache partitioning: A low-overhead, high-performance, runtime mechanism to partition shared caches. In Intl. Symp. on Microarchitecture (MICRO), 2006.

Digital Library

[28]

J. Renau, B. Fraguela, J. Tuck, W. Liu, M. Prvulovic, L. Ceze, S. Sarangi, P. Sack, K. Strauss, and P. Montesinos. SESC simulator, January 2005. http://sesc.sourceforge.net.

[29]

E. Rotem, A. Naveh, D. Rajwan, A. Ananthakrishnan, and E. Weissmann. Power-management architecture of the intel microarchitecture code-named sandy bridge. IEEE Micro, 32 (2): 0020--27, 2012.

Digital Library

[30]

P. Shivakumar and N. P. Jouppi. CACTI 3.0: an integrated cache timing, power, and area model. Technical report, HP Western Research Labs, 2001.

[31]

K. Skadron, M. R. Stan, K. Sankaranarayanan, W. Huang, S. Velusamy, and D. Tarjan. Temperature-aware microarchitecture: Modeling and implementation. ACM Trans. on Architecture and Code Optimization (TACO), 1 (1): 94--125, 2004.

[32]

Standard Performance Evaluation Corporation. SPEC CPU2000. http://www.spec.org/cpu2000/, 2000.

[33]

Standard Performance Evaluation Corporation. SPEC CPU2006. http://www.spec.org/cpu2006/, 2006.

[34]

G. E. Suh, S. Devadas, and L. Rudolph. A new memory monitoring scheme for memory-aware scheduling and partitioning. In Intl. Symp. on High Performance Computer Architecture (HPCA), 2002.

[35]

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

[36]

R. Wang and L. Chen. Futility scaling: High-associativity cache partitioning. In Intl. Symp. on Microarchitecture (MICRO), 2014.

Digital Library

[37]

X. Wang and J. F. Martínez. XChange: A market-based approach to scalable dynamic multi-resource allocation in multicore architectures. In Intl. Symp. on High Performance Computer Architecture (HPCA), 2015.

[38]

Y. Xie and G. H. Loh. PIPP: promotion/insertion pseudo-partitioning of multi-core shared caches. In Intl. Symp. on Computer Architecture (ISCA), 2009.

Digital Library

[39]

S. M. Zahedi and B. C. Lee. Ref: Resource elasticity fairness with sharing incentives for multiprocessors. In Intl. Conf. on Architectural Support for Programming Languages and Operating Systems (ASPLOS), 2014.

Digital Library

[40]

L. Zhang. The efficiency and fairness of a fixed budget resource allocation game. In Automata, Languages and Programming, pages 485--496. Springer, 2005.

Cited By

Roy RPatel TTiwari DMartínez JDuato JJohn L(2021)SatoriProceedings of the 48th Annual International Symposium on Computer Architecture10.1109/ISCA52012.2021.00031(292-305)Online publication date: 14-Jun-2021
https://dl.acm.org/doi/10.1109/ISCA52012.2021.00031
Minocha STaneja N(2023)Optimum Sizing and Pricing for Multigrids using Deep Learning Techniques2023 International Conference on Distributed Computing and Electrical Circuits and Electronics (ICDCECE)10.1109/ICDCECE57866.2023.10150440(1-7)Online publication date: 29-Apr-2023
https://doi.org/10.1109/ICDCECE57866.2023.10150440
Ortega CAlvarez LBuyuktosunoglu ABertran Monfort RRosedahl TBose PMoreto Planas M(2022)Adaptive Power Shifting for Power-Constrained Heterogeneous SystemsIEEE Transactions on Computers10.1109/TC.2022.3174545(1-1)Online publication date: 2022
https://doi.org/10.1109/TC.2022.3174545
Show More Cited By

Index Terms

ReBudget: Trading Off Efficiency vs. Fairness in Market-Based Multicore Resource Allocation via Runtime Budget Reassignment
1. Computer systems organization
  1. Architectures
    1. Parallel architectures
      1. Multicore architectures
2. Theory of computation
  1. Theory and algorithms for application domains
    1. Algorithmic game theory and mechanism design

Recommendations

ReBudget: Trading Off Efficiency vs. Fairness in Market-Based Multicore Resource Allocation via Runtime Budget Reassignment
ASPLOS '16: Proceedings of the Twenty-First International Conference on Architectural Support for Programming Languages and Operating Systems

Efficiently allocating shared resources in computer systems is critical to optimizing execution. Recently, a number of market-based solutions have been proposed to attack this problem. Some of them provide provable theoretical bounds to efficiency and/...
ReBudget: Trading Off Efficiency vs. Fairness in Market-Based Multicore Resource Allocation via Runtime Budget Reassignment
ASPLOS '16

Efficiently allocating shared resources in computer systems is critical to optimizing execution. Recently, a number of market-based solutions have been proposed to attack this problem. Some of them provide provable theoretical bounds to efficiency and/...
Computing Equilibrium in Matching Markets
EC '17: Proceedings of the 2017 ACM Conference on Economics and Computation

Market equilibria of matching markets offer an intuitive and fair solution for matching problems without money with agents who have preferences over the items. Such a matching market can be viewed as a variation of Fisher market, albeit with rather ...

Comments

Information & Contributors

Information

Published In

cover image ACM SIGARCH Computer Architecture News

ACM SIGARCH Computer Architecture News Volume 44, Issue 2

ASPLOS'16

May 2016

774 pages

ISSN:0163-5964

DOI:10.1145/2980024

Editor:
Doug DeGroot
acm dot org

Issue’s Table of Contents

ASPLOS '16: Proceedings of the Twenty-First International Conference on Architectural Support for Programming Languages and Operating Systems
March 2016
824 pages
ISBN:9781450340915
DOI:10.1145/2872362
General Chair:
Tom Conte
Georgia Tech, USA
,
Program Chair:
Yuanyuan Zhou
University of California, San Diego, USA

Copyright © 2016 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]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 25 March 2016

Published in SIGARCH Volume 44, Issue 2

Check for updates

Author Tags

Qualifiers

Research-article

Funding Sources

AFOSR

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

20
Total Citations
View Citations
819
Total Downloads

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

Reflects downloads up to 23 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

Roy RPatel TTiwari DMartínez JDuato JJohn L(2021)SatoriProceedings of the 48th Annual International Symposium on Computer Architecture10.1109/ISCA52012.2021.00031(292-305)Online publication date: 14-Jun-2021
https://dl.acm.org/doi/10.1109/ISCA52012.2021.00031
Minocha STaneja N(2023)Optimum Sizing and Pricing for Multigrids using Deep Learning Techniques2023 International Conference on Distributed Computing and Electrical Circuits and Electronics (ICDCECE)10.1109/ICDCECE57866.2023.10150440(1-7)Online publication date: 29-Apr-2023
https://doi.org/10.1109/ICDCECE57866.2023.10150440
Ortega CAlvarez LBuyuktosunoglu ABertran Monfort RRosedahl TBose PMoreto Planas M(2022)Adaptive Power Shifting for Power-Constrained Heterogeneous SystemsIEEE Transactions on Computers10.1109/TC.2022.3174545(1-1)Online publication date: 2022
https://doi.org/10.1109/TC.2022.3174545
Heo TWang YCui WHuh JZhang L(2022)Adaptive Page Migration Policy With Huge Pages in Tiered Memory SystemsIEEE Transactions on Computers10.1109/TC.2020.303668671:1(53-68)Online publication date: 1-Jan-2022
https://doi.org/10.1109/TC.2020.3036686
Yu TZhong RJanjic VPetoumenos PZhai JLeather HThomson J(2021)Collaborative Heterogeneity-Aware OS Scheduler for Asymmetric Multicore ProcessorsIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2020.304527932:5(1224-1237)Online publication date: 1-May-2021
https://doi.org/10.1109/TPDS.2020.3045279
Yu TPetoumenos PJanjic VLeather HThomson JMars JTang LXue JWu P(2020)COLAB: a collaborative multi-factor scheduler for asymmetric multicore processorsProceedings of the 18th ACM/IEEE International Symposium on Code Generation and Optimization10.1145/3368826.3377915(268-279)Online publication date: 22-Feb-2020
https://dl.acm.org/doi/10.1145/3368826.3377915
Pothukuchi RPothukuchi SVoulgaris PTorrellas J(2020)Control Systems for Computing Systems: Making computers efficient with modular, coordinated, and robust controlIEEE Control Systems10.1109/MCS.2019.296173340:2(30-55)Online publication date: Apr-2020
https://doi.org/10.1109/MCS.2019.2961733
Nagendra Prasad SKulkarni SVenkatareddy P(2020)Cache Aware Task Scheduling Algorithm for Heterogeneous Cloud Computing Environment2020 Fifth International Conference on Research in Computational Intelligence and Communication Networks (ICRCICN)10.1109/ICRCICN50933.2020.9296177(154-158)Online publication date: 26-Nov-2020
https://doi.org/10.1109/ICRCICN50933.2020.9296177
Nejat MPericas MStenstrom P(2019)QoS-Driven Coordinated Management of Resources to Save Energy in Multi-core Systems2019 IEEE International Parallel and Distributed Processing Symposium (IPDPS)10.1109/IPDPS.2019.00040(303-313)Online publication date: May-2019
https://doi.org/10.1109/IPDPS.2019.00040
Rahmani ADonyanavard BMück TMoazzemi KJantsch AMutlu ODutt N(2018)SPECTRACM SIGPLAN Notices10.1145/3296957.317319953:2(169-183)Online publication date: 19-Mar-2018
https://dl.acm.org/doi/10.1145/3296957.3173199
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

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

Media

Figures

Other

Tables

View Issue’s Table of Contents