Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Parallel discrete event simulation offers significant speedup over the traditional sequential event list algorithm. A number of conservative and optimistic algorithms have been proposed and studied for parallel simulation.  examine the problem of transparent execution of a simulation model using conservative algorithms, and present experimental results on the performance of these transparent implementations. The conservative algorithms implemented and compared include the null message algorithm, the conditional-event algorithm, and a new algorithm which is a combination of these.  describe how dynamic topology can be supported by conservative algorithms. Language constructs to express lookahead are discussed. Finally, performance measurements on a variety of benchmarks are presented, along with a study of the relationship beten model characteristics like lookahead, communication topology and the performance of conservative algorithms.
['Vikas Jha', 'Rajive L. Bagrodia']
I am writing a research paper on a idea Transparent implementation of conservative algorithms in parallel simulation languages
[{"from": "human", "value": "I am writing a research paper on a idea Transparent implementation of conservative algorithms in parallel simulation languages"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Parallel discrete event simulation offers significant speedup over the traditional sequential event list algorithm. A number of conservative and optimistic algorithms have been proposed and studied for parallel simulation.  examine the problem of transparent execution of a simulation model using conservative algorithms, and present experimental results on the performance of these transparent implementations. The conservative algorithms implemented and compared include the null message algorithm, the conditional-event algorithm, and a new algorithm which is a combination of these.  describe how dynamic topology can be supported by conservative algorithms. Language constructs to express lookahead are discussed. Finally, performance measurements on a variety of benchmarks are presented, along with a study of the relationship beten model characteristics like lookahead, communication topology and the performance of conservative algorithms."}]