{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T08:09:37Z","timestamp":1750147777309,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540578994"},{"type":"electronic","value":"9783540483854"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-57899-4_61","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T13:40:41Z","timestamp":1330263641000},"page":"301-314","source":"Crossref","is-referenced-by-count":2,"title":["The folded Petersen network: A new versatile multiprocessor interconnection topology"],"prefix":"10.1007","author":[{"given":"Sabine R.","family":"\u00d6hring","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sajal K.","family":"Das","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,26]]},"reference":[{"key":"26_CR1","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1109\/TC.1984.1676437","volume":"C-33","author":"L. Bhuyan","year":"1984","unstructured":"L. Bhuyan and D.P. Agrawal. Generalized hypercubes and hyperbus structures for a computer network. IEEE Transactions on Computers, C-33, pp. 323\u2013333, 1984.","journal-title":"IEEE Transactions on Computers"},{"key":"26_CR2","doi-asserted-by":"crossref","unstructured":"S.N. Bhatt and Jin-Yi Cai. Take a walk, grow a tree. In Proc. of the 29th Annual Symposium on Foundations of Computer Science, pp. 469\u2013478, Los Alamitos, USA, 1989.","DOI":"10.1109\/SFCS.1988.21963"},{"key":"26_CR3","unstructured":"J.C. Bermond and C. Peyrat. de bruijn and kautz networks: a competitor for the hypercube? In Hypercubes and Distributed Computers, pp. 279\u2013293, North-Holland, 1989."},{"key":"26_CR4","unstructured":"G. Chartrand and R.J. Wilson. The petersen graph. Graphs and Applications (Eds. F. Harary and J.S. Maybee), pp. 69\u2013100, 1985."},{"key":"26_CR5","unstructured":"N.G. de Bruijn. A combinatorial problem. In Proceedings, volume 49, part 20, pp. 758\u2013764. Akademe Van Wetenschappen, 1946."},{"key":"26_CR6","first-page":"270","volume-title":"Hyper petersen network: yet another hypercube-like topology","author":"S. K. Das","year":"1992","unstructured":"S.K. Das and A.K. Banerjee. Hyper petersen network: yet another hypercube-like topology. In Proc. of the 4th Symposium on the Frontiers of Massively Parallel Computation (Frontiers' 92), pp. 270\u2013277, McLean, Virginia, Oct. 1992."},{"key":"26_CR7","doi-asserted-by":"crossref","unstructured":"S.K. Das,J. Ghosh, and N. Deo. Stirling networks: a versatile combinatorial topology for multiprocessor systems. Discrete Applied Mathematics, 37\/38, special double volume on interconnection networks, pp. 119\u2013146, Jul. 1992.","DOI":"10.1016\/0166-218X(92)90128-W"},{"key":"26_CR8","unstructured":"S.K. Das and S. \u00d6hring. Embeddings of tree-related topologies in hyper Petersen networks. Tech. Rep. CRPDC-92-16, Univ. North Texas, Univ. W\u00fcrzburg, Sep. 1992."},{"key":"26_CR9","doi-asserted-by":"crossref","unstructured":"E. Ganesan and D.K. Pradhan. The hyper-de bruijn multiprocessor networks. In Proc. Conf. on Distributed Computing Systems, pp. 492\u2013499, Arlington, TX, May 1991.","DOI":"10.1109\/ICDCS.1991.148716"},{"key":"26_CR10","volume-title":"Introduction to Parallel Algorithms and Architectures: Arrays \u2014 Trees \u2014 Hypercubes","author":"F. T. Leighton","year":"1992","unstructured":"F.T. Leighton. Introduction to Parallel Algorithms and Architectures: Arrays \u2014 Trees \u2014 Hypercubes. Morgan Kaufmann Publishers, San Mateo, CA, 1992."},{"key":"26_CR11","doi-asserted-by":"crossref","unstructured":"F.T. Leighton, M. Newmann, A.G. Ranade, and E. Schwabe. Dynamic tree embeddings in butterflies and hypercubes. In Proc. of the 1989 ACM Symposium on Parallel Algorithms and Architectures, pp. 224\u2013234, Santa Fe, NM, Jun. 1989.","DOI":"10.1145\/72935.72959"},{"key":"26_CR12","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/978-3-7091-9076-0_13","volume-title":"Computational Graph Theory","author":"B. Monien","year":"1990","unstructured":"B. Monien and H. Sudborough. Embedding one interconnection network in another. In Computational Graph Theory, pp. 257\u2013282, Wien, 1990. Springer Verlag."},{"key":"26_CR13","doi-asserted-by":"crossref","unstructured":"S. \u00d6hring and S.K. Das. Dynamic embeddings of trees and quasi-grids into hyper-de bruijn networks,. In Proc. of the 7th International Parallel Processing Symposium, Newport Beach, CA, pp. 519\u2013523, Apr. 1993.","DOI":"10.1109\/IPPS.1993.262823"},{"key":"26_CR14","unstructured":"S. \u00d6hring and S.K. Das. The folded Petersen cube networks: new competitors for the hypercube. to appear in Proc. of the Fifth IEEE Symposium on Parallel and Distributed Processing, Dallas, TX, Dec. 1993."},{"key":"26_CR15","first-page":"311","volume":"I","author":"S. \u00d6hring","year":"1993","unstructured":"S. \u00d6hring and S.K. Das. The folded Petersen network: a new communication-efficient multiprocessor topology. In Proc. of the 1993 International Conference on Parallel Processing, Volume I, pp. 311\u2013314, St. Charles, IL, Aug. 1993.","journal-title":"Proc. of the 1993 International Conference on Parallel Processing"},{"key":"26_CR16","unstructured":"S. \u00d6hring and S.K. Das. Folded Petersen Cube Network: New Competitors for the Hypercubes. Tech. Rep. CRPDC-93-8, Univ. W\u00fcrzburg, Univ. North Texas, Jun. 1993."},{"key":"26_CR17","doi-asserted-by":"crossref","unstructured":"S. \u00d6hring and S.K. Das. Mapping dynamic data structures on product networks. Tech. Rep. CRPDC-93-5, Univ. W\u00fczburg, Univ. North Texas, Mar. 1993.","DOI":"10.1007\/3-540-57568-5_244"},{"key":"26_CR18","unstructured":"S. \u00d6hring and S.K. Das. Optimal communication primitives on the folded Petersen networks. Tech. Rep. CRPDC-93-13, Univ. W\u00fcrzburg, Univ. North Texas, Sep. 1993."},{"key":"26_CR19","doi-asserted-by":"crossref","unstructured":"S. \u00d6hring. Dynamic embeddings of trees into de Bruijn graphs. In Proc. Second Joint International Conference on Vector and Parallel Processing, CONPAR 92-VAPPV, Lyon, France, Sep. 1992. LNCS 634, pp. 783\u2013784, 1992.","DOI":"10.1007\/3-540-55895-0_487"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57899-4_61.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T22:16:40Z","timestamp":1742595400000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57899-4_61"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540578994","9783540483854"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-57899-4_61","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}