EFFECTIVE NETWORKS FOR REAL-TIME DISTRIBUTED PROCESSING

Gonzalo TRAVIESO;Luciando da Fontoura COSTA

Journal of Systems Science & Complexity ›› 2011, Vol. 24 ›› Issue (1) : 39-050.

PDF(252 KB)
中国科学院数学与系统科学研究院期刊网
JSSC
PDF(252 KB)
Journal of Systems Science & Complexity ›› 2011, Vol. 24 ›› Issue (1) : 39-050. DOI: 10.1007/s11424-011-8171-8
article

EFFECTIVE NETWORKS FOR REAL-TIME DISTRIBUTED PROCESSING

Author information +
History +

Abstract

This paper applies the concepts and methods of complex networks
to the development of models and simulations of master-slave
distributed real-time systems by introducing an upper bound in the
allowable delivery time of the packets with computation results. Two
representative interconnection models are taken into account:
Uniformly random and scale free (Barab\'asi-Albert), including the
presence of background traffic of packets. The obtained results
include the identification of the uniformly random interconnectivity
scheme as being largely more efficient than the scale-free
counterpart. Also, increased latency tolerance of the application
provides no help under congestion.

Key words

Complex networks / distributed computing / real-time

Cite this article

EndNote

Ris (Procite)

Bibtex

Download Citations
Gonzalo TRAVIESO , Luciando da Fontoura COSTA. EFFECTIVE NETWORKS FOR REAL-TIME DISTRIBUTED PROCESSING. Journal of Systems Science and Complexity, 2011, 24(1): 39-050 https://doi.org/10.1007/s11424-011-8171-8
PDF(252 KB)

166

Accesses

0

Citation

Detail
Sections
Recommended

/

〈 〉