Event-Aware Dynamic Time Step Synchronization Method for Distributed Moving Object Simulation*This paper was recommended by Technical Committee on Concurrent System Technology.

  • Authors:

  • Atsuo Ozaki;Masashi Shiraishi;Shusuke Watanabe;Minoru Miyazawa;Masakazu Furuichi;Hiroyuki Sato

  • Affiliations:

  • The authors are with Information Technology R&D Center, Mitsubishi Electric Corp., Kamakura-shi, 247-8501 Japan. E-mail: Ozaki.Atsuo@ea.MitsubishiElectric.co.jp,;The authors are with Information Technology R&D Center, Mitsubishi Electric Corp., Kamakura-shi, 247-8501 Japan. E-mail: Ozaki.Atsuo@ea.MitsubishiElectric.co.jp,;The authors are with Kamakura Works, Mitsubishi Electric Corp., Kamakura-shi, 247-8520 Japan.;The authors are with Kamakura Works, Mitsubishi Electric Corp., Kamakura-shi, 247-8520 Japan.;The authors are with Kamakura Works, Mitsubishi Electric Corp., Kamakura-shi, 247-8520 Japan.;The authors are with Information Technology R&D Center, Mitsubishi Electric Corp., Kamakura-shi, 247-8501 Japan. E-mail: Ozaki.Atsuo@ea.MitsubishiElectric.co.jp,

  • Venue:
  • IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

In computer simulation of a large number of moving objects (MOs), how to enlarge Δt (the interval between the simulation time steps) without introducing causality errors is one of the primary keys to enhancing performance. Causality errors can be avoided by using the same Δt among related MOs when they are in the scene of detection (SoD). But in a large-scale MO simulation, MOs interact with one another in a complicated manner requiring a large calculation cost to predict the beginning time of SoD. In this paper we propose an event-aware dynamic time step synchronization method (DTSS) for distributed MO simulation, which increases Δt without introducing causality errors and speeds up the simulation. DTSS can be implemented with little calculation cost because: (1) DTSS does not calculate the beginning time of SoD exactly, but calculates the time for possible entry into SoD with a simple mechanisim, and (2) MO simulation consists of a "movement"-phase and a "detection"-phase in which the distance-calculation between MOs requires a heavy load, and DTSS utilizes the distance values to calculate Δt. In this paper, we also discuss a suitable HLA based time management mechanism to implement DTSS on a distributed computing environment. In the performance evaluation of DTSS, the calculation cost of DTSS is implemented by using the HLA suitable time management mechanism. The results show that DTSS can be executed within the ideal time plus its 1% over-cost when a basic scenario of war-game simulation is employed. Therefore if the ratio of SoD to the total simulation is small, the execution time is expected to decrease to nearly this ratio. We also introduce the criterion for determining when DTSS is superior to the conventional method by using the performance evaluation results. The results presented in this paper are effectively utilized when DTSS is applied to practical applications.