Predicting efficiency in master-slave grid computing systems

dc.creatorTravieso, Gonzalo
dc.creatorRuggiero, Carlos Antonio
dc.creatorBruno, Odemir Martinez
dc.creatorCosta, Luciano da Fontoura
dc.date.accessioned2014-06-10T00:41:24Z
dc.date.accessioned2018-07-04T16:46:35Z
dc.date.available2014-06-10T00:41:24Z
dc.date.available2018-07-04T16:46:35Z
dc.date.created2014-06-10T00:41:24Z
dc.date.issued2013-06
dc.identifierJournal of Complex Network, Oxford : Oxford University Press - OUP, v. 1, n. 1, p. 63-71, June 2013
dc.identifier2051-1310
dc.identifierhttp://www.producao.usp.br/handle/BDPI/45333
dc.identifier10.1093/comnet/cnt005
dc.identifier.urihttp://repositorioslatinoamericanos.uchile.cl/handle/2250/1640210
dc.description.abstractThis work reports a quantitative analysis to predicting the efficiency of distributed computing running in three models of complex networks: Barabási-Albert, Erdõs-Rényi 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.
dc.languageeng
dc.publisherOxford University Press - OUP
dc.publisherOxford
dc.relationJournal of Complex Networks
dc.rightsCopyright The Authors
dc.rightsrestrictedAccess
dc.subjectGrid computing
dc.subjectEfficiency
dc.subjectTopology
dc.subjectPrediction
dc.titlePredicting efficiency in master-slave grid computing systems
dc.typeArtículos de revistas


Este ítem pertenece a la siguiente institución