A Stochastic Process Approach to Model Distributed Computing on Complex Networks

In this work we present analytic expressions for the expected values of the performance metrics of parallel applications when the distributed computing infrastructure has a complex topology. Through active probing tests we analyse the structure of a real distributed computing environment. From the r...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Journal of grid computing Ročník 13; číslo 2; s. 215 - 232
Hlavní autoři: Prieto-Castrillo, Francisco, Astillero, Antonio, Botón-Fernández, María
Médium: Journal Article
Jazyk:angličtina
Vydáno: Dordrecht Springer Netherlands 01.06.2015
Springer Nature B.V
Témata:
Business metrics
Computation
Computer networks
Computer Science
Computer simulation
Distributed processing
Exact solutions
Management of Computing and Information Systems
Mathematical analysis
Networks
Performance measurement
Processor Architectures
Stochastic processes
Structural hierarchy
Topology
User Interfaces and Human Computer Interaction
Distributed computing
Stochastic processes
Complex networks
ISSN:1570-7873, 1572-9184
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:In this work we present analytic expressions for the expected values of the performance metrics of parallel applications when the distributed computing infrastructure has a complex topology. Through active probing tests we analyse the structure of a real distributed computing environment. From the resulting network we both validate the analytic expressions and explore the performance metrics under different conditions through Monte Carlo simulations. In particular we gauge computing paradigms with different hierarchical structures in computing services. Fully decentralised (i.e., peer-to-peer ) environments provide the best performance. Moreover, we show that it is possible to improve significantly the parallel efficiency by implementing more intelligent configurations of computing services and task allocation strategies (e.g., by using a betweenness centrality measure). We qualitatively reproduce results of previous works and provide closed-form solutions that link topology, application’s structure and allocation parameters when job dependencies and a complex network structure are considered.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
ISSN:1570-7873
1572-9184
DOI:10.1007/s10723-014-9317-4