Multiprocessor Resource Allocation for Throughput-Constrained Synchronous Dataflow Graphs

Abstract. Embedded multimedia systems often run multiple time-constrained applications simultaneously. These systems use multiprocessor systems-on-chip of which it must be guaranteed that enough resources are available for each application to meet its throughput constraints. This requires a task binding and scheduling mechanism that provides timing guarantees for each application independent of other applications while taking into account the available processor space, memory and communication bandwidth. Synchronous Dataflow Graphs (SDFGs) are used to model time-constrained multimedia applications. They allow modeling of cyclic, multirate dependencies between tasks. However, existing resource allocation techniques can only deal with acyclic and/or single-rate dependencies. Dependencies in an SDFG can be expressed in single-rate form, but then the problem size may increase exponentially making resource allocation infeasible. This paper presents a new resource allocation strategy which w...

• Type: Conference
• Year: 2007
• Where: DAC
• Authors: Sander Stuijk, Twan Basten, Marc Geilen, Henk Corporaal
• Keywords: DAC 2007, Design Automation, Multirate Dependencies, Resource Allocation Strategy, Resource Allocation Techniques