Simple, list-based parallel programming with transparent load balancing

Authors:
Jorge Buenabad-Chávez;Miguel A. Castro-García;Graciela Román-Alonso
Affiliations:
Sección de Computación, Centro de Investigación y de Estudios Avanzados del IPN, D.F., México;Sección de Computación, Centro de Investigación y de Estudios Avanzados del IPN, D.F., México;Departamento de Ing. Eléctrica, Universidad Autónoma Metropolitana, Izt., D.F., México
Venue:
PPAM'05 Proceedings of the 6th international conference on Parallel Processing and Applied Mathematics
Year:
2005

Citing 6
Cited 0

Algorithmic skeletons: structured management of parallel computation

Algorithmic skeletons: structured management of parallel computation
PVM: Parallel virtual machine: a users' guide and tutorial for networked parallel computing

PVM: Parallel virtual machine: a users' guide and tutorial for networked parallel computing
TreadMarks: Shared Memory Computing on Networks of Workstations

Computer
Models and languages for parallel computation

ACM Computing Surveys (CSUR)
Toward a model for shared data abstraction with performance

Journal of Parallel and Distributed Computing - Parallel and distributed data structures
MPI-The Complete Reference, Volume 1: The MPI Core

MPI-The Complete Reference, Volume 1: The MPI Core

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a data-list management library that both simplifies parallel programming and balances the workload transparently to the programmer. We present its use with an application that dynamically generates data, such as those based on searching trees. Under these applications, processing data can unpredictably generate new data to process. Without load balancing, these applications are most likely to imbalance the workload across processing nodes resulting in poor performance. We present experimental results on the performance of our library using a Linux PC cluster.