{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T12:07:52Z","timestamp":1648728472059},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2011,3,11]],"date-time":"2011-03-11T00:00:00Z","timestamp":1299801600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2012,9]]},"DOI":"10.1007\/s11227-011-0574-8","type":"journal-article","created":{"date-parts":[[2011,3,10]],"date-time":"2011-03-10T16:32:41Z","timestamp":1299774761000},"page":"371-393","source":"Crossref","is-referenced-by-count":2,"title":["Towards understanding optimal MIMD queueless routing of arbitrary permutations on hypercubes"],"prefix":"10.1007","volume":"61","author":[{"given":"Jean-Pierre","family":"Jung","sequence":"first","affiliation":[]},{"given":"Ibrahima","family":"Sakho","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,3,11]]},"reference":[{"issue":"5","key":"574_CR1","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1093\/comjnl\/30.5.425","volume":"30","author":"HR Arabnia","year":"1987","unstructured":"Arabnia HR, Oliver MA (1987) A transputer network for the arbitrary rotation of digitised images. Comput J 30(5):425\u2013433","journal-title":"Comput J"},{"key":"574_CR2","first-page":"349","volume-title":"Proceedings of the 7th annual international high performance computing conference. The 1993 high performance computing: new horizons supercomputing symposium","author":"HR Arabnia","year":"1993","unstructured":"Arabnia HR, Smith JW (1993) A reconfigurable interconnection network for imaging operations and its implementation using a multi-stage switching box. In: Proceedings of the 7th annual international high performance computing conference. The 1993 high performance computing: new horizons supercomputing symposium, Calgary, Alberta, Canada, June 1993, pp 349\u2013357"},{"issue":"10","key":"574_CR3","first-page":"58","volume":"3","author":"Y Liu","year":"2008","unstructured":"Liu Y, Han J, Du H (2008) A hypercube-based scalable interconnection. Netw Massively Parallel Comput J Comput 3(10):58\u201365","journal-title":"Netw Massively Parallel Comput J Comput"},{"key":"574_CR4","unstructured":"Gopalakrishna Kini N, Sathish Kumar M, Mruthyunjaya HS (2009) Analysis and comparison of torus embedded hypercube scalable interconnection network for parallel architecture. IJCSNS Int J Comput Sci Netw Secur 9(1)"},{"key":"574_CR5","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1109\/IPPS.1992.223011","volume-title":"Proceedings of international parallel processing symposium","author":"JT Draper","year":"1992","unstructured":"Draper JT, Ghosh J (1992) Multipath e-cube algorithms (MECA) for adaptive wormhole routing and broadcasting in k-ary n-cubes. In: Proceedings of international parallel processing symposium, pp 407\u2013410"},{"key":"574_CR6","first-page":"I103","volume-title":"Proceedings of the 1989 international conference on parallel processing","author":"T Szymanski","year":"1989","unstructured":"Szymanski T (1989) On the permutation capability of a circuit switched hypercube. In: Proceedings of the 1989 international conference on parallel processing, pp I103\u2013I110"},{"key":"574_CR7","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/0020-0190(90)90106-8","volume":"35","author":"A Lubiw","year":"1990","unstructured":"Lubiw A (1990) Counter example to a conjecture of Szymanski on hypercube routing. Inf Process Lett 35:57\u201361","journal-title":"Inf Process Lett"},{"issue":"5","key":"574_CR8","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0020-0190(94)90002-7","volume":"51","author":"X Shen","year":"1994","unstructured":"Shen X, Hu Q, Liang W (1994) Realization of arbitrary permutations on a hypercube. Inf Process Lett 51(5):237\u2013243","journal-title":"Inf Process Lett"},{"key":"574_CR9","first-page":"445","volume-title":"Proceedings of the 8th annual ACM-SIAM symposium on discrete algorithms","author":"L Zhang","year":"1997","unstructured":"Zhang L (1997) Optimal bounds for matching routing on trees. In: Proceedings of the 8th annual ACM-SIAM symposium on discrete algorithms, New Orleans, Louisiana, January 1997, pp 445\u2013453"},{"key":"574_CR10","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/S0166-218X(96)00019-4","volume":"72","author":"F Hwang","year":"1997","unstructured":"Hwang F, Yao Y, Grammatikakis M (1997) A d-move local permutation routing for d-cube. Discrete Appl Math 72:199\u2013207","journal-title":"Discrete Appl Math"},{"key":"574_CR11","unstructured":"Hwang F, Yao Y, Dasgupta B Some permutation routing algorithms for low dimensional hypercubes"},{"key":"574_CR12","doi-asserted-by":"crossref","first-page":"530","DOI":"10.1145\/380752.380848","volume-title":"Proceedings of the 33rd annual ACM-symposium on theory of computing","author":"B V\u00f6cking","year":"2001","unstructured":"V\u00f6cking B (2001) Almost optimal permutation routing on hypercubes. In: Proceedings of the 33rd annual ACM-symposium on theory of computing. ACM Press, New York, pp 530\u2013539"},{"issue":"4","key":"574_CR13","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1109\/TC.1982.1676004","volume":"C-31","author":"D Nassimi","year":"1982","unstructured":"Nassimi D, Sahni S (1982) Optimal BPC permutations on a cube connected SIMD computer. IEEE Trans Comput C-31(4):338\u2013341","journal-title":"IEEE Trans Comput"},{"issue":"3","key":"574_CR14","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1137\/0609037","volume":"9","author":"SL Johnsson","year":"1988","unstructured":"Johnsson SL, Ho CT (1988) Algorithms for matrix transposition for boolean n-cube configured ensemble architectures. SIAM J Matrix Appl 9(3):419\u2013454","journal-title":"SIAM J Matrix Appl"},{"issue":"1\u20133","key":"574_CR15","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/0166-218X(94)90189-9","volume":"53","author":"SL Johnsson","year":"1994","unstructured":"Johnsson SL, Ho CT (1994) Optimal communication channel utilization for matrix transpose and related permutations on boolean. Discrete Appl Math 53(1\u20133):251\u2013274","journal-title":"Discrete Appl Math"},{"key":"574_CR16","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1002\/net.3230230420","volume":"23","author":"M Ramras","year":"1993","unstructured":"Ramras M (1993) Routing permutations on a graph. Networks 23:391\u2013398","journal-title":"Networks"},{"key":"574_CR17","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1006\/jpdc.1997.1358","volume":"44","author":"Q-P Gu","year":"1997","unstructured":"Gu Q-P, Tamaki H (1997) Routing a permutation in the hypercube by two sets of edge disjoint paths. J Parallel Distrib Comput 44:147\u2013152","journal-title":"J Parallel Distrib Comput"},{"key":"574_CR18","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1002\/net.20325","volume":"55","author":"AK Laing","year":"2010","unstructured":"Laing AK, Krumme DW (2010) Optimal permutation routing for low-dimensional hypercubes. Networks 55:149\u2013167","journal-title":"Networks"},{"key":"574_CR19","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/978-3-642-14390-8_3","volume-title":"Parallel processing and applied mathematics","author":"J-P Jung","year":"2010","unstructured":"Jung J-P, Sakho I (2010) Graphs partitioning: an optimal MIMD queueless routing for BPC-permutations on hypercubes. In: Parallel processing and applied mathematics. LNCS, vol 6067, pp 21\u201330"},{"key":"574_CR20","doi-asserted-by":"crossref","unstructured":"Jung J-P, Sakho I (2011) A new approach for optimal MIMD queueless routing of omega and inverse-omega permutations on hypercubes submitted to NPA","DOI":"10.5296\/npa.v3i1.563"},{"key":"574_CR21","volume-title":"Graphes","author":"C Berge","year":"1983","unstructured":"Berge C (1983) Graphes, 3th edn. Dunod, Paris","edition":"3"},{"key":"574_CR22","unstructured":"Sakarovitch M (1982) Techniques math\u00e9matiques de\u00a0la\u00a0recherche op\u00e9rationnelle. Universit\u00e9 Scientifique et M\u00e9dicale et Institut National Polytechnique de\u00a0Grenoble"},{"key":"574_CR23","unstructured":"Neiman VI (1969) Structures et commandes des r\u00e9seaux sans blocage. Annales des T\u00e9l\u00e9com, Juillet\u2013Ao\u00fbt 1969"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-011-0574-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11227-011-0574-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-011-0574-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,20]],"date-time":"2021-11-20T06:29:30Z","timestamp":1637389770000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11227-011-0574-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,3,11]]},"references-count":23,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2012,9]]}},"alternative-id":["574"],"URL":"https:\/\/doi.org\/10.1007\/s11227-011-0574-8","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,3,11]]}}}