Wiggers, M.H. and Bekooij, M.J.G. and Jansen, P.G. and Smit, G.J.M.
Efcient Computation of Buffer Capacities for Cyclo-Static Real-Time Systems with Back-Pressure.
Technical Report TR-CTIT-06-64,
Centre for Telematics and Information Technology University of Twente, Enschede.
There is a more recent version of this eprint available. Click here to view it.
Full text available as:
A key step in the design of cyclo-static real-time
systems is the determination of buffer capacities. In our multiprocessor system, we apply back-pressure, which means that tasks wait for space in output buffers. Consequently buffer capacities affect the throughput. This requires the derivation of buffer capacities that both result in a satisfaction of the throughput constraint, and also satisfy the constraints on the maximum buffer capacities.
Existing exact solutions suffer from the computational complexity that is associated with the required conversion from a cyclo-static dataflow graph to a single-rate dataflow graph. In this paper we present an algorithm, with linear computational complexity, that does not require this conversion and that strives to obtain close to minimal buffer capacities. The algorithm is applied to an MP3 playback application that is mapped on our multi-processor system.
|Item Type:||Internal Report (Technical Report)|
|Research Group:||EWI-CAES: Computer Architecture for Embedded Systems, EWI-DIES: Distributed and Embedded Security|
|Research Program:||CTIT-UBRICKS: Building Blocks for Ubiquitous Computing and Communication|
|Research Project:||PASTA: modelling PArallel Systems for Timing Analysis|
|Deposited On:||09 November 2006|
Available Versions of this Item
Export this item as:
To correct this item please ask your editor
Repository Staff Only: edit this item