Skip to main content
Springer Nature Link
Log in

Planning of Parallel Abstract Programs as Boolean Satisfiability

  • Conference paper
Parallel Computing Technologies (PaCT 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3606))

Included in the following conference series:

  • 509 Accesses

Abstract

In this paper, 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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Valkovskii, V., Malyshkin, V.: Parallel Programs and Systems Synthesis on the basis of Computational Models. Nauka, Novosibirsk, 129 (1988)

    Google Scholar 

  2. Oparin, G.A., Feoktistov, A.G.: Instrumental’naya raspredelennaya vychislitel’naya SATURN-sreda. Program. Prod. Sist. 2, 27–30 (2002) (in Russian)

    Google Scholar 

  3. Kautz, H., Selman, B.: Planning as Satisfiability. In: Proceedings of the 10th European Conference on Artificial Intelligence (ECAI), pp. 359–363 (1992)

    Google Scholar 

  4. Oparin, G.A., Bogdanova, V.G.: Algoritmy resheniya bol’shikh razrezhennykh sistem bulevykh uravnenii. Metody optimizatsii i ikh prilozheniya: Tr. 12-i Baikal’skoi mezhdunar. konf. Sektsiya 5. Diskretnaya matematika. IGU, Irkutsk, pp. 114–118 (2001) (in Russian)

    Google Scholar 

  5. Simon, L.: The experimentation web site around the satisfiability problem, http://www.lri.fr/~simon/satex/satex.php3

  6. Prestwich, S., Bressan, S.: A SAT Approach to Query Optimization in Mediator Systems. In: Proceedings of the Fifth International Symposium on the Theory and Applications of Satisfiability Testing, University of Cincinnati, pp. 252–259 (2002)

    Google Scholar 

  7. Oparin, G.A., Novopashin, A.P.: Boolevo modelirovanie planirovaniya deystvii v raspedelennykh vychislitel’nykh systemakh. Izvestia RAN, Teoria i systemy upravleniya (5), 105–108 (2004) (in Russian)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Systems Dynamics and Control Theory, Siberian Branch of Russian Academy of Sciences, 134, Lermontov st., 664033, Irkutsk, Russia

    Gennady A. Oparin & Alexei P. Novopashin

Authors
  1. Gennady A. Oparin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Alexei P. Novopashin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Novosibirsk State Technical University,  

    Victor Malyshkin

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Oparin, G.A., Novopashin, A.P. (2005). Planning of Parallel Abstract Programs as Boolean Satisfiability. In: Malyshkin, V. (eds) Parallel Computing Technologies. PaCT 2005. Lecture Notes in Computer Science, vol 3606. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11535294_18

Download citation

  • DOI: https://doi.org/10.1007/11535294_18

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-28126-9

  • Online ISBN: 978-3-540-31826-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics