Proceedings 9th Workshop on Parallel and Distributed Simulation (ACM/IEEE) (1995)

Lake Placid, New York

June 14, 1995 to June 16, 1995

ISBN: 0-8186-7120-3

pp: 68

A. Boukerche , Sch. of Comput. Sci., McGill Univ., Montreal, Que., Canada

C. Tropper , Sch. of Comput. Sci., McGill Univ., Montreal, Que., Canada

ABSTRACT

This paper describes an extension of the TNE algorithm, the objective of which is to increase its parallelism and to break the inter-processor deadlock 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 deadlock 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.

INDEX TERMS

discrete event simulation; parallel algorithms; SGTNE; inter-processor deadlock; parallelism; performance results; FCFS queueing network model; partitioning; shortest path algorithm

CITATION

A. Boukerche and C. Tropper, "SGTNE: semi-global time of the next event algorithm,"

*Proceedings 9th Workshop on Parallel and Distributed Simulation (ACM/IEEE)(PADS)*, Lake Placid, New York, 1995, pp. 68.

doi:10.1109/PADS.1995.404315

CITATIONS