Skip to main content

Clustering in Stochastic Asynchronous Algorithms for Distributed Simulations

  • Conference paper
Stochastic Algorithms: Foundations and Applications (SAGA 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3777))

Included in the following conference series:

Abstract

We consider a cascade model of N different processors performing a distributed parallel simulation. The main goal of the study is to show that the long-time dynamics of the system have a cluster behaviour. To attack this problem we combine two methods: stochastic comparison and Foster–Lyapunov functions.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Jefferson, D., Witkowski, A.: An Approach to Performance Analysis of Time stamp-driven Synchronization Mechanisms, ACM0-89791-143-1 84, 008/0243 (1984)

    Google Scholar 

  2. Mitra, D., Mitrani, I.: Analysis and Optimum performance of two message-passing parallel processors synchronized by rollback. Performance Evaluation 7, 111–124 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  3. Madisetti, V.K., Walrand, J.C., Messerschmitt, D.G.: Asynchronous Algorithms for the ParaSimulation of Event-Driven Dynamical Systems. ACM Transactions on Modelling and Computer Simulation 1(3), 244–274 (1991)

    Article  MATH  Google Scholar 

  4. Gupta, A., Akyildiz, I.F., Fujimoto, R.M.: Performance Analysis of Time Warp With Multiple Homogeneous Processors. IEEE Transactions On Software Engineering 17(10), 1013 (1991)

    Article  Google Scholar 

  5. Akyildiz, I.F., Chen, L., Dast, S.R., Fujimoto, R.M., Serfozo, R.F.: Performance Analysis of Time Warp with Limited Memory. Performance Evaluation Review 20(1) (June 1992)

    Google Scholar 

  6. Kumar, A., Shorey, R.: Stability of Event Synchronisation in Distributed Discrete Event Simulation. In: Proc. of the eighth workshop on parallel and distributed simulation, Edinburgh, Scotland, United Kingdom, pp. 65–72 (1994)

    Google Scholar 

  7. Fayolle, G., Malyshev, V., Menshikov, M.: Topics on constructive countable Markov chains. Cambridge University Press, Cambridge (1995)

    Google Scholar 

  8. Yu Popov, S., Greenberg, A.G., Malyshev, V.A.: Stochastic models of massively parallel computation. Markov Processes and Related Fields 1(4), 473–490 (1995)

    MATH  MathSciNet  Google Scholar 

  9. Greenberg, A.G., Shenker, S., Stolyar, A.L.: Asynchronous Updates in Large Parallel Systems. SIGMETRICS 96 5/96 PA, USA

    Google Scholar 

  10. Gupta, M., Kumar, A., Shorey, R.: Queueing Models and Stability of Message Flows in Distributed Simulators of Open Queueing Networks. In: Proc. of the tenth workshop on parallel and distributed simulation, Philadelphia, Pennsylvania, United States, pp. 162–169 (1996)

    Google Scholar 

  11. Bertsekas, D.P., Tsitsiklis, J.N.: Parallel and Distributed Computation: Numerical Methods. Athena Scientific, Belmont (1997)

    Google Scholar 

  12. Shorey, R., Kumar, A., Rege, K.M.: Instability and Performance Limits of Distributed Simulators of Feedforward Queueing Networks. ACM Transactions on Modeling and Computer Simulation 7(2), 210–238 (1997)

    Article  MATH  Google Scholar 

  13. Gupta, M., Kumar, A.: A Nonblocking Algorithm for the Distributed Simulation of FCFS Queueing Networks with Irreducible Markovian Routing. In: Proc. of the twelfth workshop on parallel and distributed simulation, Banff, Alberta, Canada, pp. 20–27 (1998)

    Google Scholar 

  14. Voznesenskaya, T.V.: Analysis of algorithms of time synchronisation for distributed simulation. Artificial intelligence (Donetsk) 2, 24–30 (2000) (in Russian)

    Google Scholar 

  15. Voznesenskaya, T.V.: Mathematical model of algorithms of synchronization of time for the distributed simulation. In: Korolev, L.N. (ed.) “Program systems and tools”: the Thematic collection of faculty VMiK of the Moscow State University N1, pp. 56–66. MAX Press (2000)

    Google Scholar 

  16. Malyshev, V., Manita, A.: Time synchronization problem. Rapport de recherche INRIA, 5204 (2004)

    Google Scholar 

  17. Manita, A., Shcherbakov, V.: Asymptotic analysis of particle system with mean-field interaction, arXiv:math.PR/0408372 (2004), http://arxiv.org

  18. Malyshev, V.A., Manita, A.D.: Phase transitions in the time synchronization model. Probability Theory and Applications 50, 150–158 (2005)

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Manita, A., Simonot, F. (2005). Clustering in Stochastic Asynchronous Algorithms for Distributed Simulations. In: Lupanov, O.B., Kasim-Zade, O.M., Chaskin, A.V., Steinhöfel, K. (eds) Stochastic Algorithms: Foundations and Applications. SAGA 2005. Lecture Notes in Computer Science, vol 3777. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11571155_3

Download citation

  • DOI: https://doi.org/10.1007/11571155_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-29498-6

  • Online ISBN: 978-3-540-32245-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics