2D-data Partition on the HBSP Model

T. Ishimizu and M. Higuchi (Japan)

Keywords

HBSP model, 2Ddata, Matrix Multiplication

Abstract

The HBSP(Heterogeneous Bulk-Synchronous Parallel) model is an asynchronous parallel computing model, whose communication features are abstracted by some pa rameters. In this paper, we present parallel algorithms for the 2D-data partition on the HBSP model, and we also present a method converting the BSP algorithms pro cessing with 2D-data into the HBSP algorithms. Using our converting method, some BSP algorithms such as matrix multiplication or all-pairs shortest paths can be converted into efficient HBSP algorithms.

Important Links:



Go Back