Global Analysis of Resource Arbitration for MPSoC

Authors:
Akash Kumar;Bart Mesman;Henk Corporaal;Jef van Meerbergen;Ha Yajun
Affiliations:
Eindhoven University of Technology, The Netherlands;Eindhoven University of Technology, The Netherlands;Eindhoven University of Technology, The Netherlands;Eindhoven University of Technology, The Netherlands;National University of Singapore, Singapore
Venue:
DSD '06 Proceedings of the 9th EUROMICRO Conference on Digital System Design
Year:
2006

Citing 0
Cited 6

A probabilistic approach to model resource contention for performance estimation of multi-featured media devices

Proceedings of the 44th annual Design Automation Conference
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
Multiprocessor systems synthesis for multiple use-cases of multiple applications on FPGA

ACM Transactions on Design Automation of Electronic Systems (TODAES)
Analyzing composability of applications on MPSoC platforms

Journal of Systems Architecture: the EUROMICRO Journal
Resource Management Policy Handling Multiple Use-Cases in MPSoC Platforms Using Constraint Programming

ICLP '08 Proceedings of the 24th International Conference on Logic Programming
New model-driven design and generation of multi-facet arbiters part I: from the design model to the architecture model

Proceedings of the 47th Design Automation Conference

Quantified Score

Hi-index	0.00

Visualization

Abstract

Modern day applications require use of multi-processor systems for reasons of scalability and power efficiency. As more and more applications are integrated on a single device, mapping and analyzing them on a multi-processor system becomes a multi-dimensional problem. Each possible set of applications that can be active simultaneously leads to a different use-case (also referred to as scenario) that the system has to be verified and tested for. Analyzing the feasibility and resource utilization of all possible use-cases is very demanding and often infeasible. In this paper, we highlight the issue of composability, i.e. being able to analyze applications in isolation while still reason about their overall behavior. We observe that arbitration plays an important role in this analysis. We compare two simple, yet commonly used arbitration mechanisms, and highlight the properties that are important for such analysis. We conclude that none of these arbitration mechanism is ideal for such an analysis and propose some variations to make them more suited for the analysis.