DocumentCode
2977502
Title
Efficient commitment of events in distributed simulation
Author
Bharghavan, V. ; Ramamoorthy, C.V.
Author_Institution
Dept. of Electr. Eng. & Comput. Sci., California Univ., Berkeley, CA, USA
fYear
1993
fDate
1-5 Nov 1993
Firstpage
257
Lastpage
262
Abstract
We have built a distributed discrete-event simulator called Empathy. This paper describes some aspects of the Empathy simulation algorithm. Optimistic simulation incurs enormous memory overhead. In this paper, we propose an algorithm for optimistic simulation that is based on the concept of local conservative control for commitment of events. This algorithm reduces the memory overhead by an average of 30% and reduces the aggregate computational time for simulation by up to 25%
Keywords
computational complexity; discrete event simulation; distributed processing; software engineering; Empathy simulation algorithm; aggregate computational time; distributed discrete event simulator; distributed simulation; efficient event commitment; local conservative control; memory overhead; optimistic simulation; Clocks; Communication channels; Computational modeling; Computer simulation; Concurrent computing; Discrete event simulation; Parallel processing; Random access memory;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Software and Applications Conference, 1993. COMPSAC 93. Proceedings., Seventeenth Annual International
Conference_Location
Phoenix, AZ
Print_ISBN
0-8186-4440-0
Type
conf
DOI
10.1109/CMPSAC.1993.404184
Filename
404184
Link To Document