answer set versus integer linear programming for automatic synthesis of multiprocessor systems from real-time parallel programs回答集和整数线性规划进行自动合成的多处理器系统实时并行程序.pdfVIP

Hindawi Publishing Corporation International Journal of Reconfigurable Computing Volume 2009, Article ID 863630, 11 pages doi:10.1155/2009/863630 Research Article Answer Set versus Integer Linear Programming for Automatic Synthesis of Multiprocessor Systems from Real-Time Parallel Programs Harold Ishebabi,1 Philipp Mahr,1 Christophe Bobda,1 Martin Gebser,2 and Torsten Schaub2 1 Professorship for Computer Engineering, Institute for Computer Science, University of Potsdam, August-Bebel-Strasse 89, D-14482 Potsdam, Germany 2 Professorship for Knowledge Processing and Information Systems, Institute for Computer Science, University of Potsdam, August-Bebel-Strasse 89, D-14482 Potsdam, Germany Correspondence should be addressed to Harold Ishebabi, ishebabi@cs.uni-potsdam.de Received 12 March 2009; Accepted 24 August 2009 Recommended by Lionel Torres An automated design approach for multiprocessor systems on FPGAs is presented which customizes architectures for parallel programs by simultaneously solving the problems of task mapping, resource allocation, and scheduling. The latter considers effects of fixed-priority preemptive scheduling in order to guarantee real-time requirements, hence covering a broad spectrum of embedded applications. Being inherently a combinatorial optimization problem, the design space is modeled using linear equations that capture high-level design parameters. A comparison of two methods for solving resulting problem instances is then given. The intent is to study how well recent advances in propositional satisfiability (SAT) and thus Answer Set Programming (ASP) can be exploited to automate the design of flexible multiprocessor systems. Integer Linear Programming (ILP) is taken as a baseline, where arch