Abstract
Assume a desktop grid middleware or a deployed cloud infrastructure that are both based on a large number of volunteers for computational-intensive applications or business applications. In this case, the Internet is the communication layer; hence, the communication graph is not regular. Scalability and fault tolerance issues are implicitly present on any platform. For instance, the overlay network that must be built to control the application as part of the run-time support system needs to be scalable and fault tolerant. In this paper, we compute fault tolerance properties of large, irregular graphs that may be used as models for the Internet. In a previous work, we presented algorithms and a framework for computing fault tolerance properties of different variants of randomly-generated binomial regular graphs (BMG). In the present paper we compute the metrics of the Node and Link connectivities and the fault diameter for four benchmarks. We also compare our implementation of the diameter computation with the work of Magnien et al.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Alon, N., Galil, Z., Margalit, O., Naor, M.: Witnesses for boolean matrix multiplication and for shortest paths. In: FOCS, pp. 417–426. IEEE (1992)
Angskun, T., Bosilca, G., Dongarra, J.: Binomial Graph: A Scalable and Fault-Tolerant Logical Network Topology. In: Stojmenovic, I., Thulasiram, R.K., Yang, L.T., Jia, W., Guo, M., de Mello, R.F. (eds.) ISPA 2007. LNCS, vol. 4742, pp. 471–482. Springer, Heidelberg (2007)
Angskun, T., Fagg, G.E., Bosilca, G., Pješivac–Grbović, J., Dongarra, J.: Scalable Fault Tolerant Protocol for Parallel Runtime Environments. In: Mohr, B., Träff, J.L., Worringen, J., Dongarra, J. (eds.) PVM/MPI 2006. LNCS, vol. 4192, pp. 141–149. Springer, Heidelberg (2006)
Angskun, T., Fagg, G.E., Bosilca, G., Pjesivac-Grbovic, J., Dongarra, J.: Self-healing network for scalable fault-tolerant runtime environments. Future Generation Comp. Syst. 26(3), 479–485 (2010)
Cérin, C., Koskas, M., Lei, Y.: Computing properties of large scalable and fault-tolerant logical networks. In: De Souza, A.F., Catabriga, L. (eds.) IEEE SBAC. IEEE (2011)
Message Passing Interface Forum. MPI: A message-passing interface standard. Technical Report UT-CS-94-230, Department of Computer Science, University of Tennessee, Tue, May 22, 101 17:44:55 GMT (April 1994)
Geist, A., Gropp, W.D., Huss-Lederman, S., Lumsdaine, A., Lusk, E.L., Saphir, W., Skjellum, A., Snir, M.: MPI-2: Extending the Message-Passing Interface. In: Fraigniaud, P., Mignotte, A., Bougé, L., Robert, Y. (eds.) Euro-Par 1996. LNCS, vol. 1123, pp. 128–135. Springer, Heidelberg (1996)
Ghafoor, A., Bashkow, T.R.: A study of odd graphs as fault-tolerant interconnection networks. IEEE Transactions on Computers 40(2), 225–232 (1991)
Labarta, B.M.J., Miller, B.P., Schulz, M.: Program development for extreme-scale computing. Technical report, Dagstuhl Seminar 10181 (2010), http://www.dagstuhl.de/10181
Kang, U., Tsourakakis, C.E., Appel, A.P., Faloutsos, C., Leskovec, J.: Radius plots for mining tera-byte scale graphs: Algorithms, patterns, and observations. In: SDM, pp. 548–558. SIAM (2010)
Kang, U., Tsourakakis, C.E., Faloutsos, C.: Pegasus: mining peta-scale graphs. Knowl. Inf. Syst. 27(2), 303–325 (2011)
Kim, J.-S., Lee, H.-O.: Comments on a study of odd graphs as fault-tolerant interconnection networks. IEEE Transactions on Computers 57(6), 864 (2008)
Krishnamoorthy, M.S., Krishnamurthy, B.: Fault diameter of interconnection networks. Computers & Mathematics with Applications 13(5-6), 577–582 (1987)
Latapy, M., Magnien, C.: Complex network measurements: Estimating the relevance of observed properties. In: INFOCOM, pp. 1660–1668. IEEE (2008)
Louri, A., Weech, B., Neocleous, C.: A spanning multichannel linked hypercube: A gradually scalable optical interconnection network for massively parallel computing. IEEE Trans. Parallel Distrib. Syst. 9(5), 497–512 (1998)
Magnien, C., Latapy, M., Habib, M.: Fast computation of empirically tight bounds for the diameter of massive graphs. ACM Journal of Experimental Algorithmics 13 (2008)
Reed, D.A., da Lu, C., Mendes, C.L.: Reliability challenges in large systems. Future Generation Computer Systems 22(3), 293–302 (2006)
Saad, Y., Schultz, M.H.: Topological properties of hypercubes. IEEE Transactions on Computers 37, 867–872 (1988)
Seidel, R.: On the all-pairs-shortest-path problem. In: STOC, pp. 745–749. ACM (1992)
Smets-Solanes, J.-P., Cérin, C., Courteaud, R.: Slapos: A multi-purpose distributed cloud operating system based on an erp billing model. In: Jacobsen, H.-A., Wang, Y., Hung, P. (eds.) IEEE SCC, pp. 765–766. IEEE (2011)
Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord: A scalable peer-to-peer lookup service for internet applications. In: Proceedings of the 2001 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, SIGCOMM 2001, pp. 149–160. ACM, New York (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cérin, C., Coti, C., Koskas, M. (2012). Fault Tolerance Logical Network Properties of Irregular Graphs. In: Xiang, Y., Stojmenovic, I., Apduhan, B.O., Wang, G., Nakano, K., Zomaya, A. (eds) Algorithms and Architectures for Parallel Processing. ICA3PP 2012. Lecture Notes in Computer Science, vol 7439. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33078-0_27
Download citation
DOI: https://doi.org/10.1007/978-3-642-33078-0_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-33077-3
Online ISBN: 978-3-642-33078-0
eBook Packages: Computer ScienceComputer Science (R0)