The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.05 - May (2002 vol.13)
pp: 433-446
ABSTRACT
<p>This paper considers a technique for composing global (barrier-style) and local (channel scanning) synchronization protocols within a single parallel discrete-event simulation. Composition is attractive because it allows one to tailor the synchronization mechanism to the model being simulated. We first motivate the problem by showing the large performance gap that can be introduced by a mismatch of model and synchronization method. Our solution calls for each channel between submodels to be classified as synchronous or asynchronous. We mathematically formulate the problem of optimally classifying channels and show that, in principle, the optimal classification can be obtained in time proportional to max C {x log C, V x N}, where C is the number of channels, V the number of unique minimal delays on those channels, and N is the number of submodels. We then demonstrate an implementation which finds an optimal solution at runtime and consider its performance on network topologies, including one of the global internet at the autonomous system level. We find that the automated method effectively determines channel assignments that maximize performance.</p>
INDEX TERMS
Synchronization, simulation, parallel processing, performance, optimization.
CITATION
David M. Nicol, Jason Liu, "Composite Synchronization in Parallel Discrete-Event Simulation", IEEE Transactions on Parallel & Distributed Systems, vol.13, no. 5, pp. 433-446, May 2002, doi:10.1109/TPDS.2002.1003854
19 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool