Simultaneous Budget and Buffer Size Computation for Throughput-Constrained Task Graphs

Provided by: edaa
Topic: Hardware
Format: PDF
Modern embedded multimedia systems process multiple concurrent streams of data processing jobs. Streams often have throughput requirements. These jobs are implemented on a multiprocessor system as a task graph. Tasks communicate data over buffers, where tasks wait on sufficient space in output buffers before producing their data. For cost reasons, jobs share resources. Because jobs can share resources with other jobs that include tasks with date-dependent execution rates, the authors assume run-time scheduling on shared resources.

Find By Topic