Analytical study of the "master-worker" framework scalability on multiprocessors with distributed memory

TL;DR

This paper introduces the BSF model for analyzing the scalability of master-worker frameworks on distributed memory multiprocessors, providing formulas for efficiency and bounds.

Contribution

It proposes the BSF parallel computation model based on BSP and SPMD, specifically for compute-intensive applications on distributed memory systems.

Findings

Derived upper scalability bounds for BSF programs

Developed formulas for estimating parallel efficiency

Analyzed the architecture of BSF-computer and program structure

Abstract

The paper is devoted to an analytical study of the "master-worker" framework scalability on multiprocessors with distributed memory. A new model of parallel computations called BSF is proposed. The BSF model is based on BSP and SPMD models. The scope of BSF model is the compute-intensive applications. The architecture of BSF-computer is defined. The structure of BSF-program is described. The Using this metric, the upper scalability bounds of BSF programs on distributed memory multiprocessors are evaluated. The formulas for estimating the parallel efficiency of BSF programs also proposed.