|
28th Annual Conference on Current
Trends in
Theory and Practice of Informatics
|
|
November 24 - December 1, 2001
|
|
Pipelined Decomposable BSP Computers (extended abstract)
by Martin Beran
Abstract:
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.