ACM Transactions on Programming Languages and Systems (TOPLAS)
Distributed discrete-event simulation
ACM Computing Surveys (CSUR)
SIAM Journal on Scientific and Statistical Computing - Papers from the Second Conference on Parallel Processing for Scientific Computin
Multicomputer networks: message-based parallel processing
Multicomputer networks: message-based parallel processing
Parallel discrete-event simulation of FCFS stochastic queueing networks
PPEALS '88 Proceedings of the ACM/SIGPLAN conference on Parallel programming: experience with applications, languages and systems
Parallel discrete event simulation
Communications of the ACM - Special issue on simulation
Parallel simulation of communicating finite state machines
PADS '93 Proceedings of the seventh workshop on Parallel and distributed simulation
The communication challenge for MPP: Intel Paragon and Meiko CS-2
Parallel Computing
A static partitioning and mapping algorithm for conservative parallel simulations
PADS '94 Proceedings of the eighth workshop on Parallel and distributed simulation
Distributed computation on graphs: shortest path algorithms
Communications of the ACM
Parallel simulation on the hypercube multiprocessor
Distributed Computing
Improving conservative VHDL simulation performance by reduction of feedback
PADS '96 Proceedings of the tenth workshop on Parallel and distributed simulation
Performance of a conservative simulator of ATM networks
Proceedings of the eleventh workshop on Parallel and distributed simulation
General methodology 3: a federation object coordinator for simulation based control and analysis
Proceedings of the 34th conference on Winter simulation: exploring new frontiers
| Hi-index | 0.00 |
This paper describes an extension of the TNE algorithm, the objective of which is to increase its parallelism and to break the inter-processor deadlocks inherent with the use of TNE. The algorithm, which we call the SGTNE algorithm (Semi Global TNE), is executed over a cluster of processors as opposed to TNE, which is executed over a cluster of processes assigned to a single processor. SGTNE helps to break the inter-processor deadlocks by executing a shortest path algorithm over a snapshot of the LPs in a cluster of processors. This paper discusses the algorithm and its implementation and reports on the performance results of simulations of a partitioned FCFS queueing network model executed on the Intel Paragon A4 multiprocessor machine. We also examine the impact of partitioning on the efficient implementation of the SGTNE algorithm. The results obtained indicate that SGTNE yields good speedups and that a partitioning which makes use of a strongly connected component algorithm results in a reduction of 30% in the running time of a simulation when compared to simple partitioning strategies. The results also indicate that SGTNE outperforms TNE.