EFFECTIVE NETWORKS FOR REAL-TIME DISTRIBUTED PROCESSING

Autor(es)

Travieso, Gonzalo ^[1] ; Costa, Luciando da Fontoura ^[1]

Afiliação do(s) autor(es)

^[1] Univ Sao Paulo, Inst Fis Sao Carlos, BR-13566590 Sao Carlos, SP - Brazil

• Tipo de documento: Artigo Científico
• Fonte: Journal of Systems Science & Complexity; v. 24, n. 1, p. 39-50, FEB 2011.
• Citações Web of Science: 2

Resumo

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. (AU)

• Processo FAPESP: 05/00587-5 - Modelagem por redes (grafos) e técnicas de reconhecimento de padrões: estrutura, dinâmica e aplicações
• Beneficiário: Roberto Marcondes Cesar Junior
• Modalidade de apoio: Auxílio à Pesquisa - Temático