Abstract
The operation of a pipeline is considered as a special graph (the unfolding) associated to the pipeline graph. We investigate the decomposition of the unfolding, a particular case of which is its decomposition into minimal independent streams.
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).
E. E. Tyrtyshnikov, “On pipelined computations,” in: Computer Architecture and Numerical Methods [in Russian], OVM AN SSSR, Moscow (1983), pp. 4–10.
V. V. Voevodin, Mathematical Models in Parallel Processes [in Russian], Moscow (1986).
K. V. Shakhbazyan, T. A. Tushkina, and M. M. Lebedinskii, “A spanning-tree algorithm for constructing streams in pipelines,” this volume.
Additional information
Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 159, pp. 47–55, 1987.
Rights and permissions
About this article
Cite this article
Shakhbazyan, K.V., Tushkina, T.A. & Lebedinskii, M.M. Decomposition in pipelines. J Math Sci 47, 2854–2860 (1989). https://doi.org/10.1007/BF01305214
Issue Date:
DOI: https://doi.org/10.1007/BF01305214