Efficient Computation of Buffer Capacities for Cyclo-Static Real-Time Systems with Back-Pressure

Share/Save/Bookmark

Wiggers, Maarten and Bekooij, Marco and Jansen, Pierre and Smit, Gerard (2006) Efficient Computation of Buffer Capacities for Cyclo-Static Real-Time Systems with Back-Pressure. [Report]

[img]
Preview
PDF
243Kb
Abstract: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:Report
Copyright:© 2006 University of Twente, Centre for Telematics and Information Technology
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/66487
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page

Metis ID: 237415