Abstract
Grid computing has become in recent years an important alternative to traditional parallel computing by providing computational capabilities at large scales.
On the other hand, complex networks have shown to develop non-trivial topological features which can be adapted to the optimization of a wide range of problems.
The present study uses this approach for the reduction of applications execution time in a Grid infrastructure. In this work, we focused on those characterized by parametric sweeps. The way to achieve this task is by applying the preferential attachment technique with a small modification: new nodes are added to the evolving graph with a probability proportional not only to the target node degree but also to the efficiency of resources involved.
As a result, the application becomes self-adaptive to the infrastructure by dynamically obtaining resource rankings and classifying them according to their efficiency.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Foster, I.: What is the Grid? A three Point Checklist. GRIDtoday 1(6), 22–25 (2002)
Foster, I., Kesselman, C., Tuecke, S.: The Anatomy of the Grid: Enabling Scalable Virtual Organizations. In: Sakellariou, R., Keane, J.A., Gurd, J.R., Freeman, L. (eds.) Euro-Par 2001. LNCS, vol. 2150, pp. 1–4. Springer, Heidelberg (2001)
Grid Coffe Official Web Page, http://www.gridcafe.org
Howell, F., Mcnab, R.: SimJava: A Discrete Event Simulation Library for Java. In: International Conference on Web-Based Modeling and Simulation, pp. 51–56 (September 1998)
Wrzesinska, G., Maassen, J., Bal, H.E.: Self-adaptive applications on the Grid. In: 12th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, San Jose, California, USA, pp. 121–129 (2007)
Keung, H.N.L.C., Dyson, J.R.D., Jarvis, S.A., Nudd, G.R.: Self-adaptive and Self-optimising Resource Monitoring for Dynamic Grid Environments. In: 15th International Workshop on Database and Expert Systems Applications, pp. 689–693. IEEE Computer Society, Zaragoza (2004)
Muttoni, L., Casale, G., Granata, F., Zanero, S.: Optimal number of nodes for computation in grid environments. In: 12th EuroMicro Conf. PDP 2004, pp. 282–289 (2004)
Deelman, E., Blythe, J., Gil, Y., Kesselman, C., Mehta, G., Vahi, K., Blackburn, K., Lazzarini, A., Arbree, A., Cavanaugh, R., Koranda, S.: Mapping Abstract Complex Workflows onto Grid Environments. Journal of Grid Computing 1, 25–39 (2003)
Holme, P.: Congestion and centrality in traffic flow on complex Networks. Adv. Complex Syst. 6(2), 163–176 (2003)
Illijasic, L., Saitta, L.: Characterization of a Computational Grid as a Complex System. In: GMAC 2009, Barcelona, Spain, pp. 9–18 (2009)
Barabasi, A.-L., Albert, R.: Emergence of Scaling in Random Networks. Science 286, 509–512 (1999)
Boccalettia, S., Latora, V., Moreno, Y., Chavez, M., Hwang, D.-U.: Complex networks: Structure and dynamics. Physics Reports 424, 175–308 (2006)
Newman, M.E.J.: The structure and function of complex networks, arXiv:cond-mat/0303516 v1 (March 25, 2003)
Bornholdt, S., Schuster, H.G.: Handbook of Graphs and Networks: From the Genome to the Internet, Germany. Wiley-VCH, Chichester (2003)
Barabási, A.-L., Albert, R., Jeong, H.: Scale-free characteristics of random networks: the topology of the world-wide web. Physica A: Statistical Mechanics and its Applications 281(1-4), 69–77 (2000)
Barabási, A.-L.: The physics of the Web. Physics World 14(7), 33–38 (2001)
Condor Project Web Page, http://www.cs.wisc.edu/condor/classad/
Czajkowski, K., Fitzgerald, S., Foster, I., Kesselman, C.: Grid Information Services for Distributed Resource Sharing. In: 10th IEEE International Symposium on High Performance Distributed Computing, pp. 181–194 (2001)
Novotny, J., Tuecke, S., Welch, V.: An Online Credential Repository for the Grid: MyProxy. In: 10th IEEE International Symposium on High Performance Distributed Computing, pp. 104–111 (2001)
National Network of e-Science Web Page, http://www.e-ciencia.es/grid.jsp
National Network of e-Science Grid Portal, http://www.e-ciencia.es/wiki/index.php/Portal:Grid
Press, W.H., Flannery, B.P., Teukolsky, S.A., Vetterling, W.T.: Numerical recipes in C. Press Syndicate of the University of Cambridge, New York (1992)
Czajkowski, K., Foster, I., Karonis, N., Kesselman, C., Martin, S., Smith, W., Tuecke, S.: A Resource Management Architecture for Metacomputing Systems. In: Feitelson, D.G., Rudolph, L. (eds.) IPPS-WS 1998, SPDP-WS 1998, and JSSPP 1998. LNCS, vol. 1459, pp. 62–82. Springer, Heidelberg (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Botón-Fernández, M., Castrillo, F.P., Vega-Rodríguez, M.A. (2011). Self-Adaptive Deployment of Parametric Sweep Applications through a Complex Networks Perspective. In: Murgante, B., Gervasi, O., Iglesias, A., Taniar, D., Apduhan, B.O. (eds) Computational Science and Its Applications - ICCSA 2011. ICCSA 2011. Lecture Notes in Computer Science, vol 6783. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21887-3_37
Download citation
DOI: https://doi.org/10.1007/978-3-642-21887-3_37
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-21886-6
Online ISBN: 978-3-642-21887-3
eBook Packages: Computer ScienceComputer Science (R0)