A low-overhead heuristic for mixed workload resource partitioning in cluster-based architectures

Authors:
Davide Zoni;Patrick Bellasi;William Fornaciari
Affiliations:
Dipartimento di Elettronica e Informazione, Politecnico di Milano, Milano, Italy;Dipartimento di Elettronica e Informazione, Politecnico di Milano, Milano, Italy;Dipartimento di Elettronica e Informazione, Politecnico di Milano, Milano, Italy
Venue:
ARCS'12 Proceedings of the 25th international conference on Architecture of Computing Systems
Year:
2012

Citing 7
Cited 0

Quality adaptation in a multisession multimedia system: model, algorithms, and architecture

Quality adaptation in a multisession multimedia system: model, algorithms, and architecture
An Algebra of Pareto Points

ACSD '05 Proceedings of the Fifth International Conference on Application of Concurrency to System Design
A Reactive Local Search-Based Algorithm for the Multiple-Choice Multi-Dimensional Knapsack Problem

Computational Optimization and Applications
A multiprocessor based heuristic for multi-dimensional multiple-choice knapsack problem

The Journal of Supercomputing
Assessing task migration impact on embedded soft real-time streaming multimedia applications

EURASIP Journal on Embedded Systems - Operating System Support for Embedded Real-Time Applications
A parameterized compositional multi-dimensional multiple-choice knapsack heuristic for CMP run-time management

Proceedings of the 46th Annual Design Automation Conference
A Safari Through the MPSoC Run-Time Management Jungle

Journal of Signal Processing Systems

Quantified Score

Hi-index	0.00

Visualization

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.