RAIRO-Theor. Inf. Appl.
Volume 36, Number 1, January/March 2002
|Page(s)||43 - 65|
|Published online||15 December 2002|
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
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.