Using split event sets to form and schedule event combinations in 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.

Using split event sets to form and schedule event combinations in discrete event simulation

Full text

Pdf (859 KB)

Source

Annual Simulation Symposium archive
Proceedings of the 25th annual symposium on Simulation table of contents

Orlando, Florida, United States

Pages: 184 - 191

Year of Publication: 1992

ISBN:0-8186-2765-4

Authors

N. Manjikian	Department of Electrical and Computer Engineering, University of Waterloo, Waterloo, Ontario, Canada
W. M. Loucks	Department of Electrical and Computer Engineering, University of Waterloo, Waterloo, Ontario, Canada

Sponsor

SIGSIM: ACM Special Interest Group on Simulation and Modeling

Publisher

IEEE Computer Society Press Los Alamitos, CA, USA

Bibliometrics

Downloads (6 Weeks): 0, Downloads (12 Months): 5, Citation Count: 1

Additional Information:

references cited by index terms collaborative colleagues

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

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	Douglas W. Jones, An empirical comparison of priority-queue and event-set implementations, Communications of the ACM, v.29 n.4, p.300-311, April 1986 [doi>10.1145/5684.5686]
	2	B. R. Preiss, "The Yaddes Distributed Discrete Event Simulation Specification Language and Execution Environments," Proceedings of the SCS Multiconferenco-- Distributed Simulation, B. W. Unger and R. M. Fujimoto ed., Society for Computer Simulation, Tampa, Florida, 1989, pp. 139-144.
	3	Ernst G. Ulrich, Event manipulation for discrete simulations requiring large numbers of events, Communications of the ACM, v.21 n.9, p.777-785, Sept. 1978 [doi>10.1145/359588.359611]
	4	J.W.J. Williams, "Algorithm 232:Heapsort," C.ACM,7:6 (June 1964),pp. 347-348.
	5	Daniel Dominic Sleator , Robert Endre Tarjan, Self-adjusting binary search trees, Journal of the ACM (JACM), v.32 n.3, p.652-686, July 1985 [doi>10.1145/3828.3835]
	6	R. Brown, Calendar queues: a fast 0(1) priority queue implementation for the simulation event set problem, Communications of the ACM, v.31 n.10, p.1220-1227, Oct. 1988 [doi>10.1145/63039.63045]
	7	Ernst G. Ulrich, Exclusive simulation of activity in digital networks, Communications of the ACM, v.12 n.2, p.102-110, Feb. 1969 [doi>10.1145/362848.362870]
	8	David N. Nicol, High performance parallelized discrete event simulation of stochastic queueing networks, Proceedings of the 20th conference on Winter simulation, p.306-314, December 12-14, 1988, San Diego, California, United States [doi>10.1145/318123.318206]
	9	W.M. Loucks and B. R. Preiss, "The Role of Knowledge in Distributed Simulation," Proceedings of the SCS Multiconference~Distributed Simulation, D. Nicol ed., San Diego, CA., 1990, pp. 9-16.
	10	IEEE, Physical Design Workshop 1987, Hilton Head, South Carolina, April 27-29, 1987.
	11	S. M. Areibi, A Hardware Accelerator for Virtual Time Simulation, Technical Report T-204, Computer Communications Networks Group, University of Waterloo, lanuary 1991.