Abstract
An algorithm based on the construction of a spanning subgraph of the pipeline is proposed for determining streams in pipelines.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Literature cited
V. V. Voevodin, A Mathematical Model of Pipelined Computations [in Russian], Preprint No. 42, OVM AN SSSR, Moscow (1982).
K. V. Shakhbazyan and T. A. Tushkina, “On the maximum number of streams in a pipeline,” in: Numerical Methods and Topics of Organization of Computations, No. 7, J. Sov. Math.,36, No. 2 (1987).
V. V. Voevodin, Mathematical Models in Parallel Processes [in Russian], Moscow (1986).
E. E. Tyrtyshnikov, “On pipelined computations,” in: Computer Architecture and Numerical Methods [in Russian], OVM AN SSSR, Moscow (1983), pp. 4–10.
A. Aho, J. Hopcroft, and J. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, Mass. (1974).
Additional information
Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 159, pp. 40–46, 1987.
Rights and permissions
About this article
Cite this article
Shakhbazyan, K.V., Tushkina, T.A. & Lebedinskii, M.M. A spanning-tree algorithm for constructing streams in pipelines. J Math Sci 47, 2848–2853 (1989). https://doi.org/10.1007/BF01305213
Issue Date:
DOI: https://doi.org/10.1007/BF01305213