Planning of parallel abstract programs as Boolean satisfiability

Abstract

In this paper 1, a new formulation is proposed for the problem of constructing parallel abstract programs of a required length in parallel computing systems. The conditions of a planning problem are represented as a system of Boolean equations (constraints), whose solutions determine the possible plans for activating the program modules. Specifications of modules are stored in the knowledgebase of the planner. Constraint on number of processors and time delays at execution of modules are taken into account. © Springer-Verlag Berlin Heidelberg 2005.