ACM Transactions on Programming Languages and Systems (TOPLAS)
Efficient distributed event-driven simulations of multiple-loop networks
Communications of the ACM
Parallel discrete event simulation
Communications of the ACM - Special issue on simulation
Time warp on a shared memory multiprocessor
Transactions of the Society for Computer Simulation International
Performance bounds on parallel self-initiating discrete-event simulations
ACM Transactions on Modeling and Computer Simulation (TOMACS)
The cost of conservative synchronization in parallel discrete event simulations
Journal of the ACM (JACM)
The local Time Warp approach to parallel simulation
PADS '93 Proceedings of the seventh workshop on Parallel and distributed simulation
Transparent implementation of conservative algorithms in parallel simulation languages
WSC '93 Proceedings of the 25th conference on Winter simulation
Exploiting lookahead in synchronous parallel simulation
WSC '93 Proceedings of the 25th conference on Winter simulation
Performance Analysis of Time Warp with Multiple Homogeneous Processors
IEEE Transactions on Software Engineering
Analysis and Optimum Performance of Two Message-Passing Parallel Processors Synchronized by Rollback
Performance '84 Proceedings of the Tenth International Symposium on Computer Performance Modelling, Measurement and Evaluation
SIMULATION OF PACKET COMMUNICATION ARCHITECTURE COMPUTER SYSTEMS
SIMULATION OF PACKET COMMUNICATION ARCHITECTURE COMPUTER SYSTEMS
Parallel programming paradigms
Parallel programming paradigms
A null message count of a conservative parallel simulation
VECPAR'02 Proceedings of the 5th international conference on High performance computing for computational science
Hi-index | 0.00 |
In order to make formal and analytic models more realistic, overheads which were previously ignored or vastly simplified must be included. We consider the feasibility of characterizing the overheads in conservative asynchronous simulations for such models, and we focus on a single communication structure (i.e., meshes) and use both multicomputer programs and a queueing network as example applications. We find that the two most important issues for modeling are to understand how to estimate the time spent in sending null messages and how to account for the resulting overhead due to the input waiting rule. For null messages, we estimate both the number of messages sent as well as the cost per null message. The number of messages sent can often be estimated by the application, although irregularities in communication structure and edge effects in communication can affect these estimates. A constant is valid as a first-order approximation for the time per null message, but there are secondary factors that one may wish to model, such as load balancing and communication irregularities. The overhead attributable to the input waiting rule depends on several factors: communication structure, communication frequency, and processor load balancing. Irregularity in any of these dimensions can adversely affect the performance of the conservative strategy. It appears feasible to use the factors contributing to the overheads (i.e. context switch costs; null-message costs; percentage of looping due to the conservative synchronization) in a formal model to estimate the cost of the conservative overheads.