research-article

A parameterized compositional multi-dimensional multiple-choice knapsack heuristic for CMP run-time management

Authors:

Hamid Shojaei,

AmirHossein Ghamarian,

Twan Basten,

Marc Geilen,

Sander Stuijk,

Rob HoesAuthors Info & Claims

DAC '09: Proceedings of the 46th Annual Design Automation Conference

Pages 917 - 922

https://doi.org/10.1145/1629911.1630147

Published: 26 July 2009 Publication History

Get Access

Abstract

Modern embedded systems typically contain chip-multiprocessors (CMPs) and support a variety of applications. Applications may run concurrently and can be started and stopped over time. Each application may typically have multiple feasible configurations, trading off quality aspects (energy consumption, audio-visual quality) with resource usage for various types of resources. Overall system quality needs to be guaranteed and optimized at all times. This leads to the need for a run-time management solution that selects an appropriate system configuration from all the application configurations of active applications. This run-time management problem can be phrased as a multi-dimensional multiple-choice knapsack (MMKP) problem. We present a compositional heuristic to solve MMKP, that due to the compositionality is better suited to CMP run-time management than existing heuristics that are all not compositional. Our heuristic outperforms the best-known heuristic to date. The heuristic is parameterized, leading to the additional advantage that it allows to trade off execution time vs. solution quality, and to bound the time needed to compute a solution. The latter makes it particularly well-suited for resource-constrained embedded platforms.

References

[1]

M. Akbar et al. Solving the multidimensional multiple-choice knapsack problem by constructing convex hulls. Computers and Operations Research, 33(5):1259--1273, 2006.

Digital Library

Google Scholar

[2]

M. Geilen et al. An algebra of Pareto points. Fundamenta Informaticae, 78(1):35--74, 2007.

Digital Library

Google Scholar

[3]

S. V. Gheorghita et al. Application Scenarios in Streaming-Oriented Embedded-System Design. IEEE Design and Test of Computers, 25(6):581--589, 2008.

Digital Library

Google Scholar

[4]

S. Khan et al. The utility model for adaptive multimedia systems. Int. Workshop on Multimedia Modeling, p. 111--126, 1997.

Google Scholar

[5]

S. Khan et al. Solving the knapsack problem for adaptive multimedia systems. Studia Informatica Universalis, p. 161--182, 2002.

Google Scholar

[6]

S. Khuri et al. The zero/one multiple knapsack problem and genetic algorithms. ACM Symp. of applied computation, 1994.

Digital Library

Google Scholar

[7]

Lp_solve. http://lpsolve.sourceforge.net.

Google Scholar

[8]

M. Moser et al. An algorithm for the multidimensional multiple-choice knapsack problem. IEICE Trans. on Fundamentals of Electronics, E80-A(3):582--589, 1997.

Google Scholar

[9]

MMKP Problems. ftp://cermsem.univparisl.fr/pub/CERMSEM/hifi/MMKP/MMKP.html.

Google Scholar

[10]

R. Parra-Hemandez and N. Dimopoulos. A new heuristic for solving the multichoice multidimensional knapsack problem. IEEE Trans. on Systems, Man, Cybernetics, 35(5):708--717, 2005.

Digital Library

Google Scholar

[11]

SimIt-ARM. http://simit-arm.sourceforge.net.

Google Scholar

[12]

Ch. Ykman-Couvreur et al. Fast Multi-Dimension Multi-Choice Knapsack Heuristic for MP-SoC Run-Time Management. In SoC 2006, p. 1--4. IEEE, 2006.

Google Scholar

Cited By

View all

Tkachenko OHarding SAnderson CPerazzone JDwyer MChan K(2023)Characterizing the Performance of Distributed Edge Processing Resource Allocation in Dynamic Networked EnvironmentsMILCOM 2023 - 2023 IEEE Military Communications Conference (MILCOM)10.1109/MILCOM58377.2023.10356276(888-893)Online publication date: 30-Oct-2023
https://doi.org/10.1109/MILCOM58377.2023.10356276
Smirnov FPourmohseni BTeich J(2020)Using Learning Classifier Systems for the DSE of Adaptive Embedded Systems2020 Design, Automation & Test in Europe Conference & Exhibition (DATE)10.23919/DATE48585.2020.9116383(957-962)Online publication date: Mar-2020
https://doi.org/10.23919/DATE48585.2020.9116383
Weichslgartner AWildermann SGangadharan DGlaß MTeich J(2018)A Design-Time/Run-Time Application Mapping Methodology for Predictable Execution Time in MPSoCsACM Transactions on Embedded Computing Systems10.1145/327466517:5(1-25)Online publication date: 19-Nov-2018
https://dl.acm.org/doi/10.1145/3274665
Show More Cited By

Index Terms

A parameterized compositional multi-dimensional multiple-choice knapsack heuristic for CMP run-time management
1. Computer systems organization
  1. Embedded and cyber-physical systems
  2. Real-time systems
2. Hardware
  1. Very large scale integration design
    1. VLSI system specification and constraints

Recommendations

A fast and scalable multidimensional multiple-choice knapsack heuristic
Special Section on Networks on Chip: Architecture, Tools, and Methodologies

Many combinatorial optimization problems in the embedded systems and design automation domains involve decision making in multidimensional spaces. The multidimensional multiple-choice knapsack problem (MMKP) is among the most challenging of the ...
Solving the Multidimensional Multiple-choice Knapsack Problem by constructing convex hulls

This paper presents a heuristic to solve the Multidimensional Multiple-choice Knapsack Problem (MMKP), a variant of the classical 0-1 Knapsack Problem. We apply a transformation technique to map the multidimensional resource consumption to single ...
A multiprocessor based heuristic for multi-dimensional multiple-choice knapsack problem

This paper presents a multiprocessor based heuristic algorithm for the Multi-dimensional Multiple Choice Knapsack Problem (MMKP). MMKP is a variant of the classical 0---1 knapsack problem, where items having a value and a number of resource ...

Comments

Information & Contributors

Information

Published In

DAC '09: Proceedings of the 46th Annual Design Automation Conference

July 2009

994 pages

ISBN:9781605584973

DOI:10.1145/1629911

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: 26 July 2009

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

DAC '09

Sponsor:

EDAC
SIGDA
IEEE-CAS

DAC '09: The 46th Annual Design Automation Conference 2009

July 26 - 31, 2009

California, San Francisco

Acceptance Rates

Overall Acceptance Rate 1,770 of 5,499 submissions, 32%

Upcoming Conference

DAC '25

Sponsor:
sigda

62nd ACM/IEEE Design Automation Conference

June 22 - 26, 2025

San Francisco , CA , USA

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

53
Total Citations
View Citations
232
Total Downloads

Downloads (Last 12 months)4
Downloads (Last 6 weeks)0

Reflects downloads up to 07 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Tkachenko OHarding SAnderson CPerazzone JDwyer MChan K(2023)Characterizing the Performance of Distributed Edge Processing Resource Allocation in Dynamic Networked EnvironmentsMILCOM 2023 - 2023 IEEE Military Communications Conference (MILCOM)10.1109/MILCOM58377.2023.10356276(888-893)Online publication date: 30-Oct-2023
https://doi.org/10.1109/MILCOM58377.2023.10356276
Smirnov FPourmohseni BTeich J(2020)Using Learning Classifier Systems for the DSE of Adaptive Embedded Systems2020 Design, Automation & Test in Europe Conference & Exhibition (DATE)10.23919/DATE48585.2020.9116383(957-962)Online publication date: Mar-2020
https://doi.org/10.23919/DATE48585.2020.9116383
Weichslgartner AWildermann SGangadharan DGlaß MTeich J(2018)A Design-Time/Run-Time Application Mapping Methodology for Predictable Execution Time in MPSoCsACM Transactions on Embedded Computing Systems10.1145/327466517:5(1-25)Online publication date: 19-Nov-2018
https://dl.acm.org/doi/10.1145/3274665
Schwarzer TRoloff SRichthammer VKhaldi RWildermann SGlass MTeich J(2018)On the Complexity of Mapping Feasibility in Many-Core Architectures2018 IEEE 12th International Symposium on Embedded Multicore/Many-core Systems-on-Chip (MCSoC)10.1109/MCSoC2018.2018.00038(176-183)Online publication date: Sep-2018
https://doi.org/10.1109/MCSoC2018.2018.00038
Theelen BDeprettere EBhattacharyya S(2018)Dynamic Dataflow GraphsHandbook of Signal Processing Systems10.1007/978-3-319-91734-4_32(1173-1210)Online publication date: 14-Oct-2018
https://doi.org/10.1007/978-3-319-91734-4_32
Singh ADziurzanski PMendis HIndrusiak L(2017)A Survey and Comparative Study of Hard and Soft Real-Time Dynamic Resource Allocation Strategies for Multi-/Many-Core SystemsACM Computing Surveys10.1145/305726750:2(1-40)Online publication date: 11-Apr-2017
https://dl.acm.org/doi/10.1145/3057267
van Pinxten JGeilen MBasten TWaqas USomers LFanucci LTeich J(2016)Online heuristic for the multi-objective generalized traveling salesman problemProceedings of the 2016 Conference on Design, Automation & Test in Europe10.5555/2971808.2971997(822-825)Online publication date: 14-Mar-2016
https://dl.acm.org/doi/10.5555/2971808.2971997
Shafique MIvanov AVogel BHenkel J(2016)Scalable Power Management for On-Chip Systems with Malleable ApplicationsIEEE Transactions on Computers10.1109/TC.2016.254063165:11(3398-3412)Online publication date: 1-Nov-2016
https://dl.acm.org/doi/10.1109/TC.2016.2540631
Quan WPimentel A(2016)A hierarchical run-time adaptive resource allocation framework for large-scale MPSoC systemsDesign Automation for Embedded Systems10.1007/s10617-016-9179-z20:4(311-339)Online publication date: 1-Dec-2016
https://dl.acm.org/doi/10.1007/s10617-016-9179-z
Shafique MGnad DGarg SHenkel JNebel WAtienza D(2015)Variability-aware dark silicon management in on-chip many-core systemsProceedings of the 2015 Design, Automation & Test in Europe Conference & Exhibition10.5555/2755753.2755840(387-392)Online publication date: 9-Mar-2015
https://dl.acm.org/doi/10.5555/2755753.2755840
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.

PDF

eReader

View online with eReader.

eReader

Abstract

References

Cited By

Index Terms

Recommendations

A fast and scalable multidimensional multiple-choice knapsack heuristic

Solving the Multidimensional Multiple-choice Knapsack Problem by constructing convex hulls

A multiprocessor based heuristic for multi-dimensional multiple-choice knapsack problem

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Author Tags

Qualifiers

Conference

Acceptance Rates

Upcoming Conference

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

Login options

Full Access

View options

PDF

eReader

Share

Share this Publication link

Share on social media

Affiliations