Efficient SAT-based mapping and scheduling of homogeneous synchronous dataflow graphs for throughput optimization

Proceedings - Real-Time Systems Symposium

Volumn , Issue , 2008, Pages 492-504

  Liu, Weichen ^a   Yuan, Mingxuan ^a   He, Xiuqiang ^a   Gu, Zonghua ^a   Liu, Xue ^b  

^a HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

^b MCGILL UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; DATA FLOW ANALYSIS; EMBEDDED SOFTWARE; EMBEDDED SYSTEMS; INTEGRATED CIRCUIT DESIGN; INTEGRATED CONTROL; INTERACTIVE COMPUTER SYSTEMS; MAPPING; MULTIPROCESSING SYSTEMS; SCHEDULING; THROUGHPUT;

BRANCH AND BOUND SEARCH; LOGIC-BASED BENDERS DECOMPOSITIONS; MULTI PROCESSOR SYSTEMS; MULTI-PROCESSOR PLATFORMS; OPTIMIZATION APPROACH; PERFORMANCE EVALUATIONS; SYNCHRONOUS DATAFLOW GRAPHS; THROUGHPUT OPTIMIZATION;

REAL TIME SYSTEMS;

EID: 67249149001     PISSN: 10528725     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/RTSS.2008.49     Document Type: Conference Paper

References (24)

1. S. Sriram and S. S. Bhattacharyya, Embedded Multiprocessors: Scheduling and Synchronization. Marcel Dekker, 2000.
2. K. K. Parhi and D. G. Messerschmitt, "Static rate-optimal scheduling of iterative data-flow programs via optimum unfolding," IEEE Trans. Computers, vol.40, no. 2, pp. 178- 195, 1991.
3. S. Stuijk, M. Geilen, and T. Basten, "Exploring tradeoffs in buffer requirements and throughput constraints for synchronous dataflow graphs," in DAC, E. Sentovich, Ed. ACM, 2006, pp. 899-904.
4. S. Stuijk, T. Basten, M. Geilen, and H. Corporaal, "Multiprocessor resource allocation for throughput-constrained synchronous dataflow graphs," in DAC, 2007, pp. 777-782. (Pubitemid 47130070)
5. S. Stuijk, "Predictable mapping of streaming applications on multiprocessors," Ph.D. dissertation, Technical University of Eindhoven, 2007.
6. A. Dasdan and R. K. Gupta, "Faster maximum and minimum mean cycle algorithms for system-performance analysis," IEEE Trans. on CAD of Integrated Circuits and Systems, vol.17, no. 10, pp. 889-899, 1998. (Pubitemid 128744880)
7. Model-Driven Architecture (MDA), url=http://www.omg.org.
8. M. Wiggers, M. Bekooij, P. G. Jansen, and G. J. M. Smit, "Efficient computation of buffer capacities for multi-rate real-time systems with back-pressure," in CODES+ISSS, R. A. Bergamaschi and K. Choi, Eds. ACM, 2006, pp. 10-15.
9. S. Sriram and E. A. Lee, "Determining the order of processor transactions in statically scheduled multiprocessors," VLSI Signal Processing, vol.15, no. 3, pp. 207-220, 1997. (Pubitemid 127508705)
10. O. Moreira, F. Valente, and M. Bekooij, "Scheduling multiple independent hard-real-time jobs on a heterogeneous multiprocessor," in EMSOFT, C. M. Kirsch and R.Wilhelm, Eds. ACM, 2007, pp. 57-66. (Pubitemid 351203884)
11. F. Heras, J. Larrosa, and A. Oliveras, "MiniMaxSat: An efficient Weighted Max-SAT solver," Journal of Artificial Intelligence Research, 2008.
12. N. Éen and N. Sörensson, "An Extensible SAT-solver," in SAT, ser. Lecture Notes in Computer Science, E. Giunchiglia and A. Tacchella, Eds., vol.2919. Springer, 2003, pp. 502-518.
13. J. N. Hooker and H. Yan, "Logic circuit verification by benders decomposition," Principles and Practice of Constraint Programming: The Newport Papers, p. 267C288, 1995.
14. N. Satish, K. Ravindran, and K. Keutzer, "A decompositionbased constraint optimization approach for statically scheduling task graphs with communication delays to multiprocessors." in DATE, R. Lauwereins and J. Madsen, Eds. ACM, 2007, pp. 57-62. (Pubitemid 47333930)
15. H. M. Sheini and K. A. Sakallah, "From propositional satisfiability to satisfiability modulo theories," in SAT, ser. Lecture Notes in Computer Science, A. Biere and C. P. Gomes, Eds., vol.4121. Springer, 2006, pp. 1-9. (Pubitemid 44531737)
16. 3: SDF For Free," in Application of Concurrency to System Design, 6th International Conference, ACSD 2006, Proceedings. IEEE Computer Society Press, Los Alamitos, CA, USA, June 2006, pp. 276-278. [Online]. Available: *http://www.es.ele. tue.nl/sdf3
17. A. Metzner and C. Herde, "RTSAT- An Optimal and Efficient Approach to the Task Allocation Problem in Distributed Architectures." in RTSS. IEEE Computer Society, 2006, pp. 147-158.
18. R. Govindarajan, E. R. Altman, and G. R. Gao, "A framework for resource-constrained rate-optimal software pipelining," IEEE Trans. Parallel Distrib. Syst., vol.7, no. 11, pp. 1133-1149, 1996. (Pubitemid 126780469)
19. R. Govindarajan, G. R. Gao, and P. Desai, "Minimizing buffer requirements under rate-optimal schedule in regular dataflow networks," VLSI Signal rocessing, vol.31, no. 3, pp. 207-229, 2002. (Pubitemid 34721087)
20. M. B. Arno Moonen and J. van Meerbergen, "Timing analysis model for network based multiprocessor systems," in Proc. PROGRESS Symposium on Embedded Systems, 2004.
21. P. Poplavko, T. Basten, M. Bekooij, J. L. van Meerbergen, and B. Mesman, "Task-level timing models for guaranteed performance in multiprocessor networks-on-chip," in CASES, J. H. Moreno, P. K. Murthy, T. M. Conte, and P. Faraboschi, Eds. ACM, 2003, pp. 63-72.
22. M. Khandelia, N. K. Bambha, and S. S. Bhattacharyya, "Contention- conscious transaction ordering in multiprocessor dsp systems," IEEE Transactions on Signal Processing, vol.54, no. 2, pp. 556-569, 2006. (Pubitemid 43141903)
23. J. L. Pino and E. A. Lee, "Hierarchical static scheduling of dataflow graphs onto multiple processors," in ICASSP, 1995, pp. 2643-2646.
24. V. Kianzad and S. S. Bhattacharyya, "Efficient techniques for clustering and scheduling onto embedded multiprocessors," IEEE Trans. Parallel Distrib. Syst., vol.17, no. 7, pp. 667-680, 2006. (Pubitemid 43997189)