Speedup for Multi-Level Parallel Computing

This paper studies the speedup for multi-level parallel computing. Two models of parallel speedup are considered, namely, fixed-size speedup and fixed-time speedup. Based on these two models, we start with the speedup formulation that takes into account uneven allocation and communication latency, a...

Full description

Saved in:
Bibliographic Details
Published in:2012 26th IEEE International Parallel and Distributed Processing Symposium Workshops pp. 537 - 546
Main Authors: Shanjiang Tang, Bu-Sung Lee, Bingsheng He
Format: Conference Proceeding
Language:English
Published: IEEE 01.05.2012
Subjects:
Abstracts
Computational modeling
E-Amdahl's Law
E-Gustafsons Law
Hardware
Multi-Level Parallel Computing
Optimization
Parallel processing
Programming
Resource management
ISBN:1467309745, 9781467309745
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper studies the speedup for multi-level parallel computing. Two models of parallel speedup are considered, namely, fixed-size speedup and fixed-time speedup. Based on these two models, we start with the speedup formulation that takes into account uneven allocation and communication latency, and gives an accurate estimation. Next, we propose a high-level abstract case with providing a global view of possible performance enhancement, namely E-Amdahl's Law for fixed-size speedup and E-Gustafson's Law for fixed-time speedup. These two laws demonstrate seemingly opposing views about the speedup of multi-level parallel computing. Our study illustrates that they are not contradictory but unified and complementary. The results lead to a better understanding in the performance and scalability of multi-level parallel computing. The experimental results show that E-Amdahl's Law can be applied as a prediction model as well as a guide for the performance optimization in multi-level parallel computing.
ISBN:1467309745
9781467309745
DOI:10.1109/IPDPSW.2012.72