Abstract
The class of weak parallel machines Cweak is interesting because it contains some realistic parallel machine models, especially suitable for pipelined computations. We prove that a modification of the bulk synchronous parallel (BSP) machine model, called decomposable BSP (dBSP), belongs to the class of weak parallel machines if its computational power is restricted properly. We will also correct some earlier results about pipelined parallel Turing machines, regarding their membership in the class Cweak.
Cite
CITATION STYLE
Beran, M. (2001). Pipelined decomposable BSP computers. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2234, pp. 171–180). Springer Verlag. https://doi.org/10.1007/3-540-45627-9_14
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
