Predictable Embedded Multiprocessor System Design

Bekooij, Marco; Moreira, Orlando; Poplavko, Peter; Mesman, Bart; Pastrnak, M.; Meerbergen, J. van

doi:10.1007/978-3-540-30113-4_7

Cited by 41 publications

(37 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Each processing tile consists of a processor, a small local memory, a local arbiter and a communication assist (CA) that is similar to the one described in [5]. A networkinterface (NI) is used to connect each tile to the network.…”

Section: Propertymentioning

confidence: 99%

Analyzing composability of applications on MPSoC platforms

Kumar

Mesman

Theelen

et al. 2008

Journal of Systems Architecture

Self Cite

View full text Add to dashboard Cite

Section: Propertymentioning

confidence: 99%

Analyzing composability of applications on MPSoC platforms

Kumar

Mesman

Theelen

et al. 2008

Journal of Systems Architecture

Self Cite

View full text Add to dashboard Cite

“…The jobs are modelled as Multirate Data Flow (MRDF) graphs [3,13,20]. An MRDF graph is a directed graph ¥ § ¦ ©…”

Section: Applicationmentioning

confidence: 99%

“…We call this interval of time the relative deadline of the task. Through analysis techniques [3,17,8,19], it is possible for a given MRDF graph, annotated with worst-case execution times for all actors, and expanded with channel models [19] and a given required minimum throughput to compute feasible relative deadlines for each task to chose relative deadlines for the tasks and compute minimal buffer sizes [8]. Budget determination falls outside of the scope of this paper.…”

Section: Applicationmentioning

confidence: 99%

Online resource management in a multiprocessor with a network-on-chip

Moreira

Mol²,

Bekooij

2007

Proceedings of the 2007 ACM Symposium on Applied Computing

Self Cite

View full text Add to dashboard Cite

We propose an online resource allocation solution for multiprocessor systems-on-chip, that executes several real-time, streaming media jobs simultaneously. The system consists of up to 24 processors connected by an AEthereal [7] Network-on-Chip (NoC) of 4 to 12 routers. A job is a set of processing tasks connected by FIFO channels. Each job can be independently started or stopped by the user. Each job is annotated with resource budgets per computation task and communication channel which have been computed at compile-time. When a job is requested to start, resources that meet the required resource budgets have to be found. Because it is done online, allocation must be done with low-complexity algorithms. We do the allocation in two-steps. First, tasks are assigned to virtual tiles (VTs), while trying to minimise the total number of VTs and the total bandwidth used. In the second step, these VTs are mapped to real tiles, and network bandwidth allocation and routing are performed simultaneously. We show with simulations that introducing randomisation in the processing order yields a significant improvement in the percentage of mapping succdesses. In combination, these techniques allow 95% of the processor resources to be allocated while handling a large number of job arrivals and departures.

show abstract

“…Multiprocessor systems-on-chip, like Daytona [1], Eclipse [26], Hijdra [2], and StepNP [22], use the tile-based multiprocessor template described by Culler [4]. Each tile contains one or a few processor cores and local memories.…”

Section: Architecture Platformmentioning

confidence: 99%

Resource-Efficient Routing and Scheduling of Time-Constrained Network-on-Chip Communication

Stuijk

Basten

Geilen

et al. 2006

9th EUROMICRO Conference on Digital System Design (DSD'06)

View full text Add to dashboard Cite

Abstract. Network-on-chip-based multiprocessor systems-onchip are considered as future embedded systems platforms. One of the steps in mapping an application onto such a parallel platform involves scheduling the communication on the network-onchip. This paper presents different scheduling strategies that minimize resource usage by exploiting all scheduling freedom offered by networks-on-chip. It also introduces a technique to take the dynamism in applications into account when scheduling the communication of an application on the network-on-chip while minimizing the resource usage. Our experiments show that resourceutilization is improved when compared to existing techniques.

show abstract

Predictable Embedded Multiprocessor System Design

Cited by 41 publications

References 3 publications

Analyzing composability of applications on MPSoC platforms

Analyzing composability of applications on MPSoC platforms

Online resource management in a multiprocessor with a network-on-chip

Resource-Efficient Routing and Scheduling of Time-Constrained Network-on-Chip Communication

Contact Info

Product

Resources

About