Automating parallel simulation using parallel time streams

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Automating parallel simulation using parallel time streams

Full text

Pdf (195 KB)

Source

ACM Transactions on Modeling and Computer Simulation (TOMACS) archive
Volume 9 , Issue 2 (April 1999) table of contents

Pages: 171 - 201

Year of Publication: 1999

ISSN:1049-3301

Author

Victor Yau

German National Research Center for Information Technology, Berlin, Germany

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 7, Downloads (12 Months): 31, Citation Count: 1

Additional Information:

abstract 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/333296.333359 What is a DOI?

ABSTRACT

This paper describes a package for parallel steady-state stochastic simulation that was designed to overcome problems caused by long simulation times experienced in our ongoing research in performance evaluation of high-speed and integrated-services communication networks, while maintaining basic statistical rigors of proper analysis of simulation output data. The package, named AKAROA, accepts ordinary (nonparallel) simulation programs, and alll further stages of stochastic simulation should be transparent for users. The package employs a new method of sequential estimation for the Multiple-Replications-in-Parallel scenario. All basic functions, including the transformation of originally nonparallel simulators into ones suitable for parallel execution, control of the precision of estimates, and stopping of parallel simulation processes when the required precision of the overall steady-state estimates is achieved, are automated. The package can be used on multiprocessor systems and/or heterogeneous computer networks, involving an arbitrary number of processors. The design issues, architecture, and implementation of AKAROA, as well as the results of its preliminary performance studies are presented

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	Henri E. Bal , Jennifer G. Steiner , Andrew S. Tanenbaum, Programming languages for distributed computing systems, ACM Computing Surveys (CSUR), v.21 n.3, p.261-322, Sep. 1989 [doi>10.1145/72551.72552]
	2	Brian N. Bershad , Thomas E. Anderson , Edward D. Lazowska , Henry M. Levy, Lightweight remote procedure call, ACM Transactions on Computer Systems (TOCS), v.8 n.1, p.37-55, Feb. 1990 [doi>10.1145/77648.77650]
	3	Richard M. Fujimoto, Time warp on a shared memory multiprocessor, Transactions of the Society for Computer Simulation International, v.6 n.3, p.211-239, Jul. 1989
	4	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]
	5	GAFARIAN, A. V., ANCKER, C. J., AND MORISAKU, T. 1978. Evaluation of commonly used rules for detecting steady state in computer simulation. Nav. Res. Logist. Quart. 78, 511-529.
	6	Blaine Gaither, Scientific visualization of performance data: evaluation of DV-Draw, ACM SIGMETRICS Performance Evaluation Review, v.18 n.2, p.48-53, Aug. 1990 [doi>10.1145/101320.101323]
	7	N. H. Gehani , William D. Roome, Rendezvous Facilities: Concurrent C and the Ada Language, IEEE Transactions on Software Engineering, v.14 n.11, p.1546-1553, November 1988 [doi>10.1109/32.9043]
	8	Peter W. Glynn , Philip Heidelberger, Bias properties of budget constrained simulations, Operations Research, v.38 n.5, p.801-814, Sep./Oct. 1990 [doi>10.1287/opre.38.5.801]
	9	Peter W. Glynn , Philip Heidelberger, Analysis of parallel replicated simulations under a completion time constraint, ACM Transactions on Modeling and Computer Simulation (TOMACS), v.1 n.1, p.3-23, Jan. 1991 [doi>10.1145/102810.102811]
	10	Peter W. Glynn , Philip Heidelberger, Experiments with initial transient deletion for parallel, replicated steady-state simulations, Management Science, v.38 n.3, p.400-418, March 1992 [doi>10.1287/mnsc.38.3.400]
	11	Philip Heidelberger, Statistical analysis of parallel simulations, Proceedings of the 18th conference on Winter simulation, p.290-295, December 08-10, 1986, Washington, D.C., United States [doi>10.1145/318242.318448]
	12	Philip Heidelberger, Discrete event simulations and parallel processing: statistical properties, SIAM Journal on Scientific and Statistical Computing, v.9 n.6, p.1114-1132, November 1988 [doi>10.1137/0909077]
	13	Philip Heidelberger , Peter D. Welch, A spectral method for confidence interval generation and run length control in simulations, Communications of the ACM, v.24 n.4, p.233-245, April 1981 [doi>10.1145/358598.358630]
	14	C. A. R. Hoare, Communicating sequential processes, Communications of the ACM, v.21 n.8, p.666-677, Aug. 1978 [doi>10.1145/359576.359585]
	15	LAW, A. M. AND CARSON, J. C. 1979. A sequential procedure for determining the length of a steady state simulation. Oper. Res. 27, 1011-1025.
	16	Marc S. Meketon , Bruce Schmeiser, Overlapping batch means: something for nothing?, Proceedings of the 16th conference on Winter simulation, p.226-230, December 28-30, 1984, Dallas, TX
	17	Jayadev Misra, Distributed discrete-event simulation, ACM Computing Surveys (CSUR), v.18 n.1, p.39-65, March 1986 [doi>10.1145/6462.6485]
	18	David Nicol , Philip Heidelberger, Parallel execution for serial simulators, ACM Transactions on Modeling and Computer Simulation (TOMACS), v.6 n.3, p.210-242, July 1996 [doi>10.1145/235025.235031]
	19	Krzysztof Pawlikowski, Steady-state simulation of queueing processes: survey of problems and solutions, ACM Computing Surveys (CSUR), v.22 n.2, p.123-170, June 1990 [doi>10.1145/78919.78921]
	20	PAWLIKOWSKI, K., McNICKLE, D., AND YAU, V. 1993. Experimental control for simulations. Final R&D report, Con. 7314. Australia Overseas Telecom Corporation (AOTC Telstra), Clayton, Victoria, Australia.
	21	PAWLIKOWSKI, Z. AND YAU, V. 1991. Independent replications versus spectral analysis in steady-state simulation of high speed data networks. In Proceedings of on Australian Teletraffic Research Seminar (ATRS '91), University of Wollongong, Wollongong, Australia, 322-330.
	22	PAWLIKOWSKI, K. AND YAU, V. 1993. Methodology for stochastic simulation for performance evaluation of data communication networks. Final Report for Telecom Corporation of New Zealand. Telecom Corporation of New Zealand, Wellington, New Zealand.
	23	Krzysztof Pawlikowski , Victor W. C. Yau , Don McNickle, Distributed stochastic discrete-event simulation in parallel time streams, Proceedings of the 26th conference on Winter simulation, p.723-730, December 11-14, 1994, Orlando, Florida, United States
	24	John S. Quarterman , Abraham Silberschatz , James L. Peterson, 4.2BSD and 4.3BSD as examples of the UNIX system, ACM Computing Surveys (CSUR), v.17 n.4, p.379-418, Dec. 1985 [doi>10.1145/6041.6043]
	25	Vernon Rego , Vaidy S. Sunderam, Concurrent stochastic simulation: Experiments with EcliPSe, Proceedings of the IFIP WG 7.3 International Conference on Performance of Distributed Systems and Integrated Communication Networks, p.281-300, September 10-12, 1991
	26	Vernon J. Rego , V. S. Sunderam, Experiments in concurrent stochastic simulation: the EcliPSe paradigm, Journal of Parallel and Distributed Computing, v.14 n.1, p.66-84, Jan. 1992 [doi>10.1016/0743-7315(92)90098-8]
	27	SCHRUBEN, L. W., SINGH, H., AND TIERNEY, L. 1983. Optimal tests for initialization bias in simulation output. Oper. Res. 31, 1167-1178.
	28	V. S. Sunderam , Vernon J. Rego, EcliPSe: a system for high performance concurrent simulation, Software—Practice & Experience, v.21 n.11, p.1189-1219, Nov. 1991 [doi>10.1002/spe.4380211104]
	29	D. B. Wagner , E. D. Lazowska, Parallel simulation of queueing networks: limitations and potentials, ACM SIGMETRICS Performance Evaluation Review, v.17 n.1, p.146-155, May 1989
	30	YAU, V. 1996. Automating parallel and distributed quantitative stochastic simulation. Tech. Rep. No. COSC 05/96. Dept. of Computer Science, University of Canterbury, Christchurch, New Zealand.
	31	Victor Yau, Optical WDMA network design and function placement, Computer Networks: The International Journal of Computer and Telecommunications Networking, v.31 n.22, p.2411-2427, Nov. 29, 1999 [doi>10.1016/S1389-1286(99)00093-6]
	32	YAU, V. AND PAWLIKOWSKI, K. 1992. Improved Nested-Threshold-Cell-Discard buffer management mechanisms. In Proceedings of the IEEE International Conference on Computers, Communications, and Automation (TENCON '92), IEEE Computer Society Press, Los Alamitos, CA, 820-824.
	33	YAU, V. AND PAWLIKOWSKI, K. 1992a. On automatic partitioning, runtime control and output analysis methodology for massively parallel simulations. In Proceedings of the on European Simulation Symposium (ESS 92, Dresden, Germany, Nov.), Society for Computer Simulation, San Diego, CA, 135-139.
	34	YAU, V. AND PAWLIKOWSKI, K. 1992b. ATM overload control: Nested threshold cell discarding with suspended execution. In Proceedings of the on Australian Broadband Switching and Services Symposium (ABSSS '92, Melbourne, Australia), Australian and Overseas Telecommunication Corporation, Ltd., Melbourne, Australia, 689-706.
	35	YAU, V. AND PAWLIKOWSKI, K. 1993. AKAROA: A package for automating generation and process control of parallel stochastic simulation. In Proceedings of the 16th Australian Computer Science Conference, Australian Computer Science Communications, Townsville, Queensland, Australia, 71-83.
	36	YAU, V. AND PAWLIKOWSKI, K. 1993. Distributed queue dual bus MAN with multi-used slots. Tech. Rep. No. COSC 07/93. Dept. of Computer Science, University of Canterbury, Christchurch, New Zealand.
	37	YAU, V. AND PAWLIKOWSKI, K. 1996. A conflict-free traffic assignment algorithm using forward planning. In Proceedings of the IEEE Conference on Computers and Communication (INFOCOM '96), IEEE Press, Piscataway, NJ, 1277-1284.
	38	Victor Yau , Krzysztof Pawlikowski, CA-STAR: a centrally-arbitrated broadcast-and-select star architecture for lightwave networks, Journal of High Speed Networks, v.8 n.3, p.173-193, 1999
	39	YAU, V. AND PAWLIKOWSKI, K. 1999b. An algorithm that uses forward planning to expedite conflict-free traffic assignment in time-multiplex switching systems. IEEE Trans. Commun. 47, 11 (Nov.), 1757-1765.