Minimum cost adaptive synchronization

Mascarenhas, Edward; Knop, Felipe; Pasquini, Reuben; Rego, Vernon

doi:10.1145/295251.295257

Cited by 10 publications

(2 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Based on this approach, it either decides to process or block an event arriving in a LP. Similar to this approach, [85] proposed an algorithm Minimum Average Cost (MAC) which is based on a prediction technique to anticipate the arrival of a straggler event using probabilities that aims to minimise the cost of a rollback overhead and time delays in synchronisation.…”

Section: Adaptive Synchronisation In Pdesmentioning

confidence: 99%

Synchronised Range Queries

Suryanarayanan

Minson

Theodoropoulus

2009

2009 13th IEEE/ACM International Symposium on Distributed Simulation and Real Time Applications

View full text Add to dashboard Cite

Computer simulations have been used more than ever before to embark on developing and understanding complex systems such as Multi-Agent Systems (MAS). MAS are complex, non-deterministic, data-centric behaviour and nature. Simulations play a key role for the designer of an agent based system to experiment and study the impact of different architectures, environment and agent behaviour. As MAS are increasingly used to solve larger and more complex problems, scalability becomes an important issue for the successful deployment. An emerging viable solution is adopting distributed simulation techniques in executing MAS models in parallel. One approach is to distribute the shared state (or environment) of a simulation model across available computing resources. Based on this approach, PDES-MAS (Parallel and Discrete Event Simulations for Multi-Agent System) framework is designed to execute large scale models such as MAS. It adopts PDES techniques to distribute and run parallel simulation of Multi-Agent Systems (MAS). Several challenges arise on executing MAS models on a distributed environment, of which one issue that requires focus is data access. Accessing data efficiently in a latency-sensitive and large scale network overlay is a vital requirement for the scalability of the system. Following PDES paradigm, it is also very important that events (accessing shared state) in a parallel and discrete event simulation system are processed in a non decreasing (logical) time stamp order. So, this thesis presents a notion of logical time synchronised range queries to access data and in particular within the PDES-MAS framework. To localise data access, this thesis also provides mechanisms to distribute shared state in an adaptive manner such that the distribution reflects access patterns of simulating nodes. The algorithms are evaluated within the implementation of PDES-MAS framework using various agent based simulation traces. ACKNOWLEDGEMENTS

show abstract

Section: Adaptive Synchronisation In Pdesmentioning

confidence: 99%

Synchronised Range Queries

Suryanarayanan

Minson

Theodoropoulus

2009

2009 13th IEEE/ACM International Symposium on Distributed Simulation and Real Time Applications

View full text Add to dashboard Cite

show abstract

“…The Minimum Average Cost (MAC) algorithm [7] is another probabilistic synchronisation algorithm which uses a decision theoretic approach to determine delay times. The algorithm is implemented within the ParaSol system, where each LP has an independent input channel for message from every other LP in the system.…”

Section: Related Workmentioning

confidence: 99%

Analysing Probabilistically Constrained Optimism

Lees

Logan

Cogălniceanu

et al. 2006

2006 Tenth IEEE International Symposium on Distributed Simulation and Real-Time Applications

View full text Add to dashboard Cite

SUMMARYIn previous work we presented the DTRD algorithm, an optimistic synchronization algorithm for parallel discrete event simulation of multi-agent systems, and showed that it outperforms Time Warp and time windows on a range of test cases. DTRD uses a decision-theoretic model of rollback to derive an optimal time to delay read event so as to maximize the rate of LVT progression. The algorithm assumes that the inter-arrival times (both virtual and real) of events are normally distributed. In this paper we present a more detailed evaluation of the DTRD algorithm, and specifically how the performance of the algorithm is affected when the inter-arrival times do not follow the assumed distributions. Our analysis suggests that the performance of the algorithm is relatively insensitive to events whose inter-arrival times are not normally distributed. However, as the variance of event inter-arrival times increases, its performance degrades to that of Time Warp. The evaluation approach we present is generally applicable, and we sketch how a similar analysis may be performed for two other decision-theoretic optimistic synchronization algorithms.

show abstract

Analysing probabilistically constrained optimism

Lees

Logan

Theodoropoulos

2009

Concurrency and Computation

View full text Add to dashboard Cite

In previous work we presented the DTRD algorithm, an optimistic synchronization algorithm for parallel discrete event simulation of multi‐agent systems, and showed that it outperforms Time Warp and time windows on a range of test cases. DTRD uses a decision‐theoretic model of rollback to derive an optimal time to delay read event so as to maximize the rate of LVT progression. The algorithm assumes that the inter‐arrival times (both virtual and real) of events are normally distributed. In this paper we present a more detailed evaluation of the DTRD algorithm, and specifically how the performance of the algorithm is affected when the inter‐arrival times do not follow the assumed distributions. Our analysis suggests that the performance of the algorithm is relatively insensitive to events whose inter‐arrival times are not normally distributed. However, as the variance of event inter‐arrival times increases, its performance degrades to that of Time Warp. The evaluation approach we present is generally applicable, and we sketch how a similar analysis may be performed for two other decision‐theoretic optimistic synchronization algorithms. Copyright © 2009 John Wiley & Sons, Ltd.

show abstract

Minimum cost adaptive synchronization

Cited by 10 publications

References 19 publications

Synchronised Range Queries

Synchronised Range Queries

Analysing Probabilistically Constrained Optimism

Analysing probabilistically constrained optimism

Contact Info

Product

Resources

About