{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T12:11:10Z","timestamp":1648642270081},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1989,2,1]],"date-time":"1989-02-01T00:00:00Z","timestamp":602294400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int J Parallel Prog"],"published-print":{"date-parts":[[1989,2]]},"DOI":"10.1007\/bf01409745","type":"journal-article","created":{"date-parts":[[2005,4,2]],"date-time":"2005-04-02T21:52:43Z","timestamp":1112478763000},"page":"37-68","source":"Crossref","is-referenced-by-count":4,"title":["Topological comparison of perfect shuffle and hypercube"],"prefix":"10.1007","volume":"18","author":[{"given":"Ran","family":"Ginosar","sequence":"first","affiliation":[]},{"given":"David","family":"Egozi","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","volume-title":"Parallel Computers","author":"R. W. Hockney","year":"1980","unstructured":"R. W. Hockney and C. R. Jesshope, Parallel Computers, Adam Hilger Ltd., Bristol (1980)."},{"key":"CR2","volume-title":"Computer Architecture and Parallel Processing","author":"K. Hwang","year":"1984","unstructured":"K. Hwang and F. A. Briggs, Computer Architecture and Parallel Processing, McGraw-Hill Book Co., New York (1984)."},{"key":"CR3","unstructured":"C. L. Seitz, Ensemble Architectures for VLSI-A Survey and Taxanomy,Proc. Conf. Adv. Res. in VLSI, Massachusetts Institute of Technology, pp. 130?135 (1982)."},{"issue":"4","key":"CR4","doi-asserted-by":"crossref","first-page":"484","DOI":"10.1145\/357114.357116","volume":"2","author":"J. T. Schwartz","year":"1980","unstructured":"J. T. Schwartz, Ultracomputers,ACM Trans. Prog. Lang. Sys.,2(4):484?521 (1980).","journal-title":"ACM Trans. Prog. Lang. Sys."},{"issue":"No. 2","key":"CR5","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1109\/T-C.1971.223205","volume":"20","author":"H. S. Stone","year":"1971","unstructured":"H. S. Stone, Parallel Processing with the Perfect Shuffle,IEEE Trans. on Computers, Vol. C-20, No. 2, pp. 153?161 (1971).","journal-title":"IEEE Trans. on Computers"},{"issue":"1","key":"CR6","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1145\/2465.2467","volume":"28","author":"C. L. Seitz","year":"1985","unstructured":"C. L. Seitz, The Cosmic Cube,Comm. ACM,28(1):22?33 (1985).","journal-title":"Comm. ACM"},{"issue":"12","key":"CR7","doi-asserted-by":"crossref","first-page":"1247","DOI":"10.1109\/TC.1984.1676396","volume":"33","author":"C. L. Seitz","year":"1984","unstructured":"C. L. Seitz, Concurrent VLSI Architectures,IEEE Trans. on Computers,C-33 (12):1247?1265 (1984).","journal-title":"IEEE Trans. on Computers, C"},{"key":"CR8","series-title":"Technical Report","volume-title":"Algorithmic Comparison of Hypercubes and Perfect-Nearest-Neighbor Networks","author":"R. Ginosar","year":"1987","unstructured":"R. Ginosar, and D. Egozi, Algorithmic Comparison of Hypercubes and Perfect-Nearest-Neighbor Networks Technical Report, Dept. of Electrical Engineering, Technion, Haifa, Israel, (1987)."},{"key":"CR9","volume-title":"FIFO Buffering Transceiver: A Communication Chip Set for Multiprocessor Systems","author":"C. H. Ng","year":"1982","unstructured":"C. H. Ng, FIFO Buffering Transceiver: A Communication Chip Set for Multiprocessor Systems, MSc Thesis, Dept. of Computer Science, California Institute of Technology, Pasadena, California (1982)."},{"key":"CR10","unstructured":"Y. Rimoni, I. Zisman, R. Ginosar, and U. Weiser, Communication Element for the Versatile MultiComputer,Proc. 15th IEEE Israel Conf., pp. 2.1.2 (1987)."},{"key":"CR11","first-page":"637","volume":"46","author":"R. J. Swan","year":"1977","unstructured":"R. J. Swan, S. H. Fuller, and D. P. Siewiorek, Cm*: A Modular Multimicroprocessor,Proc. AFIPS NCC, No. 46, pp. 637?644 (1977).","journal-title":"Proc. AFIPS NCC"},{"key":"CR12","series-title":"VLSI Architecture","first-page":"471","volume-title":"X-Tree and Y-Components","author":"C. H. Sequin","year":"1983","unstructured":"C. H. Sequin, and R. M. Fujimoto, X-Tree and Y-ComponentsVLSI Architecture, (eds.), B. Randell and P. C. Treleaven, pp. 471?480, Prentice-Hall, New Jersey (1983)."},{"key":"CR13","unstructured":"A. M. Despain, and D. A. Patterson, X-TREE: A Tree Structured Multiprocessor Computer Architecture,Proc. 5th An. Symp. Computer Architecture, pp. 144?151 (1978)."},{"key":"CR14","unstructured":"Intel. Corp., iPSC Documentation (1985)."},{"key":"CR15","unstructured":"Bolt Beranek and Newman Inc., Butterfly Parallel Processing Computer, Cambridge, Massachusetts (1986)."},{"key":"CR16","unstructured":"G. F. Pfister, W. C. Brantley, D. A. George, S. L. Harvey, W. J. Kleinfelder, K. P. McAuliffe, E. A. Melton, V. A. Norton, and J. Weiss, The IBM Research Parallel Prototype (RP3): Introduction and Architecture,Proc. Int'l. Conf. on Parallel Processing, pp. 764?771 (1985)."},{"key":"CR17","doi-asserted-by":"crossref","first-page":"631","DOI":"10.1145\/1500518.1500623","volume":"49","author":"M. C. Sejnowski","year":"1980","unstructured":"M. C. Sejnowski, E. T. Upchurch, R. N. Kapur, D. P. S. Charlu, and G. J. Lipovski, An Overview of the Texas Reconfigurable Array Computer (TRAC),Proc. AFIPS NCC, No. 49, pp. 631?641 (1980).","journal-title":"Proc. AFIPS NCC"},{"issue":"1","key":"CR18","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1145\/859526.859527","volume":"11","author":"D. Gajski","year":"1983","unstructured":"D. Gajski, D. Kuck, and D. Lawrie, CEDAR: A Large Scale Multiprocessor,ACM SIGARCH Computer Architecture News,11(1):7?11 (1983).","journal-title":"ACM SIGARCH Computer Architecture News"},{"issue":"5","key":"CR19","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1109\/TC.1982.1676022","volume":"31","author":"B. W. Arden","year":"1982","unstructured":"B. W. Arden and R. Cinosar, MP\/C: A Multiprocessor\/Computer Architecture,IEEE Trans. on Computers,C-31(5):455?473 (1982).","journal-title":"IEEE Trans. on Computers, C"},{"issue":"9","key":"CR20","doi-asserted-by":"crossref","first-page":"790","DOI":"10.1109\/TC.1986.1676839","volume":"35","author":"C. K. Baru","year":"1986","unstructured":"C. K. Baru and S. Y. W. Su, The Architecture of SM3: A Dynamically Partitionable Multicomputer System,IEEE Trans. on Computer,C-35(9):790?802 (1986).","journal-title":"IEEE Trans. on Computer, C"},{"issue":"4","key":"CR21","first-page":"267","volume":"3","author":"P. Kermani","year":"1979","unstructured":"P. Kermani, and L. Kleinrock, Virtual Cut-Through: A New Computer Communication Switching Technique,Computer Networks,3(4):267?286 (1979).","journal-title":"Computer Networks"},{"key":"CR22","unstructured":"T. Y. Feng, A Survey of Interconnection Networks,IEEE Computer, pp. 12?27 (December 1981)."},{"issue":"6","key":"CR23","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1145\/358645.358660","volume":"24","author":"F. P. Preparata","year":"1981","unstructured":"F. P. Preparata and J. E. Vuillemin, The Cube-connected Cycles: A Versatile Network for Parallel Computation,Comm. ACM 24(6):300?309 (1981).","journal-title":"Comm. ACM"},{"issue":"1","key":"CR24","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1109\/TC.1982.1675886","volume":"31","author":"B. W. Arden","year":"1982","unstructured":"B. W. Arden and H. Lee, A Regular Network for Multicomputer System,IEEE Trans. on Computers,C-31(1):60?69 (1982).","journal-title":"IEEE Trans. on Computers, C"},{"issue":"12","key":"CR25","doi-asserted-by":"crossref","first-page":"923","DOI":"10.1109\/TC.1981.1675731","volume":"30","author":"J. R. Goodman","year":"1981","unstructured":"J. R. Goodman and C. H. Sequin, Hypertree: A Multiprocessor Interconnection Topology,IEEE Trans. on Computer,C-30(12):923?933 (1981).","journal-title":"IEEE Trans. on Computer, C"},{"issue":"12","key":"CR26","doi-asserted-by":"crossref","first-page":"960","DOI":"10.1109\/TC.1981.1675735","volume":"30","author":"R. A. Finkel","year":"1981","unstructured":"R. A. Finkel and M. H. Solomon, The Lens Interconnection Strategy,IEEE Trans. on Computer,C-30(12):960?965 (1981).","journal-title":"IEEE Trans. on Computer, C"},{"issue":"5","key":"CR27","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1109\/TC.1984.1676461","volume":"33","author":"K. W. Doty","year":"1984","unstructured":"K. W. Doty, New Designs for Dense Processor Interconnection Networks,IEEE Trans. on Computer,C-33(5):447?450 (1984).","journal-title":"IEEE Trans. on Computer, C"},{"key":"CR28","volume-title":"Complexity Issues In VLSI","author":"F. T. Leighton","year":"1983","unstructured":"F. T. Leighton, Complexity Issues In VLSI, MIT Press, Cambridge, Massachusetts (1983)."},{"key":"CR29","volume-title":"The Tree Machine: A Highly Concurrent Computing Environment","author":"S. A. Browning","year":"1980","unstructured":"S. A. Browning, The Tree Machine: A Highly Concurrent Computing Environment, Ph. D. Thesis, Dept. of Computer Science, Californa Institute Technology, Pasadena, California (1980)."},{"issue":"4","key":"CR30","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1109\/TC.1981.1675777","volume":"30","author":"B. W. Arden","year":"1981","unstructured":"B. W. Arden and H. Lee, Analysis of Chordal Ring Networks,IEEE Trans. on Computers,C-30(4):291?295 (1981).","journal-title":"IEEE Trans. on Computers, C"},{"key":"CR31","volume-title":"The Extension of Object Oriented Languages to a Homogeneous Concurrent Architecture","author":"C. R. Lang","year":"1982","unstructured":"C. R. Lang, The Extension of Object Oriented Languages to a Homogeneous Concurrent Architecture,? Ph. D. Thesis, California Institute Technology, Pasadena, California (1982)."},{"issue":"2","key":"CR32","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1109\/TC.1983.1676201","volume":"32","author":"A. Gottlieb","year":"1983","unstructured":"A. Gottlieb, R. Grishman, C. P. Kruskal, K. P. McAuliffe, L. Rudolph, and M. Snir, The NYU Ultracomputer-designing an MIMD shared memory parallel computer,IEEE Trans. on Computer,C-32(2):175?189 (1983).","journal-title":"IEEE Trans. on Computer, C"},{"issue":"1","key":"CR33","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1016\/0196-6774(81)90010-9","volume":"2","author":"Y. Shiloach","year":"1981","unstructured":"Y. Shiloach and Vishkin U., Finding the Maximum Merging and Sorting in a Parallel Computation Model,J. of Algorithms,2(1):88?102 (1981).","journal-title":"J. of Algorithms"},{"key":"CR34","volume-title":"A Complexity Theory for VLSI","author":"C. D. Thompson","year":"1980","unstructured":"C. D. Thompson, A Complexity Theory for VLSI, Ph. D. Thesis, Dept. of Computer Science, Carnegie-Mellon Univ., Pittsburgh, Pennsylvania (1980)."},{"key":"CR35","volume-title":"Area-Efficient VLSI Computation","author":"C. E. Leiserson","year":"1983","unstructured":"C. E. Leiserson, Area-Efficient VLSI Computation, MIT Press, Cambridge, Massachusetts (1983)."},{"key":"CR36","unstructured":"C. R. Jesshope, private communication (December 1985)."}],"container-title":["International Journal of Parallel Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01409745.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01409745\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01409745","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T06:04:21Z","timestamp":1556863461000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01409745"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,2]]},"references-count":36,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1989,2]]}},"alternative-id":["BF01409745"],"URL":"https:\/\/doi.org\/10.1007\/bf01409745","relation":{},"ISSN":["0885-7458","1573-7640"],"issn-type":[{"value":"0885-7458","type":"print"},{"value":"1573-7640","type":"electronic"}],"subject":[],"published":{"date-parts":[[1989,2]]}}}