Effective networks for real-time distributed processing
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ási-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 wordsComplex networks distributed computing real-time
Unable to display preview. Download preview PDF.
- J. W. S. Liu, Real-Time Systems, Prentice-Hall, 2000.Google Scholar
- B. Bollobás, Random Graphs, Cambridge University Press, 2001.Google Scholar
- M. Faloutsos, P. Faloutsos, and C. Faloutsos, On power-law relationships of the internet topology, SIGCOMM’99: Proceedings of the Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication, 1999: 251–262.Google Scholar
- L. da F. Costa, G. Travieso, and C. A. Ruggiero, Complex grid computing, European Physical Journal, 2005, B44: 119–128.Google Scholar
- B. Tadić, S. Thurner, and G. J. Rodgers, Traffic on complex networks: Towards understanding global statistical properties from microscopic fluctuations, Physical Review, 2004, E69: 036102.Google Scholar
- B. Danila, Y. Yu, J. A. Marsh, and K. E. Bassler, Optimal transport on complex networks, Physical Review, 2006, E74: 046106.Google Scholar
- P. Erdős and A. Rényi, On random graphs, Publicationes Mathematicae, 1959, 6: 290–297.Google Scholar
- A. L. Barabási and R. Albert, Emergence of scaling in random networks, Science, 1997, 286: 509–512.Google Scholar