|
Zapiski Nauchnykh Seminarov LOMI, 1984, Volume 139, Pages 22–40
(Mi znsl1734)
|
|
|
|
Maximum number of flows in a pipeline
K. V. Shakhbazyan, T. A. Tushkina
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.
Citation:
K. V. Shakhbazyan, T. A. Tushkina, “Maximum number of flows in a pipeline”, Computational methods and algorithms. Part VII, Zap. Nauchn. Sem. LOMI, 139, "Nauka", Leningrad. Otdel., Leningrad, 1984, 22–40; J. Soviet Math., 36:2 (1987), 185–198
Linking options:
https://www.mathnet.ru/eng/znsl1734 https://www.mathnet.ru/eng/znsl/v139/p22
|
Statistics & downloads: |
Abstract page: | 102 | Full-text PDF : | 37 |
|