Questions of decomposition in conveyor computer
Zapiski Nauchnykh Seminarov POMI, Computational methods and algorithms. Part 8, Tome 159 (1987), pp. 47-55
Voir la notice de l'article provenant de la source Math-Net.Ru
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.
@article{ZNSL_1987_159_a4,
author = {K. V. Shakhbazyan and T. A. Tushkina and M. M. Lebedinskii},
title = {Questions of decomposition in conveyor computer},
journal = {Zapiski Nauchnykh Seminarov POMI},
pages = {47--55},
publisher = {mathdoc},
volume = {159},
year = {1987},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/ZNSL_1987_159_a4/}
}
TY - JOUR AU - K. V. Shakhbazyan AU - T. A. Tushkina AU - M. M. Lebedinskii TI - Questions of decomposition in conveyor computer JO - Zapiski Nauchnykh Seminarov POMI PY - 1987 SP - 47 EP - 55 VL - 159 PB - mathdoc UR - http://geodesic.mathdoc.fr/item/ZNSL_1987_159_a4/ LA - ru ID - ZNSL_1987_159_a4 ER -
K. V. Shakhbazyan; T. A. Tushkina; M. M. Lebedinskii. Questions of decomposition in conveyor computer. Zapiski Nauchnykh Seminarov POMI, Computational methods and algorithms. Part 8, Tome 159 (1987), pp. 47-55. http://geodesic.mathdoc.fr/item/ZNSL_1987_159_a4/