article

Parallel simulation by multi-instruction, longest-path algorithms

Author:

Liang ChenAuthors Info & Claims

Queueing Systems: Theory and Applications, Volume 27, Issue 1/2

Pages 37 - 54

https://doi.org/10.1023/A:1019149712019

Published: 14 December 1997 Publication History

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.

References

[1]

{1} 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.

Digital Library

[2]

{2} F. Baccelli, M. Canales and I. Sophia, Parallel simulation of stochastic Petri nets using recurrences (1994), submitted for publication.

[3]

{3} J. Banks and J.S. Carson II, Discrete-Event System Simulation (Prentice-Hall, 1984).

[4]

{4} 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.

Digital Library

[5]

{5} K.M. Chandy and J. Misra, Asynchronous distributed simulation via a sequence of parallel computations, Commun. ACM 24 (1988) 198-205.

Digital Library

[6]

{6} L. Chen and J.L. Chen, A fast simulation approach for tandem queueing systems, in: Proc. Winter Simulation Conference (1990) pp. 539-546.

Digital Library

[7]

{7} J. Chen and L. Chen, A fast simulator for tandem queueing systems, Computers and Industrial Engrg. 24(2) (1993) 267-280.

Digital Library

[8]

{8} L. Chen, Performance analysis and improvement of parallel simulations, Ph.D. thesis, School of Industrial and Systems Engineering, Georgia Institute of Technology (1993).

Digital Library

[9]

{9} T.H. Cormen, G.E. Leiserson and R.T. Rivest, Introduction to Algorithms (MIT Press and McGraw-Hill, 1990).

Digital Library

[10]

{10} 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.

[11]

{11} 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 .

Digital Library

[12]

{12} A.G. Greenberg, B.D. Lubachevsky and I. Mitrani, Algorithms for unboundedly parallel simulations, ACM Trans. Comput. Systems 9(3) (1991) 201-221.

Digital Library

[13]

{13} 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).

[14]

{14} K. Hwang, Advanced Computer Architecture: Parallelism, Scalability, Programmability (McGraw-Hill, 1993).

Digital Library

[15]

{15} D.R. Jefferson, Virtual time, ACM Trans. on Prog. Lang. Syst. 7 (1985) 404-425.

Digital Library

[16]

{16} P. Heidelberger and H.S. Stone, Parallel trace-driven cache simulation by time partitioning, in: Proc. Winter Simulation Conf. (1990) pp. 734-737.

Digital Library

[17]

{17} A.M. Law and W.D. Kelton, Simulation Modeling & Analysis (McGraw-Hill, 1991).

Digital Library

[18]

{18} Y.-B. Lin and D. Lazowska, A time-division algorithm for parallel simulation, ACM Trans. Model. Comput. Simul. 1 (1991) 73-83.

Digital Library

[19]

{19} I. Nikolaidis and R.M. Fujimoto, Parallel simulation of high-speed network multiplers, in: 1993 IEEE Conf. on Decison and Control (1993).

[20]

{20} D. Nicol, A.G. Greenberg and B.D. Lubachevsky, Massively parallel algorithms for trace-driven cache simulations, to appear.

[21]

{21} 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.

Digital Library

Cited By

Kin WChan V(2010)Generalized Lindley-type recursive representations for multiserver tandem queues with blockingACM Transactions on Modeling and Computer Simulation10.1145/1842722.184272620:4(1-19)Online publication date: 5-Nov-2010
https://dl.acm.org/doi/10.1145/1842722.1842726
Kiesling TKrieger TNicol DFujimoto R(2006)Efficient parallel queuing system simulationProceedings of the 38th conference on Winter simulation10.5555/1218112.1218299(1020-1027)Online publication date: 3-Dec-2006
https://dl.acm.org/doi/10.5555/1218112.1218299
McGough AMitrani IDonatiello LTurner SBruce D(2000)Efficient distributed simulation of a communication switch with bursty sources and lossesProceedings of the fourteenth workshop on Parallel and distributed simulation10.5555/336146.336162(85-92)Online publication date: 1-May-2000
https://dl.acm.org/doi/10.5555/336146.336162
Show More Cited By

Recommendations

Mean Waiting Time Approximations in the G/G/1 Queue

It is known that correlations in an arrival stream offered to a single-server queue profoundly affect mean waiting times as compared to a corresponding renewal stream offered to the same server. Nonetheless, this paper uses appropriately constructed GI/...
Read More
On queues with service and interarrival times depending on waiting times

We consider an extension of the standard G/G/1 queue, described by the equation $W\stackrel{ \mathcal {D}}{=}\max\mathrm{max}\,\{0,B-A+YW\}$ , where [ Y =1]= p and [ Y = 1]=1 p . For p =1 this model reduces to the classical Lindley equation for the waiting time in the G/G/1 queue, whereas for p =0 it ...
Read More
An efficient parallel algorithm for the longest path problem in meshes

The longest path problem is the problem of finding a simple path with the maximum number of vertices in a given graph, and so far it has been solved polynomially only for a few classes of graphs. This problem generalizes the well-known Hamiltonian path ...
Read More

Comments

Information & Contributors

Information

Published In

cover image Queueing Systems: Theory and Applications

Queueing Systems: Theory and Applications Volume 27, Issue 1/2

1997

199 pages

ISSN:0257-0130

Issue’s Table of Contents

Copyright © Copyright © 1997 Kluwer Academic Publishers.

Publisher

J. C. Baltzer AG, Science Publishers

United States

Publication History

Published: 14 December 1997

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

4
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Other Metrics

View Author Metrics

Citations

Cited By

Kin WChan V(2010)Generalized Lindley-type recursive representations for multiserver tandem queues with blockingACM Transactions on Modeling and Computer Simulation10.1145/1842722.184272620:4(1-19)Online publication date: 5-Nov-2010
https://dl.acm.org/doi/10.1145/1842722.1842726
Kiesling TKrieger TNicol DFujimoto R(2006)Efficient parallel queuing system simulationProceedings of the 38th conference on Winter simulation10.5555/1218112.1218299(1020-1027)Online publication date: 3-Dec-2006
https://dl.acm.org/doi/10.5555/1218112.1218299
McGough AMitrani IDonatiello LTurner SBruce D(2000)Efficient distributed simulation of a communication switch with bursty sources and lossesProceedings of the fourteenth workshop on Parallel and distributed simulation10.5555/336146.336162(85-92)Online publication date: 1-May-2000
https://dl.acm.org/doi/10.5555/336146.336162
Hoseyni-Nasab MAndradóttir S(1996)Parallel simulation by time segmentationProceedings of the 28th conference on Winter simulation10.1145/256562.256659(376-381)Online publication date: 8-Nov-1996
https://dl.acm.org/doi/10.1145/256562.256659

View Options

View options

Media

Figures

Other

Tables

View Issue’s Table of Contents