Avtomatika i Telemekhanika
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors
Submit a manuscript

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Avtomat. i Telemekh.:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Avtomatika i Telemekhanika, 2008, Issue 8, Pages 166–175 (Mi at713)  
This article is cited in 2 scientific papers (total 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
Full-text PDF (226 kB) Citations (2)
References:
PDF
HTML
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.
Presented by the member of Editorial Board: V. V. Kul'ba

Received: 15.12.2006
English version:
Automation and Remote Control, 2008, Volume 69, Issue 8, Pages 1423–1432
DOI: https://doi.org/10.1134/S0005117908080146
Bibliographic databases:
Document Type: Article
PACS: 89.20.Ff
Language: Russian
Citation: G. A. Oparin, A. P. Novopashin, “Boolean models and planning methods for parallel abstract programs”, Avtomat. i Telemekh., 2008, no. 8, 166–175; Autom. Remote Control, 69:8 (2008), 1423–1432
Citation in format AMSBIB
\Bibitem{OpaNov08}
\by G.~A.~Oparin, A.~P.~Novopashin
\paper Boolean models and planning methods for parallel abstract programs
\jour Avtomat. i Telemekh.
\yr 2008
\issue 8
\pages 166--175
\mathnet{http://mi.mathnet.ru/at713}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=2494259}
\zmath{https://zbmath.org/?q=an:1167.68356}
\transl
\jour Autom. Remote Control
\yr 2008
\vol 69
\issue 8
\pages 1423--1432
\crossref{https://doi.org/10.1134/S0005117908080146}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000258611900014}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-50149117996}
Linking options:
  • https://www.mathnet.ru/eng/at713
  • https://www.mathnet.ru/eng/at/y2008/i8/p166
    • This publication is cited in the following 2 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Avtomatika i Telemekhanika
    Statistics & downloads:
    Abstract page:193
    Full-text PDF :66
    References:47
    First page:3
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024