Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: The computation of Global Virtual Time is of fundamental importance in Time Warp based Parallel Discrete Event Simulation Systems. Shared memory multiprocessor architectures can support interprocess communication with much smaller overheads than distributed memory systems.  presents a new, completely asynchronous, Gvt algorithm which provides very fast and accurate Gvt estimation with significantly lor overhead than previous approaches. The algorithm presented is able to support more efficient memory management, termination, and other global control mechanisms.  The Gvt algorithm described enables any Time Warp entity to compute Gvt at any time without slowing down other entities, in particular, those executing on the critical path. Experimental results are  presented for a shared memory Time Warp system that employs a two tiered distributed memory management scheme.  The proof of the correctness and the accuracy of the algorithm are also presented. Finally, some suggestions on possible further optimization of the implementation are given.
['Zhonge Xiao', 'Fabian Gomes', 'Brian W. Unger', 'John G. Cleary']
I am writing a research paper on a idea A fast asynchronous GVT algorithm for shared memory multiprocessor architectures
[{"from": "human", "value": "I am writing a research paper on a idea A fast asynchronous GVT algorithm for shared memory multiprocessor architectures"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: The computation of Global Virtual Time is of fundamental importance in Time Warp based Parallel Discrete Event Simulation Systems. Shared memory multiprocessor architectures can support interprocess communication with much smaller overheads than distributed memory systems.  presents a new, completely asynchronous, Gvt algorithm which provides very fast and accurate Gvt estimation with significantly lor overhead than previous approaches. The algorithm presented is able to support more efficient memory management, termination, and other global control mechanisms.  The Gvt algorithm described enables any Time Warp entity to compute Gvt at any time without slowing down other entities, in particular, those executing on the critical path. Experimental results are  presented for a shared memory Time Warp system that employs a two tiered distributed memory management scheme.  The proof of the correctness and the accuracy of the algorithm are also presented. Finally, some suggestions on possible further optimization of the implementation are given."}]