The small-world phenomenon applied to a self-adaptive resources selection model

Authors:
María Botón-Fernández;Francisco Prieto Castrillo;Miguel A. Vega-Rodríguez
Affiliations:
Dept. Science and Technology, Ceta-Ciemat, Trujillo, Spain;Dept. Science and Technology, Ceta-Ciemat, Trujillo, Spain;Dept. Technologies of Computers and Communications, University of Extremadura, Cáceres, Spain
Venue:
EvoApplications'13 Proceedings of the 16th European conference on Applications of Evolutionary Computation
Year:
2013

Citing 11
Cited 0

The small-world phenomenon: an algorithmic perspective

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Numerical Recipes in C: The Art of Scientific Computing

Numerical Recipes in C: The Art of Scientific Computing
The Anatomy of the Grid: Enabling Scalable Virtual Organizations

Euro-Par '01 Proceedings of the 7th International Euro-Par Conference Manchester on Parallel Processing
Adaptive Computing on the Grid Using AppLeS

IEEE Transactions on Parallel and Distributed Systems
Self-Adaptive and Self-Optimising Resource Monitoring for Dynamic Grid Environments

DEXA '04 Proceedings of the Database and Expert Systems Applications, 15th International Workshop
A framework for adaptive execution in grids

Software—Practice & Experience
Self adaptivity in Grid computing: Research Articles

Concurrency and Computation: Practice & Experience - Grid Performance
The Structure and Dynamics of Networks: (Princeton Studies in Complexity)

The Structure and Dynamics of Networks: (Princeton Studies in Complexity)
Self-adaptive applications on the grid

Proceedings of the 12th ACM SIGPLAN symposium on Principles and practice of parallel programming
A survey of self-adaptive grids

IEEE Communications Magazine
Small-World optimization algorithm for function optimization

ICNC'06 Proceedings of the Second international conference on Advances in Natural Computation - Volume Part II

Quantified Score

Hi-index	0.00

Visualization

Abstract

Small-world property is found in a wide range of natural, biological, social or transport networks. The main idea of this phenomenon is that seemingly distant nodes actually have very short path lengths due to the presence of a small number of shortcut edges running between clusters of nodes. In the present work, we apply this principle for solving the resources selection problem in grid computing environments (distributed systems composed by heterogeneous and geographically dispersed resources). The proposed model expects to find the most efficient resources for a particular grid application in a short number of steps. It also provides a self-adaptive ability for dealing with environmental changes. Finally, this selection model is tested in a real grid infrastructure. From the results obtained it is concluded that both a reduction in execution time and an increase in the successfully completed tasks rate are achieved.