Answer Set versus Integer Linear Programming for Automatic Synthesis of Multiprocessor Systems from Real‐Time Parallel Programs

Abstract

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 architectures for IEEE 802.11g and WCDMA baseband signal processing are synthesized. ASP-based synthesis used a few seconds in the solver, faster by three orders of magnitude compared to ILP-based synthesis, thereby showing a great potential for solving difficult instances of the automated synthesis problem.

A Novel Hybrid Methodology Applied Optimization Energy Consumption in Homogeneous Wireless Sensor Networks

“…The Generate and Solve Methodology was implemented to solve the problem in homogeneous networks [10]. However, as the network grows instances, the execution time tends to be impractical again.…”

“…To the extent that the generations are evolved, there is the possibility that the algorithm converges to a great place where the number of sensors participating chromosomes increases significantly, causing an alignment of subproblems of the original problem undermining the execution in time feasible and proper implementation of the methodology. To prevent this issue was introduced by [10] a density control operator. This operator is applied while generating reduced levels, after executing the intersection operator, replacing the mutation operator, as shown in Figure 2.…”

“…Therefore the ability of the methodology to be even closer to real network instances; they are allocated some sensor nodes greater than the amount ranges of the tested scenarios. Also, used results found in [10] for comparison. In it, the coding of chromosomes occurs differently, using a fixed number of alleles.…”

ASP-Based Encoding Model of Architecture Synthesis for Smart Cameras in Distributed Networks

“…Many comparative studies have shown the effectiveness of ASP compared to other synthesis methodologies (integer linear programming, constraint programming, or evolutionary algorithms), both for the formulation of complex problems with hundreds of variables [Coban et al 2008] and also for exploration of large design spaces of multiobjective problems [Ishebabi et al 2009a]. Moreover, ASP has already been used with satisfactory performance in various domains, including synthesis of multiprocessors [Ishebabi et al 2009b], decision problems [Nogueira et al 2000], reasoning tools in system biology [Irurozki et al 2011;Gebser et al 2011b], package configuration in Linux [Gebser et al 2011a], team building under complex constraints [Grasso et al 2010], and many more, with a detailed list and benchmark results available in Calimeri et al [2012].…”

“…However, the presented work is new and can be seen as an extension of the MPSoC synthesis problem to simultaneous resource and runtime optimization of interconnected MPSoCs in a heterogeneous network. It has been shown in Ishebabi et al [2009a] that ILP, which is the main competitor to our ASP-based approach, is not even tractable for small-sized MPSoCs, thus less likely to tackle the complex problem presented in this article.…”