Performance analysis of dynamic load balancing algorithms with variable number of processors

Authors:
Saeed Iqbal;Graham F. Carey
Affiliations:
Department of Electrical and Computer Engineering, University of Texas at Austin, Austin, TX 78712-1085, USA;ICES, University of Texas at Austin, Austin, Texas, USA
Venue:
Journal of Parallel and Distributed Computing
Year:
2005

Citing 21
Cited 3

Characterizations of parallelism in applications and their use in scheduling

SIGMETRICS '89 Proceedings of the 1989 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Semi-Distributed Load Balancing for Massively Parallel Multicomputer Systems

IEEE Transactions on Software Engineering
On Parallel Processing Systems: Amdahl's Law Generalized and Some Results on Optimal Design

IEEE Transactions on Software Engineering
Models of machines and computation for mapping in multicomputers

ACM Computing Surveys (CSUR)
Utopia: a load sharing facility for large, heterogeneous distributed computer systems

Software—Practice & Experience
Performance and scalability of finite element analysis for distributed parallel computation

Journal of Parallel and Distributed Computing
A high-performance, portable implementation of the MPI message passing interface standard

Parallel Computing
A scalable loading balancing system for NOWs

ACM SIGOPS Operating Systems Review
Design of dynamic load-balancing tools for parallel applications

Proceedings of the 14th international conference on Supercomputing
A 3D refinement/derefinement algorithm for solving evolution problems

Applied Numerical Mathematics - Special issue on numerical grid generation-technologies for advanced simulations
Parallel tetrahedral mesh adaptation with dynamic load balancing

Parallel Computing - Special issue on graph partioning and parallel computing
Simple data management, scheduling and solution strategies for managing the irregularities in parallel adaptive hp finite element simulations

Parallel Computing - special issue on parallel computing for irregular applications
Optimal Task Assignment in Heterogeneous Distributed Computing Systems

IEEE Concurrency
Sensitivity Evaluation of Dynamic Load Sharing in Distributed Systems

IEEE Concurrency
A Practical Approach to Dynamic Load Balancing

IEEE Transactions on Parallel and Distributed Systems
A novel dynamic load balancing scheme for parallel systems

Journal of Parallel and Distributed Computing
On Job Scheduling for HPC-Clusters and the dynP Scheduler

HiPC '01 Proceedings of the 8th International Conference on High Performance Computing
Graph Partitioning and Parallel Solvers: Has the Emperor No Clother? (Extended Abstract)

IRREGULAR '98 Proceedings of the 5th International Symposium on Solving Irregularly Structured Problems in Parallel
A hierarchical adaptive distributed algorithm for load balancing

Journal of Parallel and Distributed Computing
Faucets: Efficient Resource Allocation on the Computational Grid

ICPP '04 Proceedings of the 2004 International Conference on Parallel Processing
On the Mapping Problem

IEEE Transactions on Computers

Modular hp-FEM system HERMES and its application to Maxwell's equations

Mathematics and Computers in Simulation
A hybrid load balancing strategy of sequential tasks for grid computing environments

Future Generation Computer Systems
The architecture of SOA-oriented urban spatial information sharing platform

IITA'09 Proceedings of the 3rd international conference on Intelligent information technology application

Quantified Score

Hi-index	0.00

Visualization

Abstract

In modern parallel adaptive mesh computations the problem size varies during simulation. In this study we investigate the comparative behavior of four load balancing algorithms when the number of processors is dynamically changed during the lifetime of a multistage parallel computation. The focus is on communication and data movement overheads, total parallel runtime and total resource consumption. We demonstrate the main ideas for the case of six adaptive mesh refinement (AMR) applications with different kinds of growth patterns. The results presented are for a 32 processor Intel cluster connected by Ethernet.