Introduction to algorithms
Efficient algorithms for optimum cycle mean and optimum cost to time ratio problems
Proceedings of the 36th annual ACM/IEEE Design Automation Conference
Fractional rate dataflow model and efficient code synthesis for multimedia applications
Proceedings of the joint conference on Languages, compilers and tools for embedded systems: software and compilers for embedded systems
Consistency in Dataflow Graphs
IEEE Transactions on Parallel and Distributed Systems
Proceedings of the 13th International Conference on Application and Theory of Petri Nets
A comparison of synchronous and cycle-static dataflow
ASILOMAR '95 Proceedings of the 29th Asilomar Conference on Signals, Systems and Computers (2-Volume Set)
ACSD '06 Proceedings of the Sixth International Conference on Application of Concurrency to System Design
Efficient Computation of Buffer Capacities for Cyclo-Static Real-Time Systems with Back-Pressure
RTAS '07 Proceedings of the 13th IEEE Real Time and Embedded Technology and Applications Symposium
Efficient computation of buffer capacities for cyclo-static dataflow graphs
Proceedings of the 44th annual Design Automation Conference
Throughput-Buffering Trade-Off Exploration for Cyclo-Static and Synchronous Dataflow Graphs
IEEE Transactions on Computers
Embedded System Design: Modeling, Synthesis and Verification
Embedded System Design: Modeling, Synthesis and Verification
A calculus for network delay. I. Network elements in isolation
IEEE Transactions on Information Theory
Complexity results for Weighted Timed Event Graphs
Discrete Optimization
| Hi-index | 0.00 |
Cyclo-Static DataFlow (CSDF) is a powerful model for the specification of DSP applications. However, as in any asynchronous model, the synchronization of the different communicating tasks (processes) is made through buffers that have to be sized such that timing constraints are met. In this paper, we want to determine buffer sizes such that the throughput constraint is satisfied. This problem has been proved to be of exponential complexity. Exact techniques to solve this problem are too time and/or space consuming because of the self-timed schedule needed to evaluate the maximum throughput. Therefore, a periodic schedule is used. Each CSDF actor is associated with a period that satisfies the throughput constraint and sufficient buffer sizes are derived in polynomial time. However, within a period, an actor phases can be scheduled in different manners which impacts the evaluation of sufficient buffer sizes. This paper presents a Min-Max Linear Program that derives an optimized periodic phases scheduling per CSDF actor in order to minimize buffer sizes. It is shown through different applications that this Min-Max Linear Program allows to obtain close to optimal values while running in polynomial time.