Pipelined Decomposable BSP Computers

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.

• Type: Conference
• Year: 2001
• Where: SOFSEM
• Authors: Martin Beran
• Keywords: Bulk Synchronous Parallel, Parallel Machine Models, SOFSEM 2001, Theoretical Computer Science, Weak Parallel Machines