{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T22:24:16Z","timestamp":1757629456870,"version":"3.44.0"},"reference-count":31,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1991,2,1]],"date-time":"1991-02-01T00:00:00Z","timestamp":665366400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1991,2,1]],"date-time":"1991-02-01T00:00:00Z","timestamp":665366400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Parallel and Distributed Computing"],"published-print":{"date-parts":[[1991,2]]},"DOI":"10.1016\/0743-7315(91)90116-q","type":"journal-article","created":{"date-parts":[[2004,2,23]],"date-time":"2004-02-23T15:14:09Z","timestamp":1077549249000},"page":"97-111","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":6,"title":["Generalized schemes for access and alignment of data in parallel processors with self-routing interconnection networks"],"prefix":"10.1016","volume":"11","author":[{"given":"Rajendra V.","family":"Boppana","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C.S.","family":"Raghavendra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0743-7315(91)90116-Q_BIB1","series-title":"Proc. International Conference on Parallel Processing","first-page":"103","article-title":"On array storage for conflict-free memory access for parallel processors","author":"Balakrishnan","year":"1988"},{"issue":"No. 2","key":"10.1016\/0743-7315(91)90116-Q_BIB2","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1109\/TC.1977.5009297","article-title":"The multidimensional access memory in STARAN","volume":"C-26","author":"Batcher","year":"1977","journal-title":"IEEE Trans. Comput."},{"year":"1965","series-title":"Mathematical Theory of Connecting Networks and Telephone Traffic","author":"Bene\u0161","key":"10.1016\/0743-7315(91)90116-Q_BIB3"},{"year":"1977","series-title":"A Survey of Modern Algebra","author":"Birhkoff","key":"10.1016\/0743-7315(91)90116-Q_BIB4"},{"key":"10.1016\/0743-7315(91)90116-Q_BIB5","series-title":"Proc. International Conference on Parallel Processing","first-page":"196","article-title":"On self-routing in Bene\u0161 and (2n \u2212 1)-stage shuffle-exchange networks","author":"Boppana","year":"1988"},{"key":"10.1016\/0743-7315(91)90116-Q_BIB6","series-title":"Proc. Fifth Distibuted Memory Computing Conference","article-title":"Optimal self-routing of linear-complement permutations in hypercubes","author":"Boppana","year":"1990"},{"issue":"No. 12","key":"10.1016\/0743-7315(91)90116-Q_BIB7","doi-asserted-by":"crossref","first-page":"1566","DOI":"10.1109\/T-C.1971.223171","article-title":"The organization and use of parallel memories","volume":"C-20","author":"Budnik","year":"1971","journal-title":"IEEE Trans. Comput."},{"year":"1974","series-title":"Latin Squares and their Applications","author":"Denes","key":"10.1016\/0743-7315(91)90116-Q_BIB8"},{"key":"10.1016\/0743-7315(91)90116-Q_BIB9","series-title":"Proc. International Conference on Parallel Processing","first-page":"276","article-title":"XOR-schemes: A flexible data organization in parallel memories","author":"Frailong","year":"1985"},{"key":"10.1016\/0743-7315(91)90116-Q_BIB10","series-title":"Proc. International Conference on Parallel Processing","first-page":"524","article-title":"Cedar\u2014A large-scale multiprocessor","author":"Gajski","year":"1983"},{"year":"1989","series-title":"Matrix Computations","author":"Golub","key":"10.1016\/0743-7315(91)90116-Q_BIB11"},{"issue":"No. 2","key":"10.1016\/0743-7315(91)90116-Q_BIB12","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1109\/TC.1983.1676201","article-title":"The NYU Ultracomputer\u2014Designing a MIMD, shared memory parallel machine","volume":"C-32","author":"Gottlieb","year":"1983","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0743-7315(91)90116-Q_BIB13","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1016\/0097-3165(77)90007-3","article-title":"A complete solution to the existence and noexistence of knut vik designs and orthogoanl knut vik designs","volume":"22","author":"Hedayat","year":"1977","journal-title":"J. Combinatorial Theory, Ser. A"},{"year":"1971","series-title":"Linear Algebra","author":"Hoffman","key":"10.1016\/0743-7315(91)90116-Q_BIB14"},{"key":"10.1016\/0743-7315(91)90116-Q_BIB15","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1016\/0097-3165(79)90027-X","article-title":"Crisscross latin squares","volume":"27","author":"Hwang","year":"1979","journal-title":"J. Combin. Theory Ser. A"},{"key":"10.1016\/0743-7315(91)90116-Q_BIB16","series-title":"Proc. International Symp. on Comput. Arch.","first-page":"372","article-title":"Perfect latin squares and parallel array access","author":"Kim","year":"1989"},{"issue":"No. 12","key":"10.1016\/0743-7315(91)90116-Q_BIB17","doi-asserted-by":"crossref","DOI":"10.1109\/T-C.1975.224157","article-title":"Access and alignment of data in an array processor","volume":"C-24","author":"Lawrie","year":"1975","journal-title":"IEEE Trans. Comput."},{"issue":"No. 5","key":"10.1016\/0743-7315(91)90116-Q_BIB18","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1109\/TC.1982.1676020","article-title":"The prime memory system for array access","volume":"C-31","author":"Lawrie","year":"1982","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0743-7315(91)90116-Q_BIB19","series-title":"Proc. International Symp. on Comput. Arch.","first-page":"232","article-title":"Scrambled storage for parallel memory systems","author":"Lee","year":"1988"},{"issue":"No. 1","key":"10.1016\/0743-7315(91)90116-Q_BIB20","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/0020-0190(89)90180-4","article-title":"On access and alignment of data in a parallel processor","volume":"33","author":"Lee","year":"1989","journal-title":"Inform. Process. Lett."},{"issue":"No. 5","key":"10.1016\/0743-7315(91)90116-Q_BIB21","doi-asserted-by":"crossref","DOI":"10.1109\/TC.1981.1675791","article-title":"A self-routing Bene\u0161 network and parallel permutation algorithms","volume":"C-30","author":"Nassimi","year":"1981","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0743-7315(91)90116-Q_BIB22","series-title":"Proc. International Conference on Parallel Processing","first-page":"247","article-title":"A class of boolean linear transformations for conflict free power-of-two stride access","author":"Norton","year":"1987"},{"issue":"No. 3","key":"10.1016\/0743-7315(91)90116-Q_BIB23","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1109\/TC.1980.1675553","article-title":"Notes on shuffle\/exchange-type switching networks","volume":"C-29","author":"Parker","year":"1980","journal-title":"IEEE Trans. Comput."},{"issue":"No. 5","key":"10.1016\/0743-7315(91)90116-Q_BIB24","doi-asserted-by":"crossref","DOI":"10.1109\/TC.1977.1674863","article-title":"The indirect binary n-cube microprocessor array","volume":"C-26","author":"Pease","year":"1977","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0743-7315(91)90116-Q_BIB25","series-title":"Proc. International Conference on Parallel Processing","first-page":"764","article-title":"The IBM research parallel processor prototype (RP3): Introduction and architecture","author":"Pfister","year":"1985"},{"year":"1963","series-title":"Combinatorial Mathematics","author":"Ryser","key":"10.1016\/0743-7315(91)90116-Q_BIB26"},{"issue":"No. 5","key":"10.1016\/0743-7315(91)90116-Q_BIB27","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1109\/TC.1978.1675122","article-title":"Theoretical limitations on the efficient use of parallel memories","volume":"C-27","author":"Shapiro","year":"1978","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0743-7315(91)90116-Q_BIB28","unstructured":"Varma, A. Personal communication, 1989."},{"issue":"No. 1","key":"10.1016\/0743-7315(91)90116-Q_BIB29","doi-asserted-by":"crossref","DOI":"10.1145\/321439.321449","article-title":"A permutation network","volume":"15","author":"Waksman","year":"1968","journal-title":"J. Assoc. Comput. Mach."},{"issue":"No. 6","key":"10.1016\/0743-7315(91)90116-Q_BIB30","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1109\/TC.1985.5009402","article-title":"The structure of periodic storage schemes for parallel memories","volume":"C-34","author":"Wijshoff","year":"1985","journal-title":"IEEE Trans. Comput."},{"issue":"No. 4","key":"10.1016\/0743-7315(91)90116-Q_BIB31","article-title":"An easily controlled network for frequently used permutations","volume":"C-30","author":"Yew","year":"1981","journal-title":"IEEE Trans. Comput."}],"container-title":["Journal of Parallel and Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:074373159190116Q?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:074373159190116Q?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T14:30:02Z","timestamp":1757514602000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/074373159190116Q"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,2]]},"references-count":31,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1991,2]]}},"alternative-id":["074373159190116Q"],"URL":"https:\/\/doi.org\/10.1016\/0743-7315(91)90116-q","relation":{},"ISSN":["0743-7315"],"issn-type":[{"type":"print","value":"0743-7315"}],"subject":[],"published":{"date-parts":[[1991,2]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Generalized schemes for access and alignment of data in parallel processors with self-routing interconnection networks","name":"articletitle","label":"Article Title"},{"value":"Journal of Parallel and Distributed Computing","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0743-7315(91)90116-Q","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1991 Published by Elsevier Inc.","name":"copyright","label":"Copyright"}]}}