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 (Barabasi-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.

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

FAPESP[05/00587-5]

CNPq[301303/06-1]

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)