Static scheduling of synchronous data flow programs for digital signal processing
IEEE Transactions on Computers
Schedulability-driven performance analysis of multiple mode embedded real-time systems
Proceedings of the 37th Annual Design Automation Conference
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Synthesis of Embedded Software from Synchronous Dataflow Specifications
Journal of VLSI Signal Processing Systems
Mode Change Protocols for Real-Time Systems: A Survey and a New Proposal
Real-Time Systems
Minimising buffer requirements of synchronous dataflow graphs with model checking
Proceedings of the 42nd annual Design Automation Conference
A calculator for Pareto points
Proceedings of the conference on Design, automation and test in Europe
Scheduling multiple independent hard-real-time jobs on a heterogeneous multiprocessor
EMSOFT '07 Proceedings of the 7th ACM & IEEE international conference on Embedded software
RTAS '08 Proceedings of the 2008 IEEE Real-Time and Embedded Technology and Applications Symposium
Buffer Sizing for Rate-Optimal Single-Rate Data-Flow Scheduling Revisited
IEEE Transactions on Computers
Buffer minimization of real-time streaming applications scheduling on hybrid CPU/FPGA architectures
Proceedings of the Conference on Design, Automation and Test in Europe
IEEE Transactions on Signal Processing
DART--a High Level Software-Defined Radio Platform Model for Developing the Run-Time Controller
Journal of Signal Processing Systems
Design of streaming applications on MPSoCs using abstract clocks
DATE '12 Proceedings of the Conference on Design, Automation and Test in Europe
Hi-index | 0.00 |
We present a Pareto efficient design method for multi-dimensional optimization of run-time reconfigurable streaming applications on CPU/FPGA platforms, which automatically allocates applications with optimized buffer requirement and software/hardware implementation cost. At the same time, application performance is guaranteed with sustainable throughput during run-time reconfigurations. As the main contribution, we formulate the constraint based application allocation, scheduling, and reconfiguration analysis, and propose a design Pareto-point calculation flow. A public domain solver - Gecode is used in solutions finding. The capability of our method has been exemplified by two cases studies on applications from media and communication domains.