Skip to main content
SpringerLink
Log in

Algorithm for compiling optimal schedule for parallel-sequential networks

  • Published:
Journal of Soviet Mathematics Aims and scope Submit manuscript

Abstract

An algorithm is described for compiling an optimal schedule for a computational process simulated by a parallel-sequential network, and also for a homogeneous computational system.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Literature cited

  1. F. Harary, “Combinatorial problems of enumeration of graphs,” in: Applied Combinatorial Mathematics [Russian translation], Moscow (1968).

  2. V. E. Kotov, “Theory of parallel programming,” Kibernetika, No. 1 (1974).

Download references

Authors
  1. K. V. Shakhbazyan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. T. A. Tushkina
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. N. B. Lebedinskaya
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 48, pp. 200–204, 1974.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Shakhbazyan, K.V., Tushkina, T.A. & Lebedinskaya, N.B. Algorithm for compiling optimal schedule for parallel-sequential networks. J Math Sci 10, 796–799 (1978). https://doi.org/10.1007/BF01083970

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01083970

Keywords

Search

Navigation