Abstract
This paper presents several basic algorithms for the parallel simulation of G/G/1 queueing systems and certain networks of such systems. The coverage includes systems subject to manufacturing or communication blocking, or to loss of customer due to capacity constraints. The key idea is that the customer departure times are represented by longest-path distance in directed graphs instead of by the usual recursive equations. This representation leads to scalable algorithms with a high degree of parallelism that can be implemented on either MIMD or SIMD parallel computers.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
A. Apstolico, M.J. Atallah, L.L. Larmore and S. McFaddin, Efficient parallel algorithms for string editing and related problems, SIAM J. Comput. 19 (1990) 968–988.
F. Baccelli, M. Canales and I. Sophia, Parallel simulation of stochastic Petri nets using recurrences (1994), submitted for publication.
J. Banks and J.S. Carson II, Discrete-Event System Simulation (Prentice-Hall, 1984).
K.M. Chandy and J. Misra, Distributed simulation: A case study in design and verification of distributed programs, IEEE Trans. Software Engrg. 5 (1979) 440–452.
K.M. Chandy and J. Misra, Asynchronous distributed simulation via a sequence of parallel computations, Commun. ACM 24 (1988) 198–205.
L. Chen and J.L. Chen, A fast simulation approach for tandem queueing systems, in: Proc. Winter Simulation Conference (1990) pp. 539–546.
J. Chen and L. Chen, A fast simulator for tandem queueing systems, Computers and Industrial Engrg. 24(2) (1993) 267–280.
L. Chen, Performance analysis and improvement of parallel simulations, Ph.D. thesis, School of Industrial and Systems Engineering, Georgia Institute of Technology (1993).
T.H. Cormen, G.E. Leiserson and R.T. Rivest, Introduction to Algorithms (MIT Press and McGraw-Hill, 1990).
M.A. Eyler, F. Ergal and C. Aykanat, Parallel algorithm for the simulation of tandem queueing networks with blocking, in: Proc. of the Fourth International Symposium on Computer and Information Science, II(1989) pp. 1307–1317.
A.G. Greenberg, B.D. Lubachevsky and I. Mitrani, Unboundedly parallel simulations via recurrence relations, in: Proc. 1990 ACM SIGMETRICS Conf. on Meas. and Modeling of Computer Systems.
A.G. Greenberg, B.D. Lubachevsky and I. Mitrani, Algorithms for unboundedly parallel simulations, ACM Trans. Comput. Systems 9(3) (1991) 201–221.
A.G. Greenberg, O. Schlunk and W. Whitt, Using distributed-event parallel simulation to study departures from many queues in series, Technical report, AT&T Bell Laboratories (1992).
K. Hwang, Advanced Computer Architecture: Parallelism, Scalability, Programmability (McGraw-Hill, 1993).
D.R. Jefferson, Virtual time, ACM Trans. on Prog. Lang. Syst. 7 (1985) 404–425.
P. Heidelberger and H.S. Stone, Parallel trace-driven cache simulation by time partitioning, in: Proc. Winter Simulation Conf. (1990) pp. 734–737.
A.M. Law and W.D. Kelton, Simulation Modeling & Analysis (McGraw-Hill, 1991).
Y.-B. Lin and D. Lazowska, A time-division algorithm for parallel simulation, ACM Trans. Model. Comput. Simul. 1 (1991) 73–83.
I. Nikolaidis and R.M. Fujimoto, Parallel simulation of high-speed network multiplers, in: 1993 IEEE Conf. on Decison and Control (1993).
D. Nicol, A.G. Greenberg and B.D. Lubachevsky, Massively parallel algorithms for trace-driven cache simulations, to appear.
D.B. Wagner and E.D. Lazowska, Parallel simulation of queueing networks: Limitations and potentials, ACM Sigmetrics Performance Evaluation Review and Performance 17(1) (1989) 146–155.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Chen, L. Parallel simulation by multi-instruction, longest-path algorithms. Queueing Systems 27, 37–54 (1997). https://doi.org/10.1023/A:1019149712019
Issue Date:
DOI: https://doi.org/10.1023/A:1019149712019