Please use this identifier to cite or link to this item:
|Title:||Speedup for multi-level parallel computing||Authors:||Tang, Shanjiang
|Keywords:||DRNTU::Engineering::Computer science and engineering||Issue Date:||2012||Source:||Tang, S., Lee, B.-S., & He, B. (2012). Speedup for Multi-Level Parallel Computing. 2012 IEEE 26th International Parallel and Distributed Processing Symposium Workshops & PhD Forum, 537-546.||Abstract:||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.||URI:||https://hdl.handle.net/10356/98954
|DOI:||http://dx.doi.org/10.1109/IPDPSW.2012.72||Fulltext Permission:||none||Fulltext Availability:||No Fulltext|
|Appears in Collections:||SCSE Conference Papers|
Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.