Pipelined Decomposable BSP Computers

Author: Beran Martin  

Publisher: Edp Sciences

E-ISSN: 1290-385x|36|1|43-65

ISSN: 0988-3754

Source: RAIRO - Theoretical Informatics and Applications, Vol.36, Iss.1, 2010-03, pp. : 43-65

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

The class of weak parallel machines is interesting, because it contains somerealistic parallel machine models, especially suitable for pipelinedcomputations. We prove that a modification of the bulk synchronous parallel(BSP) machine model, called decomposable BSP (dBSP), belongs to the class ofweak parallel machines if restricted properly. We will also correct someearlier results about pipelined parallel Turing machines.