{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T03:37:48Z","timestamp":1648697868265},"reference-count":21,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1998,11,1]],"date-time":"1998-11-01T00:00:00Z","timestamp":909878400000},"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":["Journal of Systems Architecture"],"published-print":{"date-parts":[[1998,11]]},"DOI":"10.1016\/s1383-7621(97)00082-9","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T18:33:56Z","timestamp":1049740436000},"page":"231-249","source":"Crossref","is-referenced-by-count":0,"title":["On communications performance and processor efficiency"],"prefix":"10.1016","volume":"45","author":[{"given":"Don M.","family":"Goodeve","sequence":"first","affiliation":[]},{"given":"Andy.M.","family":"Tyrrell","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1383-7621(97)00082-9_BIB1","first-page":"267","article-title":"Virtual Cut-through: A new computer communication switching technique","volume":"3","author":"Kermani","year":"1979","journal-title":"Computer Networks"},{"issue":"2","key":"10.1016\/S1383-7621(97)00082-9_BIB2","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1109\/2.191995","article-title":"A survey of wormhole routing techniques in direct networks","volume":"26","author":"Ni","year":"1993","journal-title":"IEEE Computer"},{"key":"10.1016\/S1383-7621(97)00082-9_BIB3","unstructured":"C. Barnaby, M.D. May, Performance of C104 networks, in: M.D. May, P.W. Thompson, P.H. Welch (Eds.), Networks, Routers and Transputers, Ch. 7, IOS Press, 1993, pp. 105\u2013117"},{"key":"10.1016\/S1383-7621(97)00082-9_BIB4","unstructured":"W. Dally, Network and processor architecture for message-driven computers, in: VLSI and Parallel Computation, Ch. 3, Morgan Kauffmann, San Mateo, CA, 1990, pp. 140\u2013222"},{"issue":"4","key":"10.1016\/S1383-7621(97)00082-9_BIB5","doi-asserted-by":"crossref","first-page":"398","DOI":"10.1109\/71.97897","article-title":"Limits on interconnection network performance","volume":"2","author":"Agarwal","year":"1991","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"10.1016\/S1383-7621(97)00082-9_BIB6","unstructured":"D.M. Goodeve, A.M. Tyrrell, Analysis of dedicated hardware interconnection for parallel computers, in: A. Kumar, K. Kamel (Eds.), Parallel and Distributed Computing and Systems \u2013 Proceedings of the ISCA conference, October 1993, pp. 137\u2013140"},{"key":"10.1016\/S1383-7621(97)00082-9_BIB7","unstructured":"D.M. Goodeve, Performance of multiprocessor communications networks, Ph.D. Thesis, Department of Electronics, University of York, York, UK, May 1994"},{"key":"10.1016\/S1383-7621(97)00082-9_BIB8","doi-asserted-by":"crossref","first-page":"675","DOI":"10.1016\/0165-6074(90)90317-3","article-title":"A performance analysis of toroidal mesh networks","volume":"30","author":"Macharia","year":"1990","journal-title":"Microprocessing and Microprogramming"},{"key":"10.1016\/S1383-7621(97)00082-9_BIB9","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1145\/2465.2467","article-title":"The cosmic cube","volume":"28","author":"Seitz","year":"1985","journal-title":"Communications of the ACM"},{"key":"10.1016\/S1383-7621(97)00082-9_BIB10","unstructured":"W.F. McColl, General purpose parallel computing, in: A.M. Gibbons, P. Spirakis (Eds.), Lectures on Parallel Computation, Proceedings of the 1991 ALCOM Spring School on Parallel Computation, Cambridge Univ. Press, 1993, pp. 337\u2013391"},{"key":"10.1016\/S1383-7621(97)00082-9_BIB11","doi-asserted-by":"crossref","unstructured":"L.G. Valiant, General purpose parallel computation, in: J. van Leeuwen (Ed.), Handbook of Theoretical Computer Science, Elsevier, 1990, pp. 944\u2013971","DOI":"10.1016\/B978-0-444-88071-0.50023-0"},{"issue":"3","key":"10.1016\/S1383-7621(97)00082-9_BIB12","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1109\/TC.1981.1675756","article-title":"On the mapping problem","volume":"C 30","author":"Bokhari","year":"1981","journal-title":"IEEE Transactions on Computers"},{"issue":"3","key":"10.1016\/S1383-7621(97)00082-9_BIB13","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1145\/158439.158908","article-title":"Models of machines and computation for mapping in multicomputers","volume":"25","author":"Norman","year":"1993","journal-title":"Computing Surveys"},{"key":"10.1016\/S1383-7621(97)00082-9_BIB14","unstructured":"L. Kleinrock, Queuing Theory, vol. 1 \u2013 Theory, Wiley, 1975"},{"issue":"12","key":"10.1016\/S1383-7621(97)00082-9_BIB15","doi-asserted-by":"crossref","first-page":"1091","DOI":"10.1109\/TC.1983.1676169","article-title":"The performance of multistage interconnection networks for multiprocessors","volume":"C 32","author":"Kruskal","year":"1983","journal-title":"IEEE Transactions on Computers"},{"key":"10.1016\/S1383-7621(97)00082-9_BIB16","doi-asserted-by":"crossref","unstructured":"Little et al., A proof of the queuing formula: L=\u03bb\/W, Operations Research 9 (1961) 383\u2013387","DOI":"10.1287\/opre.9.3.383"},{"key":"10.1016\/S1383-7621(97)00082-9_BIB17","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1090\/S0025-5718-1965-0178586-1","article-title":"An algorithm for the machine calculation of complex fourier series","volume":"19","author":"Cooley","year":"1965","journal-title":"Mathematics of Computation"},{"key":"10.1016\/S1383-7621(97)00082-9_BIB18","doi-asserted-by":"crossref","unstructured":"K. Bolding, L. Snyder, Mesh and torus chaotic routing, Technical Report CSE-91-04-04, University of Washington, Seattle, 1991","DOI":"10.21236\/ADA246284"},{"issue":"5","key":"10.1016\/S1383-7621(97)00082-9_BIB19","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1109\/2.211888","article-title":"Adaptive routing protocols for hypercube interconnection networks","volume":"26","author":"Gaughan","year":"1993","journal-title":"IEEE Computer"},{"key":"10.1016\/S1383-7621(97)00082-9_BIB20","doi-asserted-by":"crossref","unstructured":"T. Leighton, Methods for message routing in parallel machines, in: Proceedings of the Twenty-Fourth Annual ACM Symposium on the Theory of Computing, ACM, May 1992, pp. 77\u201396","DOI":"10.1145\/129712.129721"},{"issue":"6","key":"10.1016\/S1383-7621(97)00082-9_BIB21","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1109\/MC.1987.1663593","article-title":"The performance of multicomputer interconnection networks","volume":"20","author":"Reed","year":"1987","journal-title":"IEEE Computer"}],"container-title":["Journal of Systems Architecture"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1383762197000829?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1383762197000829?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,28]],"date-time":"2020-01-28T21:36:55Z","timestamp":1580247415000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1383762197000829"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,11]]},"references-count":21,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1998,11]]}},"alternative-id":["S1383762197000829"],"URL":"https:\/\/doi.org\/10.1016\/s1383-7621(97)00082-9","relation":{},"ISSN":["1383-7621"],"issn-type":[{"value":"1383-7621","type":"print"}],"subject":[],"published":{"date-parts":[[1998,11]]}}}