Parallel simulation of message routing networks

Author

Miguel, Jorge ; Arruabarrena, A. ; Izu, Cruz ; Beivide, R.

Author_Institution

Dept. Arquitectura y Tecnologia de Computadores, UPV/EHU, San Sebastian, Spain

fYear

1995

fDate

25-27 Jan 1995

Firstpage

138

Lastpage

145

Abstract

An implementation of a conservative parallel simulator with deadlock avoidance is presented. Its performance when working with a realistic model of a message routing network is evaluated and contrasted against a sequential simulator. Different factors that improve the performance of the parallel simulation are discussed, focusing in the model under study and the available computer: a network of transputers. These factors are the load of the model being simulated, the grain size of the simulator and the simulator ability to exploit the lookahead property of the model

Keywords

digital simulation; distributed memory systems; message passing; parallel machines; parallel programming; transputer systems; conservative parallel simulator; deadlock avoidance; grain size; lookahead property; message routing network; message routing networks; parallel simulation; realistic model; sequential simulator; transputers; Analytical models; Computational modeling; Computer networks; Computer simulation; Concurrent computing; Discrete event simulation; Load modeling; Routing; System recovery; Testing;

fLanguage

English

Publisher

ieee

Conference_Titel

Parallel and Distributed Processing, 1995. Proceedings. Euromicro Workshop on

Conference_Location

San Remo

Print_ISBN

0-8186-7031-2

Type

conf

DOI

10.1109/EMPDP.1995.389130

Filename

389130