TY - JOUR
T1 - Parallelized direct execution simulation of message-passing parallel programs
AU - Dickens, Phillip M.
AU - Heidelberger, Philip
AU - Nicol, David M.
N1 - Funding Information:
We are gr‘iteful to Jeff Earickson of Intel Supercomputers for his generous assistance in helping us to better understand the Intel Paragon system. This research was supported by NASA Contract No. NAS1-19480, while the authors were in residence at the Institute for Computer Applications in Science and Engineering (ICASE), NASA Langley Research Center, Hampton, Virginia. Philip Hei-delberger and David M. Nicol’s work was performed while they were on sabbatical at ICASE. David M. Nicol was also supported, in part, by the National Science Foundation under Grant No. CCR-9201195.
PY - 1996
Y1 - 1996
N2 - As massively parallel computers proliferate, there is growing interest in finding ways by which performance of massively parallel codes can be efficiently predicted. This problem arises in diverse contexts such as parallelizing compilers, parallel performance monitoring, and parallel algorithm development. In this paper, we describe one solution where one directly executes the application code, but uses a discrete-event simulator to model details of the presumed parallel machine, such as operating system and communication network behavior. Because this approach is computationally expensive, we are interested in its own parallelization, specifically the parallelization of the discrete-event simulator. We describe methods suitable for parallelized direct execution simulation of message-passing parallel programs, and report on the performance of such a system, LAPSE (Large Application Parallel Simulation Environment), we have built on the Intel Paragon. On all codes measured to date, LAPSE predicts performance well, typically within 10% relative error. Depending on the nature of the application code, we have observed low slowdowns (relative to natively executing code) and high relative speedups using up to 64 processors.
AB - As massively parallel computers proliferate, there is growing interest in finding ways by which performance of massively parallel codes can be efficiently predicted. This problem arises in diverse contexts such as parallelizing compilers, parallel performance monitoring, and parallel algorithm development. In this paper, we describe one solution where one directly executes the application code, but uses a discrete-event simulator to model details of the presumed parallel machine, such as operating system and communication network behavior. Because this approach is computationally expensive, we are interested in its own parallelization, specifically the parallelization of the discrete-event simulator. We describe methods suitable for parallelized direct execution simulation of message-passing parallel programs, and report on the performance of such a system, LAPSE (Large Application Parallel Simulation Environment), we have built on the Intel Paragon. On all codes measured to date, LAPSE predicts performance well, typically within 10% relative error. Depending on the nature of the application code, we have observed low slowdowns (relative to natively executing code) and high relative speedups using up to 64 processors.
KW - Architectural simulation
KW - Contention
KW - Direct execution simulation
KW - MIMD
KW - Message-passing programs
KW - Parallel simulation
KW - Synchronization
UR - http://www.scopus.com/inward/record.url?scp=0030263105&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0030263105&partnerID=8YFLogxK
U2 - 10.1109/71.539740
DO - 10.1109/71.539740
M3 - Article
AN - SCOPUS:0030263105
SN - 1045-9219
VL - 7
SP - 1090
EP - 1105
JO - IEEE Transactions on Parallel and Distributed Systems
JF - IEEE Transactions on Parallel and Distributed Systems
IS - 10
ER -