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.
- M. Becchi and P. Crowley. Dynamic thread assignment on heterogeneous multiprocessor architectures. In Intl. Conf. on Computing Frontiers (FC), 2006.Google Scholar
Digital Library
- 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.Google Scholar
Cross Ref
- 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.Google Scholar
Digital Library
- 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.Google Scholar
Digital Library
- S. J. Brams and A. D. Taylor. Fair Division: From cake-cutting to dispute resolution. Cambridge University Press, 1996.Google Scholar
Cross Ref
- 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.Google Scholar
Digital Library
- 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.Google Scholar
Digital Library
- B. Calder, T. Sherwood, E. Perelman, and G. Hamerley. Simpoint. http://www.cs.ucsd.edu/ calder/simpoint/, 2003.Google Scholar
- 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.Google Scholar
- P. Chaparro, J. González, and A. González. Thermal-effective clustered microarchitectures. In Workshop on Temperature-Aware Computer Systems, 2004.Google Scholar
- 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.Google Scholar
Digital Library
- J. Chen and L. K. John. Predictive coordination of multiple on-chip resources for chip multiprocessors. In Intl. Conf. on Supercomputing (ICS), 2011.Google Scholar
Digital Library
- 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.Google Scholar
Digital Library
- J. Chen, A. Nair, and L. John. Predictive heterogeneity-aware application scheduling for chip multiprocessors. IEEE Trans. on Computers, 63, 2012.Google Scholar
- S. Choi and D. Yeung. Learning-based SMT processor resource distribution via hill-climbing. In Intl. Symp. on Computer Architecture (ISCA), 2006.Google Scholar
Digital Library
- 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.Google Scholar
Digital Library
- 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.Google Scholar
Digital Library
- G. Hardin. The tragedy of the commons. Science, 162 (3859): 1243--1248, 1968.Google Scholar
Cross Ref
- M. T. Inc. 2Gb DDR3 SDRAM component data sheet: MT41J256M8. http://www.micron.com/parts/dram/ddr3-sdram/mt41j256m8da-125, July 2012.Google Scholar
- 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.Google Scholar
- R. Johari and J. N. Tsitsiklis. Efficiency loss in a network resource allocation game. Mathematics of Operations Research, 29 (3): 407--435, 2004.Google Scholar
Digital Library
- 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.Google Scholar
Cross Ref
- 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.Google Scholar
- R. Miftakhutdinov, E. Ebrahimi, and Y. N. Patt. Predicting performance impact of dvfs for realistic memory systems. In Intl. Symp. on Microarchitecture (MICRO), 2012.Google Scholar
Digital Library
- N. Nisan, T. Roughgarden, E. Tardos, and V. V. Vazirani. Algorithmic game theory. Cambridge University Press, 2007.Google Scholar
Digital Library
- C. Papadimitriou. Algorithms, games, and the Internet. In Intl. Symp. on Theory of computing, 2001.Google Scholar
- 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.Google Scholar
Digital Library
- 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.Google Scholar
- 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.Google Scholar
Digital Library
- P. Shivakumar and N. P. Jouppi. CACTI 3.0: an integrated cache timing, power, and area model. Technical report, HP Western Research Labs, 2001.Google Scholar
- 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.Google Scholar
- Standard Performance Evaluation Corporation. SPEC CPU2000. http://www.spec.org/cpu2000/, 2000.Google Scholar
- Standard Performance Evaluation Corporation. SPEC CPU2006. http://www.spec.org/cpu2006/, 2006.Google Scholar
- 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.Google Scholar
Cross Ref
- H. R. Varian. Equity, envy, and efficiency. Journal of economic theory, 9 (1): 63--91, 1974.Google Scholar
- R. Wang and L. Chen. Futility scaling: High-associativity cache partitioning. In Intl. Symp. on Microarchitecture (MICRO), 2014.Google Scholar
Digital Library
- 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.Google Scholar
Cross Ref
- Y. Xie and G. H. Loh. PIPP: promotion/insertion pseudo-partitioning of multi-core shared caches. In Intl. Symp. on Computer Architecture (ISCA), 2009.Google Scholar
Digital Library
- 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.Google Scholar
Digital Library
- L. Zhang. The efficiency and fairness of a fixed budget resource allocation game. In Automata, Languages and Programming, pages 485--496. Springer, 2005.Google Scholar
Index Terms
ReBudget: Trading Off Efficiency vs. Fairness in Market-Based Multicore Resource Allocation via Runtime Budget Reassignment
Recommendations
ReBudget: Trading Off Efficiency vs. Fairness in Market-Based Multicore Resource Allocation via Runtime Budget Reassignment
ASPLOS'16Efficiently 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: Proceedings of the Twenty-First International Conference on Architectural Support for Programming Languages and Operating SystemsEfficiently 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 ComputationMarket 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