Skip to main content
SpringerLink
Log in

Maximum number of flows in a pipeline

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

Abstract

Unconditional pipeline computers (UPC) are studied from the viewpoint of the possibility of processing independent flows of information on them. Necessary and sufficient conditions are obtained which the parameters of UPC must satisfy in order that the pipeline admit K>1 independent minimum flows. Uniqueness of these flows is proved, and an effective algorithm for finding them is set forth.

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. V. V. Voevodin, “A mathematical model of pipeline computations,” Preprint, Moscow (1982).

  2. H. T. Kung, “The structure of parallel algorithms,” in: Advances in Computers, Vol. 19, Academic Press (1980), pp. 65–112.

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

Additional information

Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 139, pp. 22–40, 1984.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Shakhbazyan, K.V., Tushkina, T.A. Maximum number of flows in a pipeline. J Math Sci 36, 185–198 (1987). https://doi.org/10.1007/BF01091799

Download citation

  • Issue Date:

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

Keywords

Search

Navigation