Performance trade-off in distributed simulation

Author

Onggo, B.S.S. ; Teo, Y.M.

Author_Institution

Dept. of Comput. Sci., Nat. Univ. of Singapore, Singapore

fYear

2002

fDate

2002

Firstpage

77

Lastpage

84

Abstract

We extend our previous work on formalizing event orderings using partial order set and its application in space analysis in distributed simulation. We focus on the time and space trade-off in exploiting event parallelism. Event parallelism is divided into inherent (problem) parallelism, event ordering parallelism and effective event parallelism. Firstly, we analyze the performance cost of varying event ordering parallelism on memory requirement in open and closed systems. Secondly, we study the effects of interconnection topology of a physical system on exploitable event ordering parallelism. Measurements were obtained from a time-space analyzer that we have developed.

Keywords

discrete event simulation; distributed processing; software performance evaluation; synchronisation; discrete-event simulation; distributed simulation; effective event parallelism; event ordering parallelism; event parallelism; interconnection topology; memory requirement; partial order set; performance trade-off; space analysis; synchronization; time-space trade-off; Conferences;

fLanguage

English

Publisher

ieee

Conference_Titel

Distributed Simulation and Real-Time Applications, 2002. Proceedings. Sixth IEEE International Workshop on

ISSN

1530-1990

Print_ISBN

0-7695-1853-2

Type

conf

DOI

10.1109/DISRTA.2002.1166892

Filename

1166892