An experimental analysis environment for logical process simulation algorithms

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

An experimental analysis environment for logical process simulation algorithms

Full text

Pdf (136 KB)

Source

International Conference On Simulation Tools And Techniques For Communications, Networks And Systems & Workshops archive
Proceedings of the 2nd International Conference on Simulation Tools and Techniques table of contents

Rome, Italy

POSTER SESSION: Posters table of contents

Article No. 40

Year of Publication: 2009

ISBN:978-963-9799-45-5

Authors

Bing Wang	National University of Defense Technology, Changsha, P.R. China
Jan Himmelspach	Institute of Computer Science, Rostock, Germany
Roland Ewald	Institute of Computer Science, Rostock, Germany
Yiping Yao	National University of Defense Technology, Changsha, P.R. China
Adelinde M. Uhrmacher	Institute of Computer Science, Rostock, Germany

Sponsors

: Create-Net
: ICST

Publisher

ICST (Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering) ICST, Brussels, Belgium, Belgium

Bibliometrics

Downloads (6 Weeks): 10, Downloads (12 Months): 19, Citation Count: 0

Additional Information:

abstract references index terms collaborative colleagues

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

DOI Bookmark:	10.4108/ICST.SIMUTOOLS2009.5678

ABSTRACT

The notion of logical processes (LPs) is a widely used modeling paradigm in parallel and distributed discrete-event simulation (PDES). Nevertheless the comparison among different simulation algorithms for LP models still remains difficult: there are too many combinations of algorithms to be explored, often simulation systems only provide a small subset of available algorithms, and many m&s frameworks blur the boundary between model logic and simulation algorithm, which hampers extensibility and comparability. We present an environment for the experimental analysis of simulation algorithms for logical processes. It separates between model and simulator, is extensible, and facilitates a fair comparison of algorithms. We illustrate the functioning of the environment by presenting experimental results for well-known simulation algorithms and a benchmark model.

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	Java scimark: http://math.nist.gov/scimark2/.
	2	K. M. Chandy , J. Misra, Distributed Simulation: A Case Study in Design and Verification of Distributed Programs, IEEE Transactions on Software Engineering, v.5 n.5, p.440-452, September 1979 [doi>10.1109/TSE.1979.230182]
	3	R. M. Fujimoto. Performance of Time Warp under synthetic workloads. In Proc. of the SCS Multiconf. on Distributed Simulation, pages 23--28, 1990.
	4	I. P. Gent, S. A. Grant, E. MacIntyre, P. Prosser, P. Shaw, B. M. Smith, and T. Walsh. How not to do it. Technical report, University of Leeds, May 1997.
	5	Jan Himmelspach , Adelinde M. Uhrmacher, Plug'n Simulate, Proceedings of the 40th Annual Simulation Symposium, p.137-143, March 26-28, 2007 [doi>10.1109/ANSS.2007.34]
	6	D. Johnson. A theoretician's guide to the experimental analysis of algorithms. In Fifth and Sixth DIMACS Implentation Challenges, 2002.
	7	Catherine C. McGeoch, Experimental algorithmics, Communications of the ACM, v.50 n.11, November 2007 [doi>10.1145/1297797.1297818]
	8	Kalyan S. Perumalla, µsik " A Micro-Kernel for Parallel/Distributed Simulation Systems, Proceedings of the 19th Workshop on Principles of Advanced and Distributed Simulation, p.59-68, June 01-03, 2005 [doi>10.1109/PADS.2005.1]