{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T14:59:36Z","timestamp":1725893976763},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642330773"},{"type":"electronic","value":"9783642330780"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33078-0_27","type":"book-chapter","created":{"date-parts":[[2012,9,3]],"date-time":"2012-09-03T21:37:49Z","timestamp":1346708269000},"page":"377-391","source":"Crossref","is-referenced-by-count":0,"title":["Fault Tolerance Logical Network Properties of Irregular Graphs"],"prefix":"10.1007","author":[{"given":"Christophe","family":"C\u00e9rin","sequence":"first","affiliation":[]},{"given":"Camille","family":"Coti","sequence":"additional","affiliation":[]},{"given":"Michel","family":"Koskas","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"27_CR1","doi-asserted-by":"crossref","unstructured":"Alon, N., Galil, Z., Margalit, O., Naor, M.: Witnesses for boolean matrix multiplication and for shortest paths. In: FOCS, pp. 417\u2013426. IEEE (1992)","DOI":"10.1109\/SFCS.1992.267748"},{"key":"27_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/978-3-540-74742-0_43","volume-title":"Parallel and Distributed Processing and Applications","author":"T. Angskun","year":"2007","unstructured":"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.\u00a04742, pp. 471\u2013482. Springer, Heidelberg (2007)"},{"key":"27_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/11846802_25","volume-title":"Recent Advances in Parallel Virtual Machine and Message Passing Interface","author":"T. Angskun","year":"2006","unstructured":"Angskun, T., Fagg, G.E., Bosilca, G., Pje\u0161ivac\u2013Grbovi\u0107, J., Dongarra, J.: Scalable Fault Tolerant Protocol for Parallel Runtime Environments. In: Mohr, B., Tr\u00e4ff, J.L., Worringen, J., Dongarra, J. (eds.) PVM\/MPI 2006. LNCS, vol.\u00a04192, pp. 141\u2013149. Springer, Heidelberg (2006)"},{"issue":"3","key":"27_CR4","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1016\/j.future.2009.04.001","volume":"26","author":"T. Angskun","year":"2010","unstructured":"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.\u00a026(3), 479\u2013485 (2010)","journal-title":"Future Generation Comp. Syst."},{"key":"27_CR5","doi-asserted-by":"crossref","unstructured":"C\u00e9rin, 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)","DOI":"10.1109\/SBAC-PAD.2011.22"},{"key":"27_CR6","unstructured":"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)"},{"key":"27_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1007\/3-540-61626-8_16","volume-title":"Euro-Par \u201996 - Parallel Processing","author":"A. Geist","year":"1996","unstructured":"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\u00e9, L., Robert, Y. (eds.) Euro-Par 1996. LNCS, vol.\u00a01123, pp. 128\u2013135. Springer, Heidelberg (1996)"},{"issue":"2","key":"27_CR8","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1109\/12.73594","volume":"40","author":"A. Ghafoor","year":"1991","unstructured":"Ghafoor, A., Bashkow, T.R.: A study of odd graphs as fault-tolerant interconnection networks. IEEE Transactions on Computers\u00a040(2), 225\u2013232 (1991)","journal-title":"IEEE Transactions on Computers"},{"key":"27_CR9","unstructured":"Labarta, B.M.J., Miller, B.P., Schulz, M.: Program development for extreme-scale computing. Technical report, Dagstuhl Seminar 10181 (2010), \n                    \n                      http:\/\/www.dagstuhl.de\/10181"},{"key":"27_CR10","doi-asserted-by":"crossref","unstructured":"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\u2013558. SIAM (2010)","DOI":"10.1137\/1.9781611972801.48"},{"issue":"2","key":"27_CR11","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/s10115-010-0305-0","volume":"27","author":"U. Kang","year":"2011","unstructured":"Kang, U., Tsourakakis, C.E., Faloutsos, C.: Pegasus: mining peta-scale graphs. Knowl. Inf. Syst.\u00a027(2), 303\u2013325 (2011)","journal-title":"Knowl. Inf. Syst."},{"issue":"6","key":"27_CR12","doi-asserted-by":"publisher","first-page":"864","DOI":"10.1109\/TC.2008.53","volume":"57","author":"J.-S. Kim","year":"2008","unstructured":"Kim, J.-S., Lee, H.-O.: Comments on a study of odd graphs as fault-tolerant interconnection networks. IEEE Transactions on Computers\u00a057(6), 864 (2008)","journal-title":"IEEE Transactions on Computers"},{"issue":"5-6","key":"27_CR13","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1016\/0898-1221(87)90085-X","volume":"13","author":"M.S. Krishnamoorthy","year":"1987","unstructured":"Krishnamoorthy, M.S., Krishnamurthy, B.: Fault diameter of interconnection networks. Computers & Mathematics with Applications\u00a013(5-6), 577\u2013582 (1987)","journal-title":"Computers & Mathematics with Applications"},{"key":"27_CR14","doi-asserted-by":"crossref","unstructured":"Latapy, M., Magnien, C.: Complex network measurements: Estimating the relevance of observed properties. In: INFOCOM, pp. 1660\u20131668. IEEE (2008)","DOI":"10.1109\/INFOCOM.2008.227"},{"issue":"5","key":"27_CR15","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1109\/71.679219","volume":"9","author":"A. Louri","year":"1998","unstructured":"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.\u00a09(5), 497\u2013512 (1998)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"27_CR16","doi-asserted-by":"crossref","unstructured":"Magnien, C., Latapy, M., Habib, M.: Fast computation of empirically tight bounds for the diameter of massive graphs. ACM Journal of Experimental Algorithmics\u00a013 (2008)","DOI":"10.1145\/1412228.1455266"},{"issue":"3","key":"27_CR17","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/j.future.2004.11.015","volume":"22","author":"D.A. Reed","year":"2006","unstructured":"Reed, D.A., da Lu, C., Mendes, C.L.: Reliability challenges in large systems. Future Generation Computer Systems\u00a022(3), 293\u2013302 (2006)","journal-title":"Future Generation Computer Systems"},{"key":"27_CR18","doi-asserted-by":"publisher","first-page":"867","DOI":"10.1109\/12.2234","volume":"37","author":"Y. Saad","year":"1988","unstructured":"Saad, Y., Schultz, M.H.: Topological properties of hypercubes. IEEE Transactions on Computers\u00a037, 867\u2013872 (1988)","journal-title":"IEEE Transactions on Computers"},{"key":"27_CR19","doi-asserted-by":"crossref","unstructured":"Seidel, R.: On the all-pairs-shortest-path problem. In: STOC, pp. 745\u2013749. ACM (1992)","DOI":"10.1145\/129712.129784"},{"key":"27_CR20","doi-asserted-by":"crossref","unstructured":"Smets-Solanes, J.-P., C\u00e9rin, 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\u2013766. IEEE (2011)","DOI":"10.1109\/SCC.2011.97"},{"key":"27_CR21","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1145\/383059.383071","volume-title":"Proceedings of the 2001 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, SIGCOMM 2001","author":"I. Stoica","year":"2001","unstructured":"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\u2013160. ACM, New York (2001)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Architectures for Parallel Processing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33078-0_27.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:54:30Z","timestamp":1620129270000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33078-0_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642330773","9783642330780"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33078-0_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}