A shared resource algorithm for distributed simulation
ISCA '82 Proceedings of the 9th annual symposium on Computer Architecture
A literature survey on distributed discrete event simulation
ACM SIGSIM Simulation Digest
Performance evaluation of hierarchical distributed simulators
WSC '85 Proceedings of the 17th conference on Winter simulation
An approach towards distributed simulation of timed petri nets
WSC' 90 Proceedings of the 22nd conference on Winter simulation
Systems with Low Distributed Simulation Overhead
IEEE Transactions on Parallel and Distributed Systems
DEVS Formalism: A Framework for Hierarchical Model Development
IEEE Transactions on Software Engineering
Problem oriented protocol design
WSC '84 Proceedings of the 16th conference on Winter simulation
Problem oriented protocol design
ACM SIGSIM Simulation Digest
| Hi-index | 0.00 |
The SRADS distributed simulation algorithm, which makes use of “active logical processes” as described elsewhere in this proceedings and in Reynolds (1982), was studied on a network of processors. Results of previous experiments (O'Hallaron 1983) indicated that SRADS could be expected to perform very well under a wide range of conditions. Our implementation was designed to study the algorithm for use in distributed logic simulation, and to provide more detailed information about the algorithm itself.