Experience in massively parallel discrete event simulation

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback
Take a look at the new version of this page: [ beta version ]. Tell us what you think.

Experience in massively parallel discrete event simulation

Full text

Pdf (1.11 MB)

Source

ACM Symposium on Parallel Algorithms and Architectures archive
Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures table of contents

Velen, Germany

Pages: 193 - 202

Year of Publication: 1993

ISBN:0-89791-599-2

Authors

Albert G. Greenberg
Boris D. Lubachevsky
Li-C. Wang

Sponsors

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGARCH: ACM Special Interest Group on Computer Architecture
European Comp Soc : European Computer Society

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 3, Downloads (12 Months): 13, Citation Count: 1

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/165231.165256 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked 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	Stephen G. Eick , Albert G. Greenberg , Boris D. Lubachevsky , Alan Weiss, Synchronous relaxation for parallel simulations with applications to circuit-switched networks, ACM Transactions on Modeling and Computer Simulation (TOMACS), v.3 n.4, p.287-314, Oct. 1993 [doi>10.1145/159737.159744]
	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	Richard M. Fujimoto, Parallel discrete event simulation, Communications of the ACM, v.33 n.10, p.30-53, Oct. 1990 [doi>10.1145/84537.84545]
	7	Bruno Gaujal , Albert G. Greenberg , David M. Nicol, A sweep algorithm for massively parallel simulation of circuit-switched networks, Journal of Parallel and Distributed Computing, v.18 n.4, p.484-500, Aug. 1993 [doi>10.1006/jpdc.1993.1079]
	8	Leslie M. Goldschlager, The monotone and planar circuit value problems are log space complete for P, ACM SIGACT News, v.9 n.2, p.25-29, Summer 1977 [doi>10.1145/1008354.1008356]
	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	David R. Jefferson, Virtual time, ACM Transactions on Programming Languages and Systems (TOPLAS), v.7 n.3, p.404-425, July 1985 [doi>10.1145/3916.3988]
	11	F.P. Kelly. Loss networks. The Annals of Apphed Probability, 1(3):319-378, August 1991.
	12	Richard E. Ladner , Michael J. Fischer, Parallel Prefix Computation, Journal of the ACM (JACM), v.27 n.4, p.831-838, Oct. 1980 [doi>10.1145/322217.322232]
	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	David Nicol , Albert Greenberg , Boris Lubachevsky, MIMD parallel simulation of circuit-switched communication networks, Proceedings of the 24th conference on Winter simulation, p.629-636, December 13-16, 1992, Arlington, Virginia, United States [doi>10.1145/167293.167651]
	17	R.B. Wolf. Advanced techniques for managing telecommunications networks. IEEE Communications Magazine, 28(2):76-81, October 1990.