The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.08 - August (2011 vol.22)
pp: 1382-1389
Zonghua Gu , Zhejiang University, Hangzhou
Jiang Xu , Hong Kong University of Scicence and Technology, Hong Kong
Xiaowen Wu , Hong Kong University of Science and Technology, Hong Kong
Yaoyao Ye , Hong Kong University of Science and Technology, Hong Kong
ABSTRACT
Task graph scheduling on multiprocessor systems is a representative multiprocessor scheduling problem. A solution to this problem consists of the mapping of tasks to processors and the scheduling of tasks on each processor. Optimal solution can be obtained by exploring the entire design space of all possible mapping and scheduling choices. Since the problem is NP-hard, scalability becomes the main concern in solving the problem optimally. In this paper, a SAT-based optimization framework is proposed to address this problem, in which SAT solver is enhanced by integrating with a scheduling analysis tool in a branch and bound manner to prune the solution space efficiently. Performance evaluation results show that our technique has average performance improvement in more than an order of magnitude compared to state-of-the-art techniques. We further build a cycle-accurate network-on-chip simulator based on SystemC to verify the effectiveness of the proposed technique on realistic multiprocessor systems.
INDEX TERMS
Multiprocessor, scheduling, design space exploration, satisfiability.
CITATION
Zonghua Gu, Jiang Xu, Xiaowen Wu, Yaoyao Ye, "Satisfiability Modulo Graph Theory for Task Mapping and Scheduling on Multiprocessor Systems", IEEE Transactions on Parallel & Distributed Systems, vol.22, no. 8, pp. 1382-1389, August 2011, doi:10.1109/TPDS.2010.204
REFERENCES
[1] M. Davis and H. Putnam, "A Computing Procedure for Quantification Theory," J. ACM, vol. 7, no. 3, pp. 201-215, 1960.
[2] M. Davis, G. Logemann, and D. Loveland, "A Machine Program for Theorem-Proving," J. Comm. ACM, vol. 5, no. 7, pp. 394-397, 1962.
[3] N. Satish, K. Ravindran, and K. Keutzer, "A Decomposition-Based Constraint Optimization Approach for Statically Scheduling Task Graphs with Communication Delays to Multiprocessors," Proc. Conf. Design, Automation and Test in Europe (DATE '07), pp. 57-62, 2007.
[4] Y. Kwok and I. Ahmad, "Benchmarking the Task Graph Scheduling Algorithms," Proc. Int'l Parallel Processing Symp., pp. 0531-0537, 1998.
[5] Y.-K. Kwok and I. Ahmad, "Static Scheduling Algorithms for Allocating Directed Task Graphs to Multiprocessors," ACM Computer Survey, vol. 31, no. 4, pp. 406-471, 1999.
[6] K. Keutzer, K. Ravindran, N. Satish, and Y. Jin, "An Automated Exploration Framework for Fpga-Based Soft Multiprocessor Systems," Proc. Hardware/Software Codesign and System Synthesis, CODES+ISSS '05, Third IEEE/ACM/IFIP Int'l Conf., pp. 273-278, Sept. 2005.
[7] J.N. Hooker, "Logic-Based Benders Decomposition," Math. Programming, vol. 96, pp. 33-60, 2003.
[8] G.C. Sih and E.A. Lee, "A Compile-Time Scheduling Heuristic for Interconnection-Constrained Heterogeneous Processor Architectures," IEEE Trans. Parallel Distributed Systems, vol. 4, no. 2, pp. 175-187, Feb. 1993.
[9] T. Davidović and T.G. Crainic, "Benchmark-Problem Instances for Static Scheduling of Task Graphs with Communication Delays on Homogeneous Multiprocessor Systems," Computers Operations Research, vol. 33, no. 8, pp. 2155-2177, 2006.
[10] A. Metzner and C. Herde, "Rtsat—An Optimal and Efficient Approach to the Task Allocation Problem in Distributed Architectures," Proc. 27th IEEE Int'l Real-Time Systems Symp. (RTSS '06), pp. 147-158, 2006.
[11] W. Liu, M. Yuan, X. He, Z. Gu, and X. Liu, "Efficient Sat-Based Mapping and Scheduling of Homogeneous Synchronous Dataflow Graphs for Throughput Optimization," Proc. Real-Time Systems Symp. (RTSS '08), pp. 492-504, 2008.
[12] D. Gracanin, S.A. Bohner, and M. Hinchey, "Towards a Model-Driven Architecture for Autonomic Systems," Proc. IEEE Int'l Conf. Eng. of Computer-Based Systems, p. 500, 2004.
[13] N. Eén and N. Sörensson, "An Extensible Sat-Solver," SAT, E. Giunchiglia and A. Tacchella, eds., pp. 502-518, Springer, 2003.
[14] H.M. Sheini and K.A. Sakallah, "From Propositional Satisfiability to Satisfiability Modulo Theories," Theory and Applications of Satisfiability Testing—SAT '06, pp. 1-9, Springer, 2006.
[15] L. Benini and G. De Micheli, "Networks on Chips: A New Soc Paradigm," Computer, vol. 35, no. 1, pp. 70-78, Jan. 2002.
[16] R.P. Dick, D.L. Rhodes, and W. Wolf, "Tgff: Task Graphs for Free," Proc. CODES/CASHE '98: Sixth Int'l Workshop Hardware/Software Codesign, pp. 97-101, 1998.
[17] J. Xu, W. Wolf, and W. Zhang, "Double-Data-Rate, Wave-Pipelined Interconnect for Asynchronous Nocs," IEEE Micro, vol. 29, no. 3, pp. 20-30, May/June 2009.
[18] J. Chong, N. Satish, B. Catanzaro, K. Ravindran, and K. Keutzer, "Efficient Parallelization of H.264 Decoding with Macro Block Level Scheduling," Proc. IEEE Int'l Conf. Multimedia and Expo, pp. 1874-1877, July 2007.
38 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool