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

  • Davide Zoni
  • Patrick Bellasi
  • William Fornaciari
Part of the Lecture Notes in Computer Science book series (LNCS, 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.

Keywords

Integer Linear Program Knapsack Problem Critical Application Active Cluster Working Mode 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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. 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. 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)MathSciNetCrossRefMATHGoogle Scholar
  4. 4.
  5. 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. 6.
    Khan, S.: Quality Adaptation in a Multisession Multimedia System: Model, Algorithms and Architecture. Ph.D. thesis, University of Victoria (1998)Google Scholar
  7. 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. 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. 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)CrossRefGoogle Scholar
  10. 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. 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. 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

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Davide Zoni
    • 1
  • Patrick Bellasi
    • 1
  • William Fornaciari
    • 1
  1. 1.Dipartimento di Elettronica e InformazionePolitecnico di MilanoMilanoItaly

Personalised recommendations