DocumentCode
3484225
Title
Overhead reduction in distributed simulation
Author
Bharghavan, Vaduvur ; Ramamoorthy, C.V.
Author_Institution
Dept. of Electr. Eng. & Comput. Sci., California Univ., Berkeley, CA, USA
fYear
1993
fDate
1993
Firstpage
352
Lastpage
358
Abstract
Optimistic distributed discrete-event simulation incurs significant memory overhead because it stores state vectors with each processed but uncommitted message. The authors propose an application-independent scheme that substantially reduces this overhead, while also improving the simulation performance. Global control in optimistic simulation is replaced by local conservative control, and the concept of hierarchical layers of commitment of messages is introduced. The memory overheads imposed by Time Warp are reduced, and the performance of the Time Warp algorithm is improved. These two objects are achieved by ensuring that the state of the system as a whole is not impeded by the slowness of a few logical processes
Keywords
computational complexity; discrete event simulation; distributed algorithms; Time Warp; distributed discrete-event simulation; distributed simulation; hierarchical layers; local conservative control; memory overhead; memory overheads; optimistic simulation; Application software; Clocks; Computational modeling; Discrete event simulation; Discrete event systems; Mathematical analysis; Multiprocessor interconnection networks; Optimization methods; Random access memory; Time warp simulation;
fLanguage
English
Publisher
ieee
Conference_Titel
Autonomous Decentralized Systems, 1993. Proceedings. ISADS 93., International Symposium on
Conference_Location
Kawasaki
Print_ISBN
0-8186-3125-2
Type
conf
DOI
10.1109/ISADS.1993.262683
Filename
262683
Link To Document