Skip to main content

A Low-Overhead Heuristic for Mixed Workload Resource Partitioning in Cluster-Based Architectures

  • Conference paper

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

Abstract

The execution of multiple multimedia applications on a modern Multi-Processor System-on-Chip (MPSoC) rises up the need of a Run-Time Management (RTM) layer to match hardware and application needs. This paper proposes a novel model for the run-time resource allocation problem taking into account both architectural and application standpoints. Our model considers clustered and non-clustered resources, migration and reconfiguration overheads, quality of service (QoS) and application priorities. A near optimal solution is computed focusing on spatial and computational constraints. Experiments reveal that our first implementation is able to manage tens of applications with an overhead of only fews milliseconds and a memory footprint of less than one hundred KB, thus suitable for usage on real systems.

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

Buying options

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 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Acquaviva, A., Alimonda, A., Carta, S., Pittau, M.: Assessing Task Migration Impact on Embedded Soft Real-Time Streaming Multimedia Applications. EURASIP Journal on Embedded Systems, 1–16 (2008)

    Google Scholar 

  2. Geilen, M., Basten, T., Theelen, B., Otten, R.: An Algebra of Pareto Points. In: IEEE ACSD 2005, pp. 88–97 (2005)

    Google Scholar 

  3. Hifi, M., Michrafy, M., Sbihi, A.: A Reactive Local Search-Based Algorithm for the Multiple-Choice Multi-Dimensional Knapsack Problem. Computational Optimization and Applications 33(2-3), 271–285 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  4. Hifi, M.: Benchmark Data, http://www.laria.u-picardie.fr/hifi/OR-Benchmark/MMKP/

  5. Khan, S., Li, K.F., Manning, E.G., Akbar, M.M.: Solving the Knapsack Problem for Adaptive Multimedia Systems. Studia Informatica Universalis 2(1), 157–178 (2002)

    Google Scholar 

  6. Khan, S.: Quality Adaptation in a Multisession Multimedia System: Model, Algorithms and Architecture. Ph.D. thesis, University of Victoria (1998)

    Google Scholar 

  7. Nollet, V., Verkest, D., Corporaal, H.: A Safari Through the MPSoC Run-Time Management Jungle. Journal of Signal Processing Systems (2008)

    Google Scholar 

  8. Raina, S.: Introduction to Quality of Service (QoS). In: Telecommunications Quality of Service: The Business of Success (QoS 2004), pp. 48–51 (2004)

    Google Scholar 

  9. Shahriar, A.Z.M., Akbar, M.M., Rahman, M.S., Newton, M.A.H.: A multiprocessor based heuristic for multi-dimensional multiple-choice knapsack problem. The Journal of Supercomputing 43(3), 257–280 (2007)

    Article  Google Scholar 

  10. Shojaei, H., Ghamarian, A.H., Basten, T., Geilen, M., Stuijk, S., Hoes, R.: A parameterized compositional multi-dimensional multiple-choice knapsack heuristic for CMP run-time management. In: 46th ACM/IEEE DAC 2009, pp. 917–922 (2009)

    Google Scholar 

  11. Xu, P., Michailidis, G., Devetsikiotis, M.: Profit-Oriented Resource Allocation Using Online Scheduling in Flexible Heterogeneous Networks. Accepted by Telecommunication Systems (2005)

    Google Scholar 

  12. Ykman-Couvreur, C., Nollet, V., Catthoor, F., Corporaal, H.: Fast Multi-Dimension Multi-Choice Knapsack Heuristic for MP-SoC Run-Time Management. In: International Symposium on System-on-Chip, pp. 1–4. IEEE (November 2006)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Andreas Herkersdorf Kay Römer Uwe Brinkschulte

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zoni, D., Bellasi, P., Fornaciari, W. (2012). A Low-Overhead Heuristic for Mixed Workload Resource Partitioning in Cluster-Based Architectures. In: Herkersdorf, A., Römer, K., Brinkschulte, U. (eds) Architecture of Computing Systems – ARCS 2012. ARCS 2012. Lecture Notes in Computer Science, vol 7179. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-28293-5_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-28293-5_8

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-28292-8

  • Online ISBN: 978-3-642-28293-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics