Cited By
View all- Greenberg ALubachevsky BMitrani I(1996)Superfast parallel discrete event simulationsACM Transactions on Modeling and Computer Simulation10.1145/232807.2328186:2(107-136)Online publication date: 1-Apr-1996
Experience in massively parallel discrete event simulation
Pages 193 - 202
References
[1]
G.R. Ash, :I.-S. Chen, A.E. Frey, and B.D. Huang. Realtime network routing in a dynamic class-of-service network. In Thirteenth International Tcletraffic Congress (ITC-13}, Copenhagen, June 1991.
[2]
T. Blank. The MasPar MP-1 architecture. In Compcon Spring 1990, San Francisco, CA, February 1990. IEEE Computer Society Press.
[3]
K.M. Chandy and }3. Sherman. Space-time and simulation. In Dzstributed Simulation 1989, pages 53-57. The Society for Computer Simulation, 1989.
[4]
S. Eick, A.G. Greenberg, B.D. Lubachevsky, and A. Weiss. Synchronous relaxation for parallel simulations with applications to circuit-switched networks. A CM Transactions on Modeling and Computer Simulation, 1992. A preliminary version appeared in the 1991 SCS Multiconference, Simulation Series; vol. 23, no. 1.
[5]
T. Feder, A.G. Greenberg, M. Rausch, V. P#amachandran, and L.-C. Wang. Circuit-switched link simulation: algorithms, complexity, implementation, in preparation, 1992.
[6]
R.M. Fujimoto. Parallel discrete event simulation. Communzcations of the A CM, 33(10):31-53, 1991.
[7]
B. Gaujal, A.G. Greenberg, and D.M. Nicol. A sweep algorithm for massively parallel simulation of circuitswitched networks. Journal of Parallel and Distributed Computing, 1993. to appear.
[8]
L. M. Goldschlager. The monotone and planar circuit value problem are log space complete for P. SIGA CT News, 9:25-29, 1977.
[9]
A.G. Greenberg, A.M. Odlyzko, J. Rexford, and D. Espinosa. Massively parallel algorithms for fixed point approximations for evaluating the performance of circuitswitched networks, unpublished, December 1992.
[10]
D.R. Jefferson. Virtual time. A CM Transactions on Programming Languages and Systems, 7(3):404-425, July 1985.
[11]
F.P. Kelly. Loss networks. The Annals of Apphed Probability, 1(3):319-378, August 1991.
[12]
R.E. L#tdner #nd M_J_ Fischer. P#rall#l pr#fi# computation. Journal of the A CM, 27:831-838, 1980.
[13]
J. Van Leeuwen, editor. Handbook o:f Theoretical Computer Science, volume A. MIT Press, Cambridge, MA, 1990. See Chapter 17, Parallel Algorithms for Shared- Memory Machines, by R.M. Karp and V. Ramachandean.
[14]
E. W. Mayr and A. Subramanian. The complexity of circuit value and network stability. In Proceedings 4th Annual Conference on Structure in Complexity Theory, pages 114-123, Eugene, Oregon, June 1989.
[15]
D. Mitra, R.3. Gibbens, and B.D. Huang. Analysis and optimal design of aggregated-least-busy-alternative routing on symmetric loss networks with trunk reservations. In 13th International Teletraffic Congress, Copenhagen, Denmark, June 1991. North Holland.
[16]
D.M. Nicol, A.G. Greenberg, and B.D. Lubachevsky. MIMD parallel simulation of circuit-switched networks. In 199P Winter Simulation Conference, Arlington, VA, December 1992.
[17]
R.B. Wolf. Advanced techniques for managing telecommunications networks. IEEE Communications Magazine, 28(2):76-81, October 1990.
Index Terms
- Experience in massively parallel discrete event simulation
Recommendations
Parallel discrete event simulation
Special issue on simulationParallel discrete event simulation (PDES), sometimes called distributed simulation, refers to the execution of a single discrete event simulation program on a parallel computer. PDES has attracted a considerable amount of interest in recent years. From ...
Comments
Information & Contributors
Information
Published In
Copyright © 1993 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Sponsors
- European Comp Soc: European Computer Society
- SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
- SIGARCH: ACM Special Interest Group on Computer Architecture
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 01 August 1993
Check for updates
Qualifiers
- Article
Conference
Acceptance Rates
Overall Acceptance Rate 447 of 1,461 submissions, 31%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 269Total Downloads
- Downloads (Last 12 months)45
- Downloads (Last 6 weeks)20
Reflects downloads up to 06 Jan 2025
Other Metrics
Citations
Cited By
View all- Greenberg ALubachevsky BMitrani I(1996)Superfast parallel discrete event simulationsACM Transactions on Modeling and Computer Simulation10.1145/232807.2328186:2(107-136)Online publication date: 1-Apr-1996
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in