{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,7]],"date-time":"2023-01-07T12:30:49Z","timestamp":1673094649656},"reference-count":33,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1998,6,1]],"date-time":"1998-06-01T00:00:00Z","timestamp":896659200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1998,6]]},"DOI":"10.1016\/s0020-0190(98)00064-7","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T13:32:24Z","timestamp":1049722344000},"page":"269-276","source":"Crossref","is-referenced-by-count":5,"title":["Real-time emulations of bounded-degree networks"],"prefix":"10.1016","volume":"66","author":[{"given":"Bruce M.","family":"Maggs","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eric J.","family":"Schwabe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(98)00064-7_BIB1","series-title":"Proc. EURO-PAR '95","first-page":"193","article-title":"Optimal emulation of meshes on meshes of trees","author":"Achilles","year":"1995"},{"key":"10.1016\/S0020-0190(98)00064-7_BIB2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02579338","article-title":"Sorting in c log n parallel steps","volume":"3","author":"Ajtai","year":"1983","journal-title":"Combinatorica"},{"issue":"3","key":"10.1016\/S0020-0190(98)00064-7_BIB3","doi-asserted-by":"crossref","first-page":"600","DOI":"10.1137\/S0097539791221499","article-title":"On-line algorithms for path selection in a nonblocking network","volume":"25","author":"Arora","year":"1996","journal-title":"SIAM J. Comput."},{"issue":"10","key":"10.1016\/S0020-0190(98)00064-7_BIB4","doi-asserted-by":"crossref","first-page":"1306","DOI":"10.1109\/12.5995","article-title":"On multidimensional arrays of processors","volume":"37","author":"Atallah","year":"1988","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0020-0190(98)00064-7_BIB5","first-page":"64","article-title":"Complexity of an optimum nonblocking switching network without reconnections","volume":"9","author":"Bassalygo","year":"1974","journal-title":"Probl. Inform. Transm."},{"issue":"3","key":"10.1016\/S0020-0190(98)00064-7_BIB6","doi-asserted-by":"crossref","first-page":"614","DOI":"10.1145\/210346.210417","article-title":"Deterministic on-line routing on area-universal networks","volume":"42","author":"Bay","year":"1995","journal-title":"J. ACM"},{"issue":"2","key":"10.1016\/S0020-0190(98)00064-7_BIB7","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1145\/226643.226658","article-title":"Optimal emulations by butterfly-like networks","volume":"43","author":"Bhatt","year":"1996","journal-title":"J. ACM"},{"issue":"2","key":"10.1016\/S0020-0190(98)00064-7_BIB8","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1016\/0022-0000(84)90071-0","article-title":"A framework for solving VLSI graph layout problems","volume":"28","author":"Bhatt","year":"1984","journal-title":"J. Comput. Syst. Sci."},{"issue":"6","key":"10.1016\/S0020-0190(98)00064-7_BIB9","doi-asserted-by":"crossref","DOI":"10.1137\/S0097539793255011","article-title":"Reconfiguring arrays with faults, Part I: Worst-case faults","volume":"26","author":"Cole","year":"1997","journal-title":"SIAM J. Comput."},{"issue":"1","key":"10.1016\/S0020-0190(98)00064-7_BIB10","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1142\/S0129626492000131","article-title":"The cube-connected cycles network is a subgraph of the butterfly network","volume":"2","author":"Feldmann","year":"1992","journal-title":"Parallel Process. Lett."},{"key":"10.1016\/S0020-0190(98)00064-7_BIB11","article-title":"Encoding graphs in graphs","author":"Fellows","year":"1985"},{"key":"10.1016\/S0020-0190(98)00064-7_BIB12","series-title":"Randomness and Computation","first-page":"345","article-title":"Randomized routing on fattrees","volume":"Vol. 5","author":"Greenberg","year":"1989"},{"issue":"1","key":"10.1016\/S0020-0190(98)00064-7_BIB13","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1145\/256292.256299","article-title":"Work-preserving emulations of fixed-connection networks","volume":"44","author":"Koch","year":"1997","journal-title":"J. ACM"},{"key":"10.1016\/S0020-0190(98)00064-7_BIB14","series-title":"Proc. 6th Ann. ACM Symposium on Parallel Algorithms and Architectures","first-page":"132","article-title":"Bandwidth-based lower bounds on slowdown for efficient emulations of fixed-connection networks","author":"Kruskal","year":"1994"},{"key":"10.1016\/S0020-0190(98)00064-7_BIB15","series-title":"Complexity Issues in VLSI","author":"Leighton","year":"1983"},{"issue":"4","key":"10.1016\/S0020-0190(98)00064-7_BIB16","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1109\/TC.1985.5009385","article-title":"Tight bounds on the complexity of parallel sorting","volume":"C-34","author":"Leighton","year":"1985","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0020-0190(98)00064-7_BIB17","series-title":"Introduction to Parallel Algorithms and Architectures: Arrays \u2022 Trees \u2022 Hypercubes","author":"Leighton","year":"1992"},{"issue":"5","key":"10.1016\/S0020-0190(98)00064-7_BIB18","doi-asserted-by":"crossref","first-page":"578","DOI":"10.1109\/12.142684","article-title":"Fast algorithms for routing around faults in multibutterflies and randomly-wired splitter networks","volume":"41","author":"Leighton","year":"1992","journal-title":"IEEE Trans. Comput."},{"issue":"1","key":"10.1016\/S0020-0190(98)00064-7_BIB19","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1006\/jagm.1994.1030","article-title":"Randomized routing and sorting on fixed-connection networks","volume":"17","author":"Leighton","year":"1994","journal-title":"J. Algorithms"},{"issue":"10","key":"10.1016\/S0020-0190(98)00064-7_BIB20","doi-asserted-by":"crossref","first-page":"892","DOI":"10.1109\/TC.1985.6312192","article-title":"Fat-trees: Universal networks for hardware-efficient supercomputing","volume":"C-34","author":"Leiserson","year":"1985","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0020-0190(98)00064-7_BIB21","series-title":"Proc. 29th Annual ACM Symposium on Theory of Computing","first-page":"517","article-title":"Improved routing and sorting on multibutterflies","author":"Maggs","year":"1997"},{"key":"10.1016\/S0020-0190(98)00064-7_BIB22","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF00265559","article-title":"Efficiency of universal parallel computers","volume":"19","author":"der Heide","year":"1983","journal-title":"Acta Informatica"},{"issue":"1","key":"10.1016\/S0020-0190(98)00064-7_BIB23","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1137\/0215008","article-title":"Efficient simulations among several models of parallel computers","volume":"15","author":"der Heide","year":"1986","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0020-0190(98)00064-7_BIB24","series-title":"Proc. 6th Symposium on Theoretical Aspects of Computer Science","first-page":"120","article-title":"Time-optimal simulations of networks by universal parallel computers","volume":"Vol. 349","author":"der Heide","year":"1989"},{"key":"10.1016\/S0020-0190(98)00064-7_BIB25","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/BF01840378","article-title":"Improved sorting networks with O(log N) depth","volume":"5","author":"Paterson","year":"1990","journal-title":"Algorithmica"},{"issue":"5","key":"10.1016\/S0020-0190(98)00064-7_BIB26","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1145\/358645.358660","article-title":"The cube-connected cycles: A versatile network for parallel computation","volume":"24","author":"Preparata","year":"1981","journal-title":"Comm. ACM"},{"key":"10.1016\/S0020-0190(98)00064-7_BIB27","series-title":"Proc. 8th Annual ACM Symposium on Parallel Algorithms and Architectures","first-page":"176","article-title":"On the slowdown of efficient simulations of multibutterflies","author":"Rappoport","year":"1996"},{"issue":"5","key":"10.1016\/S0020-0190(98)00064-7_BIB28","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0020-0190(92)90217-J","article-title":"Embedding meshes of trees into deBruijn graphs","volume":"43","author":"Schwabe","year":"1992","journal-title":"Inform. Process. Lett."},{"issue":"2","key":"10.1016\/S0020-0190(98)00064-7_BIB29","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/0020-0190(93)90040-G","article-title":"Constant-slowdown simulations of normal hypercube algorithms on the butterfly network","volume":"45","author":"Schwabe","year":"1993","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0020-0190(98)00064-7_BIB30","first-page":"137","article-title":"On an ordering of the set of vertices of a connected graph","volume":"412","author":"Sekanina","year":"1960","journal-title":"Publ. Fac. Sci. Univ. Brno"},{"issue":"2","key":"10.1016\/S0020-0190(98)00064-7_BIB31","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1109\/T-C.1971.223205","article-title":"Parallel processing with the perfect shuffle","volume":"C-20","author":"Stone","year":"1971","journal-title":"IEEE Trans. Comput."},{"issue":"1","key":"10.1016\/S0020-0190(98)00064-7_BIB32","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1145\/147508.147517","article-title":"An O(log N) deterministic packet routing scheme","volume":"39","author":"Upfal","year":"1992","journal-title":"J. ACM"},{"key":"10.1016\/S0020-0190(98)00064-7_BIB33","article-title":"Emulations and embeddings of meshes of trees and hypercubes of cliques","author":"Zhang","year":"1995"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019098000647?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019098000647?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T10:55:07Z","timestamp":1556362507000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019098000647"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,6]]},"references-count":33,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1998,6]]}},"alternative-id":["S0020019098000647"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(98)00064-7","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1998,6]]}}}