Pipelined Decomposable BSP Computers

  • Authors:
  • Martin Beran

  • Affiliations:
  • -

  • Venue:
  • SOFSEM '01 Proceedings of the 28th Conference on Current Trends in Theory and Practice of Informatics Piestany: Theory and Practice of Informatics
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

Abstract

The class of weak parallel machines Cweak 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 its computational power is restricted properly. We will also correct some earlier results about pipelined parallel Turing machines, regarding their membership in the class Cweak.