Maximum number of flows in a pipeline

DOI10.1007/BF01091799MaRDI QIDQ1819933zbMATH OpenFDO

Authors K. V. Shakhbazyan, T. A. Tushkina

Publication date 1987

Published in Journal of Soviet Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01091799

zbMATH Keywords

conveyerindependent data flowsminimal flows of informationunconditional pipeline computations

Mathematics Subject Classification ID

Theory of computing (68Q99)

Review text

Translation from Zap. Nauchn. Semin. Leningr. Otd. Mat. Inst. Steklova 139, 22-40 (Russian) (1984; Zbl 0589.68041).

Cited in

(1)

• A spanning-tree algorithm for constructing streams in pipelines

This page was built for publication: Maximum number of flows in a pipeline

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1819933)