×

Boolean models and planning methods for parallel abstract programs. (English. Russian original) Zbl 1167.68356

Autom. Remote Control 69, No. 8, 1423-1432 (2008); translation from Avtom. Telemekh. 2008, No. 8, 166-175 (2008).
Summary: For parallel computer systems, a new formulation of the problem of constructing parallel asynchronous abstract programs of the desired length proposed. The conditions for the problem of planning are 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 are taken into consideration.

MSC:

68N19 Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.)
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Plaks, T.P., Design of Parallel Programs on Computer Models, Programmirovanie, 1977, no. 4, pp. 55–63.
[2] Val’kovskii, V.A. and Malyshkin, V.E., Sintez parallel’nykh programm i sistem na vychislitel’nykh modelyakh (Design of Parallel Programs and Systems of Computer Models), Novosibirsk: Nauka, 1988. · Zbl 0714.68030
[3] Oparin, G.A. and Feoktistov, A.G., Distributed Instrumental Computing SATURN-medium, Progr. Produkty Sist., 2002, no. 2, pp. 27–30.
[4] Kautz, H. and Selman, B., Planning as Satisfiability, Proc. 10 Eur. Conf. Artificial Intelligence (ECAI), 1992, pp. 359–363.
[5] Voevodin, V.V. and Voevodin, Vl.V., Parallel’nye vychisleniya (Parallel Computations), St. Petersburg: BKHV-Peterburg, 2002.
[6] Oparin, G.A. and Bogdanova, V.G., Algorithms to Solve Large Sparse Systems of Boolean Equations, in Methods of Optimization and Their Applications, Proc. 12 Baikal Int. Conf., Irkutsk: IGU, 2001, pp. 114–118.
[7] The Sat-Ex Site ( http://www.lri.fr/ simon/satex/satex.php3 ).
[8] Toporkov, V.V., Modeli raspredelennykh vychislenii (Models of Distributed Computations), Moscow: Fizmatlit, 2004. · Zbl 1078.68010
[9] Barskii, A.B., Parallel’nye protsessy v vychislitel’nykh sistemakh. Planirovanie i organizatsiya (Parallel Processes in Computer Systems. Planning and Organization), Moscow: Radio i Svyaz’, 1990.
[10] Bartak, R., On Modeling Planning and Scheduling Problems with Time and Resources, Proc. 21 Workshop UK Planning and Scheduling Special Interest Group (PLANSIG), 2002, pp. 87–98.
[11] Prestwich, S. and Bressan, S., A SAT Approach to Query Optimization in Mediator Systems, Proc. 5 Int. Symp. Theory Appl. Satisfiability Testing, Cincinnati, 2002, pp. 252–259. · Zbl 1099.68103
[12] Oparin, G.A. and Novopashin, A.P., Boolean Modeling of Action Planning in Distributed Computer Systems, Izv. Ross. Akad. Nauk, Teor. Sist. Upravlen., 2004, no. 5, pp. 105–108.
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.