ACM Transactions on Programming Languages and Systems (TOPLAS)
Parallel discrete event simulation
Communications of the ACM - Special issue on simulation
ACM Transactions on Programming Languages and Systems (TOPLAS)
Algorithms for scalable synchronization on shared-memory multiprocessors
ACM Transactions on Computer Systems (TOCS)
Principles of conservative parallel simulation
WSC '96 Proceedings of the 28th conference on Winter simulation
Lock-free data structures
Scheduling critical channels in conservative parallel discrete event simulation
PADS '99 Proceedings of the thirteenth workshop on Parallel and distributed simulation
Performance prediction of a parallel simulator
PADS '99 Proceedings of the thirteenth workshop on Parallel and distributed simulation
ANSS '91 Proceedings of the 24th annual symposium on Simulation
Safe timestamps and large-scale modeling
PADS '00 Proceedings of the fourteenth workshop on Parallel and distributed simulation
An empirical study of conservative scheduling
PADS '00 Proceedings of the fourteenth workshop on Parallel and distributed simulation
A New Scheduling Method for Parallel Discrete-Event Simulation
Euro-Par '96 Proceedings of the Second International Euro-Par Conference on Parallel Processing-Volume II
Lock-free Scheduling of Logical Processes in Parallel Simulation
Lock-free Scheduling of Logical Processes in Parallel Simulation
Addressing blocking and scalability in critical channel traversing
Proceedings of the sixteenth workshop on Parallel and distributed simulation
Composite Synchronization in Parallel Discrete-Event Simulation
IEEE Transactions on Parallel and Distributed Systems
An Analytical Model of Scheduling for Conservative Parallel Simulation
Proceedings of the 9th European PVM/MPI Users' Group Meeting on Recent Advances in Parallel Virtual Machine and Message Passing Interface
Collaborative scheduling of DAG structured computations on multicore processors
Proceedings of the 7th ACM international conference on Computing frontiers
A Well-Balanced Time Warp System on Multi-Core Environments
PADS '11 Proceedings of the 2011 IEEE Workshop on Principles of Advanced and Distributed Simulation
Runtime efficient event scheduling in multi-threaded network simulation
Proceedings of the 4th International ICST Conference on Simulation Tools and Techniques
| Hi-index | 0.00 |
With fixed lookahead information in a simulation model, the overhead of asynchronous conservative parallel simulation lies in the mechanism used for propagating time updates in order for logical processes to safely advance their local simulation clocks. Studies have shown that a good scheduling algorithm should preferentially schedule processes containing events on the critical path. This paper introduces a lock-free algorithm for scheduling logical processes in conservative parallel discrete-event simulation on shred-memory multiprocessor machines. The algorithm uses fetch & add operations that help avoid inefficiencies associated with using locks. The lock-free algorithm is robust. Experiments show that, compared with the scheduling algorithm using locks, the lock-free algorithm exhibits better performance when the number of logical processes assigned to each processor is small or when the workload becomes significant. In models with large number of logical processes, our algorithm shows only modest increase in execution time due to the overhead in the algorithm for extra bookkeeping.