DocumentCode :
2449890
Title :
Detecting and using critical paths at runtime in message driven parallel programs
Author :
Dooley, Isaac ; Kale, Laxmikant V.
Author_Institution :
Dept. of Comput. Sci., Univ. of Illinois, Urbana, IL, USA
fYear :
2010
fDate :
19-23 April 2010
Firstpage :
1
Lastpage :
8
Abstract :
Detecting critical paths in traditional message passing parallel programs can be useful for post-mortem performance analysis. This paper presents an efficient online algorithm for detecting critical paths for message-driven parallel programs. Initial implementations of the algorithm have been created in three message-driven parallel languages: Charm++, Charisma, and Structured Dagger. Not only does this work describe a novel implementation of critical path detection for the message-driven programs, but also the resulting critical paths are successfully used as the program runs for automatic performance tuning. The actionable information provided by the critical path is shown to be useful for online performance tuning within the context of the message driven parallel model, whereas it has never been used for online purposes within the traditional message passing model.
Keywords :
message passing; parallel languages; parallel programming; Charisma; Charm++; critical path detection; message driven parallel model; message passing parallel programs; message-driven parallel languages; online algorithm; structured dagger; Computational modeling; Computer science; Concurrent computing; Context modeling; Dynamic scheduling; Message passing; Parallel programming; Processor scheduling; Programming profession; Runtime;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Parallel & Distributed Processing, Workshops and Phd Forum (IPDPSW), 2010 IEEE International Symposium on
Conference_Location :
Atlanta, GA
Print_ISBN :
978-1-4244-6533-0
Type :
conf
DOI :
10.1109/IPDPSW.2010.5470844
Filename :
5470844
Link To Document :
بازگشت