{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T10:14:57Z","timestamp":1725531297080},"publisher-location":"Dordrecht","reference-count":24,"publisher":"Springer Netherlands","isbn-type":[{"type":"print","value":"9781402096877"},{"type":"electronic","value":"9781402096884"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-1-4020-9688-4_6","type":"book-chapter","created":{"date-parts":[[2009,4,20]],"date-time":"2009-04-20T10:15:15Z","timestamp":1240222515000},"page":"133-162","source":"Crossref","is-referenced-by-count":0,"title":["An efficient method for representing and\u00a0transmitting message patterns on\u00a0multiprocessor interconnection networks"],"prefix":"10.1007","author":[{"given":"P. J.","family":"Bernhard","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D. J.","family":"Rosenkrantz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"7","key":"6_CR1","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1109\/TC.1983.1676295","volume":"C-32","author":"D.\u00a0P. Agrawal","year":"1983","unstructured":"D.\u00a0P. Agrawal. Graph theoretical analysis and design of multistate interconnection networks. IEEE Trans. Computers, C-32(7):637\u2013648, 1983.","journal-title":"IEEE Trans. Computers"},{"key":"6_CR2","unstructured":"P.\u00a0J. Bernhard and D.\u00a0J. Rosenkrantz. The complexity of routing through an omega network. In Proc. Twenty-Fifth Annual Allerton Conf. on Communication, Control and Computing, 1987. Also Appears as a Technical Report: Comput. Sci. Dept., SUNY Albany, Albany, N.Y., TR 87-12, 1987."},{"key":"6_CR3","unstructured":"P.\u00a0J. Bernhard and D.\u00a0J. Rosenkrantz. Algebraic structure of mask-representable address sets and message patterns. Technical Report, Comput. Sci. Dept., Clemson University, Clemson, SC, 1990."},{"key":"6_CR4","first-page":"111","volume-title":"Proc. of 1989 Int. Conf. on Parallel Processing","author":"P.\u00a0J. Bernhard","year":"1989","unstructured":"P.\u00a0J. Bernhard, H.\u00a0B. Hunt\u00a0III, and D.\u00a0J.Rosenkrantz. Compaction of message patterns into space-efficient representations for multiprocessor interconnection networks. In Proc. of 1989 Int. Conf. on Parallel Processing, volume\u00a0I, pages\u00a0111\u2013115. Pennsylvania State Univ., University Park, 1989."},{"key":"6_CR5","first-page":"475","volume-title":"Proc. of 1988 Int. Conf. on Parallel Processing","author":"J.\u00a0S. Deogun","year":"1988","unstructured":"J.\u00a0S. Deogun and Z. Fang. A heuristic algorithm for conflict resolution problem in multistage interconnection networks. In Proc. of 1988 Int. Conf. on Parallel Processing, pages\u00a0475\u2013478. Pennsylvania State Univ., University Park, 1988."},{"key":"6_CR6","doi-asserted-by":"publisher","first-page":"691","DOI":"10.1137\/0205048","volume":"5","author":"S. Even","year":"1976","unstructured":"S. Even, A. Itai, and A. Shamir. On the complexity of timetable and multicommodity flow problems. SIAM J. Comput., 5:691\u2013703, 1976.","journal-title":"SIAM J. Comput."},{"key":"6_CR7","unstructured":"Z. Fang. Mathematical theory of multistage interconnection networks analysis. PhD Thesis, Dept. of Computer Science, University of Lincoln, Nebraska, 1984."},{"key":"6_CR8","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.\u00a0R. Garey","year":"1979","unstructured":"M.\u00a0R. Garey and D.\u00a0S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, New York, 1979."},{"key":"6_CR9","unstructured":"R.\u00a0M. Hardy. Personal communication, 1986."},{"issue":"2","key":"6_CR10","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1109\/12.2159","volume":"37","author":"S.\u00a0T. Huang","year":"1988","unstructured":"S.\u00a0T. Huang and S.\u00a0K. Tripathy. Self-routing technique in perfect-shuffle networks using control tags. IEEE Trans. Computers, 37(2):251\u2013256, 1988.","journal-title":"IEEE Trans. Computers"},{"key":"6_CR11","volume-title":"Proc. of the 1988 Symposium on the Frontiers of Massively Parallel Computation","author":"J. Keohane","year":"1988","unstructured":"J. Keohane and R.\u00a0E. Stearns. Routing linear permutations through the omega network in two passes. In Proc. of the 1988 Symposium on the Frontiers of Massively Parallel Computation, George Mason Univ., Fairfax, 1988. Also available as a technical report: Comput. Sci. Dept. SUNY Albany, Albany, N.Y., 1988."},{"key":"6_CR12","doi-asserted-by":"crossref","unstructured":"R.\u00a0R. Koch. Increasing the size of a network by a constant factor can increase performance by more than a constant factor. In Proc. of the 29th Annual Symposium on Foundations of Computer Science, pages 221\u2013230, White Plains, 1988.","DOI":"10.1109\/SFCS.1988.21939"},{"issue":"12","key":"6_CR13","doi-asserted-by":"publisher","first-page":"1145","DOI":"10.1109\/T-C.1975.224157","volume":"C-21","author":"D.\u00a0H. Lawrie","year":"1975","unstructured":"D.\u00a0H. Lawrie. Access and alignment of data in an array processor. IEEE Trans. Computers, C-21(12):1145\u20131155, 1975.","journal-title":"IEEE Trans. Computers"},{"key":"6_CR14","first-page":"278","volume-title":"Proc. of 1989 Int. Conf. on Parallel Processing","author":"D. Nassimi","year":"1989","unstructured":"D. Nassimi. A fault-tolerant routing algorithm for BPC permutations in parallel computers. In Proc. of 1989 Int. Conf. on Parallel Processing, volume\u00a01, pages\u00a0278\u2013287. Pennsylvania State Univ., University Park, 1989."},{"issue":"1","key":"6_CR15","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1145\/322169.322172","volume":"27","author":"D. Nassimi","year":"1980","unstructured":"D. Nassimi and S. Sahni. An optimal routing algorithm for mesh-connected parallel computers. J. ACM, 27(1):6\u201329, 1980.","journal-title":"J. ACM"},{"issue":"5","key":"6_CR16","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1109\/TC.1981.1675791","volume":"C-30","author":"D. Nassimi","year":"1981","unstructured":"D. Nassimi and S. Sahni. A self-routing Benes network and parallel permutation algorithms. IEEE Trans. Computers, C-30(5):332\u2013340, 1981.","journal-title":"IEEE Trans. Computers"},{"issue":"4","key":"6_CR17","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1109\/TC.1982.1676004","volume":"C-31","author":"D. Nassimi","year":"1982","unstructured":"D. Nassimi and S. Sahni. Optimal BPC permutations on a cube connected SIMD computer. IEEE Trans. Computers, C-31(4):338\u2013341, 1982.","journal-title":"IEEE Trans. Computers"},{"key":"6_CR18","unstructured":"R.\u00a0E. Newman-Wolfe. Communication issues in parallel computation. PhD Thesis, TR200, Dept. of Computer Science, The University of Rochester, Rochester, NY, 1986."},{"issue":"4","key":"6_CR19","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1109\/TC.1986.1676763","volume":"C-35","author":"C.\u00a0S. Raghavendra","year":"1986","unstructured":"C.\u00a0S. Raghavendra and A. Varma. Fault-tolerant multiprocessors with redundant-path interconnection networks. IEEE Trans. Computers, C-35(4):307\u2013316, 1986.","journal-title":"IEEE Trans. Computers"},{"issue":"2","key":"6_CR20","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1109\/T-C.1971.223205","volume":"C-20","author":"H.\u00a0S. Stone","year":"1971","unstructured":"H.\u00a0S. Stone. Parallel processing with the perfect shuffle. IEEE Trans. Computers, C-20(2):153\u2013161, 1971.","journal-title":"IEEE Trans. Computers"},{"issue":"7","key":"6_CR21","doi-asserted-by":"publisher","first-page":"810","DOI":"10.1109\/TC.1987.1676978","volume":"C-36","author":"T.\u00a0H. Szymanski","year":"1987","unstructured":"T.\u00a0H. Szymanski and V.\u00a0C. Hamacher. On the permutation capability of multistage interconnection networks. IEEE Trans. Computers, C-36(7):810\u2013822, 1987.","journal-title":"IEEE Trans. Computers"},{"key":"6_CR22","unstructured":"A.\u00a0M. Varma. Design and analysis of reliable interconnection networks. PhD Thesis, Dept. of Elect. Eng. Systems, University of Southern Cal., Los Angeles, CA 90089-0781, 1986."},{"issue":"8","key":"6_CR23","doi-asserted-by":"publisher","first-page":"694","DOI":"10.1109\/TC.1980.1675651","volume":"C-29","author":"C.\u00a0L. Wu","year":"1980","unstructured":"C.\u00a0L. Wu and T.\u00a0Y. Feng. On a class of multistage interconnection networks. IEEE Trans. Computers, C-29(8):694\u2013702, 1980.","journal-title":"IEEE Trans. Computers"},{"issue":"4","key":"6_CR24","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1109\/TC.1981.1675778","volume":"C-30","author":"P.\u00a0C. Yew","year":"1981","unstructured":"P.\u00a0C. Yew and D.\u00a0H. Lawrie. An easily controlled network for frequently used permutations. IEEE Trans. Computers, C-30(4):296\u2013301, 1981.","journal-title":"IEEE Trans. Computers"}],"container-title":["Fundamental Problems in Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4020-9688-4_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,29]],"date-time":"2021-04-29T05:55:39Z","timestamp":1619675739000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-1-4020-9688-4_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9781402096877","9781402096884"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-1-4020-9688-4_6","relation":{},"subject":[],"published":{"date-parts":[[2009]]}}}