An Efficient and Complete Approach for Throughput-Maximal SDF Allocation and Scheduling on Multi-Core Platforms

Provided by: edaa
Topic: Hardware
Format: PDF
In this paper, the authors focus on allocating and scheduling a Synchronous Data-Flow (SDF) graph onto a multi-core platform subject to a minimum throughput requirement. This problem has traditionally been tackled by incomplete approaches based on problem decomposition and local search, which could not guarantee optimality. Exact algorithms used to be considered reasonable only for small problem instances. They propose a complete algorithm based on Constraint Programming which solves the allocation and scheduling problem as a whole.

Find By Topic