Throughput Constraint for Synchronous Data Flow Graphs
نویسندگان
چکیده
Stream (data-flow) computing is considered an effective paradigm for parallel programming of high-end multi-core architectures for embedded applications (networking, multimedia, wireless communication). Our work addresses a key step in stream programming for embedded multicores, namely, the efficient mapping of a synchronous data-flow graph (SDFG) onto a multi-core platform subject to a minimum throughput requirement. This problem has been extensively studied in the past, and its complexity has lead researches to develop incomplete algorithms which cannot exclude false negatives. We developed a CP-based complete algorithm based on a new throughput-bounding constraint. The algorithm has been tested on a number of non-trivial SDFG mapping problems with promising results.
منابع مشابه
Maximum-throughput mapping of SDFGs on multi-core SoC platforms
Data-Flowmodels are attracting renewed attention because they lend themselves to efficientmapping on multi-core architectures. The key problemof finding amaximum-throughput allocation and scheduling of Synchronous Data-Flow graphs (SDFGs) onto amulti-core architecture is NP-hard and has been traditionally solved by means of heuristic (incomplete) algorithms with no guarantee of global optimalit...
متن کاملExecuting synchronous data flow graphs on heterogeneous execution architectures using integer linear programming
This paper presents an integer linear programming (ILP) technique to partition and schedule Synchronous Data Flow (SDF) graphs onto heterogeneous execution architectures. Our ILP formulation gives a partition and schedule for SDF graphs, which provide the optimal execution time. We incorporate new methods of exploiting stateless data-parallelism on a heterogeneous architecture. We quantitativel...
متن کاملPerformance Analysis and Implementationof Predictable Streaming Applications onMultiprocessor Systems-on-Chip
Driven by the increasing capacity of integrated circuits, multiprocessor systems-on-chip (MPSoCs) are increasing widely used in modern consumer electronics devices. In this thesis, the performance analysis and implementation methodologies of predictable streaming applications on these MPSoCs computing platforms are explored. The functionality and application concurrency are described in synchro...
متن کاملConstraint based methods for allocation and scheduling of periodic applications
This work presents exact algorithms for the Resource Allocation and Cyclic Scheduling Problems (RA&CSPs). Cyclic Scheduling Problems arise in a number of application areas, such as in hoist scheduling, mass production, compiler design (implementing scheduling loops on parallel architectures), software pipelining, and in embedded system design. The RA&CS problem concerns time and resource assign...
متن کاملJust-in-time execution is not always optimal!
Synchronous Data Flow (SDF) is a popular model for analyzing workflows. It is well-known that self-timed scheduling, starting a task when all its prerequisites are satisfied, is throughput-optimal for SDF graphs. Just-in-time scheduling in the presence of deadlines has so far received little attention in the literature. We show that a feasible just-in-time schedule exists if and only if a feasi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009