TY - GEN
T1 - Scaling an optimistic parallel simulation of large-scale interconnection networks
AU - Choudhury, Nilesh
AU - Mehta, Yogesh
AU - Wilmarth, Terry L.
AU - Bohm, Eric J.
AU - Kalé, Laxmikant V.
PY - 2005
Y1 - 2005
N2 - Parallel computers today are designed with larger number of processors than ever before, connected by large scale Interconnection Networks. Communication is the key to achieving high performance on such machines, making the study of Interconnection Networks important. Parallel simulations of Interconnection Networks present a unique problem characterized by fine-grained computation and strong dependence among events. The absence of large lookaheads makes it unsuitable to use a conservative simulation. Using an optimistic Parallel Discrete Event Simulation allows us to extract reasonable parallelism from this simulation. In this paper we present BigNetSim, an Interconnection Network simulator. We analyze its performance and present techniques related to enhancing performance and scaling it to a large number of processors on different artificial traffic patterns and real application logs. Inspite of the overheads of a parallel optimistic simulation, we have achieved a breakeven with sequential simulation at four processors and demonstrate perfect scaling to 128 processors.
AB - Parallel computers today are designed with larger number of processors than ever before, connected by large scale Interconnection Networks. Communication is the key to achieving high performance on such machines, making the study of Interconnection Networks important. Parallel simulations of Interconnection Networks present a unique problem characterized by fine-grained computation and strong dependence among events. The absence of large lookaheads makes it unsuitable to use a conservative simulation. Using an optimistic Parallel Discrete Event Simulation allows us to extract reasonable parallelism from this simulation. In this paper we present BigNetSim, an Interconnection Network simulator. We analyze its performance and present techniques related to enhancing performance and scaling it to a large number of processors on different artificial traffic patterns and real application logs. Inspite of the overheads of a parallel optimistic simulation, we have achieved a breakeven with sequential simulation at four processors and demonstrate perfect scaling to 128 processors.
UR - http://www.scopus.com/inward/record.url?scp=33846684644&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=33846684644&partnerID=8YFLogxK
U2 - 10.1109/WSC.2005.1574299
DO - 10.1109/WSC.2005.1574299
M3 - Conference contribution
AN - SCOPUS:33846684644
SN - 0780395204
SN - 9780780395206
T3 - Proceedings - Winter Simulation Conference
SP - 591
EP - 600
BT - Proceedings of the 2005 Winter Simulation Conference
T2 - 2005 Winter Simulation Conference
Y2 - 4 December 2005 through 7 December 2005
ER -