This article is cited in 2 papers

Computer-Aided Design and Programming

Boolean models and planning methods for parallel abstract programs

G. A. Oparin, A. P. Novopashin

Institute of System Dynamics and Control Theory, Siberian Branch, Russian Academy of Sciences, Irkutsk, Russia

Abstract: For the parallel computer systems, a new formulation of the problem of constructing parallel asynchronous abstract programs of the desired length was proposed. The conditions for the problem of planning were represented as a system of Boolean equations (constraints) whose solutions define the feasible plans for activation of the program modules specified in the planner's knowledge base. The constraints on the number of processors and time delays arising at execution of the program modules were taken into consideration.

PACS: 89.20.Ff

Presented by the member of Editorial Board: V. V. Kul'ba

Received: 15.12.2006

 English version: Automation and Remote Control, 2008, 69:8, 1423–1432

Bibliographic databases:

• 
• 
• 
•