Trace reduction for performance improvement assessment of message passing parallel programs
Author(s) -
Ino Fumihiko,
Kanbe Yuki,
Okita Masao,
Hagihara Kenichi
Publication year - 2006
Publication title -
systems and computers in japan
Language(s) - English
Resource type - Journals
eISSN - 1520-684X
pISSN - 0882-1666
DOI - 10.1002/scj.20521
Subject(s) - trace (psycholinguistics) , computer science , reduction (mathematics) , usability , execution time , order (exchange) , programming language , operating system , philosophy , linguistics , geometry , mathematics , finance , economics
This paper proposes a trace reduction method for assessing the improvability of the performance of message passing parallel programs. This assessment is based on a what‐if prediction approach that forecasts future program performance, for example, the execution time if the target program is modified according to typical tuning techniques. Our method reduces the size of trace files by aggregating records of communications that do not change the predicted execution time. In order to avoid recording such useless information, our method automatically identifies them during program execution by comparing the occurrence time of sends and receives. In case studies, our method reduces the analysis time for what‐if predictions as well as the size of trace files roughly by half. We also discuss the usability of our method. © 2006 Wiley Periodicals, Inc. Syst Comp Jpn, 37(5): 1–13, 2006; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/scj.20521
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom