loading...
Analysing the Performance of Optimistic Synchronisation Algorithms in Simulations of Multi-Agent Systems
Singapore May 24-May 26
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/PADS.2006.1020th Workshop on Principles of Advanc ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Michael Lees, University of Nottingham, UK
Brian Logan, University of Nottingham, UK
Chen Dan, University of Birmingham, UK
Ton Oguara, University of Birmingham, UK
Georgios Theodoropoulos, University of Birmingham, UK
In this paper we present a detailed analysis of the performance of the Decision Theoretic Read Delay (DTRD) optimistic synchronisation algorithm for simulations of Multi- Agent Systems. We develop an abstract characterisation of the access patterns found in MAS simulations based on the simulation?s degree of coupling and skew. Using this characterisation, we generated stereotypical test cases which we used to compare the performance of the DTRD algorithm with that of Time Warp and time windows. To determine if the test cases reliably predict performance in a real agent simulation, we compared the predictions made by the test cases with performance results from the Boids agent simulation benchmark for a range of simulation parameters. The results indicate that DTRD adapts to the mixtures of coupling cases found in real agent simulations and is capable of tracking changes in coupling during the simulation.
Citation:
Michael Lees, Brian Logan, Chen Dan, Ton Oguara, Georgios Theodoropoulos, "Analysing the Performance of Optimistic Synchronisation Algorithms in Simulations of Multi-Agent Systems," pads, pp.37-44, 20th Workshop on Principles of Advanced and Distributed Simulation (PADS'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.