Pipelined Decomposable BSP Computers
Faculty of Mathematics and Physics,
Charles University, Malostranské nám. 25, 118 00 Praha 1, Czech Republic; email@example.com.
Accepted: 26 June 2002
The class of weak parallel machines 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 restricted properly. We will also correct some earlier results about pipelined parallel Turing machines.
Mathematics Subject Classification: 68Q05 / 68Q10
Key words: BSP / complexity theory / models of compuation / parallel computing / pipelining.
© EDP Sciences, 2002