dc.contributor.authorTang, Shanjiang
dc.contributor.authorLee, Bu-Sung
dc.contributor.authorHe, Bingsheng
dc.date.accessioned2013-08-01T02:24:21Z
dc.date.available2013-08-01T02:24:21Z
dc.date.copyright2012en_US
dc.date.issued2012
dc.identifier.citationTang, 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.en_US
dc.identifier.urihttp://hdl.handle.net/10220/12711
dc.description.abstractThis 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.en_US
dc.language.isoenen_US
dc.subjectDRNTU::Engineering::Computer science and engineering
dc.titleSpeedup for multi-level parallel computingen_US
dc.typeConference Paper
dc.contributor.conferenceIEEE International Parallel and Distributed Processing Symposium Workshops (26th : 2012 : Shanghai, China)en_US
dc.contributor.schoolSchool of Computer Engineeringen_US
dc.identifier.doihttp://dx.doi.org/10.1109/IPDPSW.2012.72


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record