Skip to main content
Conference Proceedings

Clustering in stochastic asynchronous algorithms for distributed simulations

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2005) 3777 LNCS 26-37
DOI: 10.1007/11571155_3
6Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

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. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Manita, A., & Simonot, F. (2005). Clustering in stochastic asynchronous algorithms for distributed simulations. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3777 LNCS, pp. 26–37). https://doi.org/10.1007/11571155_3

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free