Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Abstract   Simulation, particularly of networks of queues, is an application with a high degree of inherent parallelism, and is of considerable practical interest.  continue the analysis of synchronization methods for distributed simulation, defined by the taxonomy in our previous paper. Specifically,  develop algorithms for time-driven simulation using a network of processors. For most of the synchronization methods considered, each node k of an n-node network simulation cannot proceed directly with its part of a simulation. Rather, it must compute some function  B   k  ( ν  1 ,  ν  2 , …,  ν   n  ), where  ν   i   is some value which must be obtained from node  i . The value of  ν   i   at each node changes as the simulation progresses, and must be broadcast to every other node for the recomputation of the  B -functions. In some cases, it is advantageous to compute the  B -function in a distributed manner. Broadcast algorithms for such distributed computation are presented. Since the performance of a broadcast algorithm depends on the properties of the inter-process communication facility,  characterize some particular cases and give algorithms for each of them.
['J. Kent Peacock', 'Eric G. Manning', 'Johnny W. Wong']
I am writing a research paper on a idea Synchronization of distributed simulation using broadcast algorithms
[{"from": "human", "value": "I am writing a research paper on a idea Synchronization of distributed simulation using broadcast algorithms"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Abstract   Simulation, particularly of networks of queues, is an application with a high degree of inherent parallelism, and is of considerable practical interest.  continue the analysis of synchronization methods for distributed simulation, defined by the taxonomy in our previous paper. Specifically,  develop algorithms for time-driven simulation using a network of processors. For most of the synchronization methods considered, each node k of an n-node network simulation cannot proceed directly with its part of a simulation. Rather, it must compute some function  B   k  ( \u03bd  1 ,  \u03bd  2 , \u2026,  \u03bd   n  ), where  \u03bd   i   is some value which must be obtained from node  i . The value of  \u03bd   i   at each node changes as the simulation progresses, and must be broadcast to every other node for the recomputation of the  B -functions. In some cases, it is advantageous to compute the  B -function in a distributed manner. Broadcast algorithms for such distributed computation are presented. Since the performance of a broadcast algorithm depends on the properties of the inter-process communication facility,  characterize some particular cases and give algorithms for each of them."}]