Maximum number of flows in a pipeline

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.