An efficient and complete approach for throughput-maximal SDF allocation and scheduling on multi-core platforms
暂无分享,去创建一个
Luca Benini | Michele Lombardi | Michela Milano | Alessio Bonfietti | L. Benini | M. Milano | Alessio Bonfietti | M. Lombardi
[1] E.A. Lee,et al. Synchronous data flow , 1987, Proceedings of the IEEE.
[2] Sander Stuijk,et al. SDF^3: SDF For Free , 2006, Sixth International Conference on Application of Concurrency to System Design (ACSD'06).
[3] Rajesh K. Gupta,et al. Faster maximum and minimum mean cycle algorithms for system-performance analysis , 1998, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..
[4] Eric Flamand. Strategic directions towards multicore application specific computing , 2009, DATE '09.
[5] Edward A. Lee,et al. Determining the Order of Processor Transactions in Statically Scheduled Multiprocessors , 1997, J. VLSI Signal Process..
[6] Shuvra S. Bhattacharyya,et al. Embedded Multiprocessors: Scheduling and Synchronization , 2000 .
[7] Luca Benini,et al. Throughput Constraint for Synchronous Data Flow Graphs , 2009, CPAIOR.
[8] Sander Stuijk,et al. Throughput Analysis of Synchronous Data Flow Graphs , 2006, Sixth International Conference on Application of Concurrency to System Design (ACSD'06).
[9] Orlando Moreira,et al. Multiprocessor resource allocation for hard-real-time streaming with a dynamic job-mix , 2005, 11th IEEE Real Time and Embedded Technology and Applications Symposium.