Workshop on Parallel and Distributed Simulation · 2000 · 10 citations · 10 references
ComputingComputer EngineeringComputer ScienceComputer ArchitectureParallel AlgorithmsParallel ComputingCommunication OverheadData LocalityParallel Computing SystemsParallel Performance AnalysisScalable Algorithm DesignShared-memory MultiprocessingEvent GranularityGranularityLoad DistributionLoad Distribution AnalysisShared MemoryShared Memory MultiprocessorsSynchronization Mechanisms
Many synchronous algorithms have been proposed for parralel and discrete simulations. However, the actual performance of these algorithms have been far from ideal, especially when event granularity is small. Barring the case of low parallelism in the given simulation models, one of the main reasons of low speedups is in the uneven load distribution among processors. We present several new locality-preserving load balancing mechanisms for synchronous simulations on shared-memory multiprocessors. We show both theoretically and empirically that some of these mechanisms incur very low overhead. The results confirm that one of the new mechanisms is indeed more efficient and scalable than common existing approaches.
10
A bridging model for parallel computation
Leslie G. Valiant · Communications of the ACM · 1990 · 3.7K citations · Full text
Parallel discrete event simulation
Richard M. Fujimoto · Communications of the ACM · 1990 · 1.8K citations · Full text