Predicting efficiency in master-slave grid computing systems

Author(s)

Travieso, G. ; Ruggiero, C. A. ; Bruno, O. M. ; Costa, L. da F.

• Document type: Journal article
• Source: JOURNAL OF COMPLEX NETWORKS; v. 1, n. 1, p. 9-pg., 2013-06-01.

Abstract

This work reports a quantitative analysis to predicting the efficiency of distributed computing running in three models of complex networks: Barabasi-Albert, Erdos-Renyi and Watts-Strogatz. A master-slave computing model is simulated. A node is selected as master and distributes tasks among the other nodes (the clients). Topological measurements associated with the master node (e.g. its degree or [betwenness] betweenness centrality) are extracted and considered as predictors of the total execution time. It is found that the closeness centrality provides the best alternative. The effect of network size was also investigated. (AU)

• FAPESP's process: 11/01523-1 - Computer vision methods applied to the identification and analysis of plants
• Grantee: Odemir Martinez Bruno
• Support Opportunities: Regular Research Grants
• FAPESP's process: 11/50761-2 - Models and methods of e-Science for life and agricultural sciences
• Grantee: Roberto Marcondes Cesar Junior
• Support Opportunities: Research Projects - Thematic Grants