Abstract
GRID computing is a more and more attractive approach. Its aim is to gather and to share the resources of a network like the content, the storage or CPU cycles. A computational distributed system like SETI@home produces a power up to 70 TFlops whereas the current best parallel supercomputer BlueGene produces a power of 140 TFlops. Such a supercomputer costs very much contrary to a system like SETI@home. But the use of many computers to increase the global computational power involves several communication problems. We must maintain the GRID communication in order to make any type of computation even though the network is volatile.
In this paper, we present a model to represent GRID applications and networks in order to show faults impacts. We present a fully distributed solution based on a random walk to manage the topology of the GRID. No virtual structure needs to be maintained and this solution works on asynchronous networks. We also present some simulations of our solution.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Allcock, W., Chervenak, A., Foster, I., Pearlman, L., Welch, V., Wilde, M.: Globus toolkit support for distributed data-intensive science. In: Press, I. (ed.) Computing in High Energy Physics, CHEP 2001 (September 2001)
Anderson, D.P.: BOINC: A System for Public-Resource Computing and Storage. In: GRID 2004: Proceedings of the Fifth IEEE/ACM International Workshop on Grid Computing (GRID 2004), Washington, DC, USA, pp. 4–10. IEEE Computer Society, Los Alamitos (2004)
Anderson, D.P., Cobb, J., Korpela, E., Lebofsky, M., Werthimer, D.: SETI@home: an experiment in public-resource computing. Communications of the ACM 45(11), 56–61 (2002)
Bui, A., Bui, M., Sohier, D.: Randomly distributed tasks in bounded time. In: Böhme, T., Heyer, G., Unger, H. (eds.) IICS 2003, vol. 2877, pp. 36–47. Springer, Heidelberg (2003)
Caron, E., et al.: A Scalable Approach to Network Enabled Servers. In: Monien, B., Feldmann, R.L. (eds.) Euro-Par 2002. LNCS, vol. 2400, pp. 907–910. Springer, Heidelberg (2002)
Fedak, G., Germain, C., Neri, V., Cappello, F.: XtremWeb: A Generic Global Computing System. In: IEEE/ACM - CCGRID 2001 Special Session Global Computing on Personal Devices. IEEE Press, Los Alamitos (2001)
Feige, U.: A tight lower bound on the cover time for random walks on graphs. Random Structures & Algorithms 6(4), 433–438 (1995)
Feige, U.: A tight upper bound on the cover time for random walks on graphs. Random Structures & Algorithms 6(1), 51–54 (1995)
Flauzac, O.: Random Circulating Word Information Management for Tree Construction and a Shortest Path Routing Tables Computation. In: Cardenas, R.G. (ed.) OPODIS, Studia Informatica Universalis, Suger, Saint-Denis, rue Catulienne, France, pp. 17–32 (2001)
Flauzac, O., Krajecki, M., Fugère, J.: CONFIIT: a middleware for peer to peer computing. In: Kumar, V., Gavrilova, M.L., Tan, C.J.K., L’Ecuyer, P. (eds.) ICCSA 2003. LNCS, vol. 2669, pp. 69–78. Springer, Heidelberg (2003)
Foster, I., Kesselman, C.: Globus: a metacomputing infrastructure toolkit. In: Press, I. (ed.) Supercomputer Applications, vol. 11 (2), pp. 115–128 (1997)
Foster, I., Kesselman, C. (eds.): The Grid: Blueprint for a Future Computing Infrastructure. Morgan-Kaufmann, San Francisco (1999)
Krajecki, M., Flauzac, O., Mérel, P.-P.: Focus on the communication scheme in the middleware confiit using xml-rpc. In: 18th International Workshop on Java for Parallel Distributed Computing (IW-JPDC 2004), Santa Fe, New Mexico, April 2004, vol. 6, p. 160. IEEE Computer Society, Los Alamitos (2004)
Li, S.: JXTA 2: A high-performance, massively scalable p2p network. Technical report, IBM developerWorks (November 2003)
Lovász, L.: Random walks on graphs: A Survey. In: T.S., Miklos, D., Sos, V.T. (eds.) Combinatorics: Paul Erdos is Eighty, vol. 2, pp. 353–398. Janos Bolyai Mathematical Society (1993)
Lv, Q., Cao, P., Cohen, E., Li, K., Shenker, S.: Search and replication in unstructured peer-to-peer networks. In: ICS 2002: Proceedings of the 16th international conference on Supercomputing, pp. 84–95. ACM Press, New York (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rabat, C., Bui, A., Flauzac, O. (2006). A Random Walk Topology Management Solution for Grid. In: Bui, A., Bui, M., Böhme, T., Unger, H. (eds) Innovative Internet Community Systems. IICS 2005. Lecture Notes in Computer Science, vol 3908. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11749776_8
Download citation
DOI: https://doi.org/10.1007/11749776_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-33973-1
Online ISBN: 978-3-540-33974-8
eBook Packages: Computer ScienceComputer Science (R0)