{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,26]],"date-time":"2023-10-26T19:23:52Z","timestamp":1698348232657},"reference-count":32,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1992,9,1]],"date-time":"1992-09-01T00:00:00Z","timestamp":715305600000},"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":["Future Generation Computer Systems"],"published-print":{"date-parts":[[1992,9]]},"DOI":"10.1016\/0167-739x(92)90071-i","type":"journal-article","created":{"date-parts":[[2003,9,3]],"date-time":"2003-09-03T15:12:00Z","timestamp":1062601920000},"page":"395-408","source":"Crossref","is-referenced-by-count":14,"title":["Towards a single model of efficient computation in real parallel machines"],"prefix":"10.1016","volume":"8","author":[{"given":"Pilar","family":"de la Torre","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Clyde P","family":"Kruskal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0167-739X(92)90071-I_BIB1","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0304-3975(90)90188-N","article-title":"Communication complexity of PRAMs","volume":"71","author":"Aggarwal","year":"1990","journal-title":"Theoretical Comput. Sci."},{"key":"10.1016\/0167-739X(92)90071-I_BIB2","article-title":"On communication latency of PRAMs","author":"Aggarwal","year":"1989"},{"key":"10.1016\/0167-739X(92)90071-I_BIB3","series-title":"Proc. 3rd AWOC","first-page":"81","article-title":"Deterministic parallel list ranking","author":"Anderson","year":"1988"},{"key":"10.1016\/0167-739X(92)90071-I_BIB4","series-title":"Proc. 27th Annual IEEE Symp. on Foundations of Computer Science","first-page":"511","article-title":"Parallel merge sort","author":"Cole","year":"1986"},{"key":"10.1016\/0167-739X(92)90071-I_BIB5","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1137\/0217009","article-title":"Approximate parallel scheduling, Part I: the basic technique with applications to optimal parallel list ranking in logarithmic time","volume":"17","author":"Cole","year":"1988","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0167-739X(92)90071-I_BIB6","article-title":"Efficient communication in massively parallel computers","author":"Cypher","year":"1989"},{"key":"10.1016\/0167-739X(92)90071-I_BIB7","series-title":"Proc. 15th Annual ACM Symp. on Theory of Computing","first-page":"193","article-title":"Deterministic sorting in nearly logarithmic time on the hypercube and related computers","author":"Cypher","year":"1990"},{"key":"10.1016\/0167-739X(92)90071-I_BIB8","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/0020-0190(89)90023-9","article-title":"A class of problems efficiently solvable on mesh-connected computers including dynamic expression evaluation","volume":"32","author":"Gibbons","year":"1989","journal-title":"Inform. Processing Letters"},{"key":"10.1016\/0167-739X(92)90071-I_BIB9","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1145\/62.322423","article-title":"Complexity results for permuting data and other computations on parallel processors","volume":"31","author":"Gottlieb","year":"1984","journal-title":"JACM"},{"key":"10.1016\/0167-739X(92)90071-I_BIB10","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1016\/0743-7315(89)90005-1","article-title":"Parallel algorithms for computing linked list prefix","volume":"6","author":"Han","year":"1989","journal-title":"J. Parallel Distributed Comput."},{"key":"10.1016\/0167-739X(92)90071-I_BIB11","article-title":"A practical model of parallel computation: Binary tree and fft graph algorithms","author":"Heywood","year":"1991"},{"key":"10.1016\/0167-739X(92)90071-I_BIB12","article-title":"A practical model of parallel computation: The model","author":"Heywood","year":"1991"},{"key":"10.1016\/0167-739X(92)90071-I_BIB13","article-title":"A survey of parallel algorithms for shared-memory machines","volume":"Vol. A","author":"Karp","year":"1991"},{"key":"10.1016\/0167-739X(92)90071-I_BIB14","series-title":"Parallel merging on the EREW pram and direct connection machines","author":"Kruskal","year":"1992"},{"key":"10.1016\/0167-739X(92)90071-I_BIB15","series-title":"Proc. Internat. Conf. on Parallel Processing","first-page":"278","article-title":"Parallel prefix on fully connected direct connection machine","author":"Kruskal","year":"1986"},{"key":"10.1016\/0167-739X(92)90071-I_BIB16","series-title":"IEEE Trans. Comput.","first-page":"965","article-title":"The power of parallel prefix","author":"Kruskal","year":"1985"},{"key":"10.1016\/0167-739X(92)90071-I_BIB17","series-title":"Proc. Internat. Conf. on Parallel Processing","first-page":"869","article-title":"Efficient parallel algorithms for graph problems","author":"Kruskal","year":"1986"},{"key":"10.1016\/0167-739X(92)90071-I_BIB18","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0304-3975(90)90192-K","article-title":"A complexity theory of efficient parallel algorithms","volume":"71","author":"Kruskal","year":"1990","journal-title":"Theoretical Comput. Sci."},{"key":"10.1016\/0167-739X(92)90071-I_BIB19","doi-asserted-by":"crossref","first-page":"967","DOI":"10.1126\/science.231.4741.967","article-title":"Parallel supercomputing today and the CEDAR approach","volume":"231","author":"Kuck","year":"1986","journal-title":"Science"},{"key":"10.1016\/0167-739X(92)90071-I_BIB20","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1109\/TC.1985.5009385","article-title":"Tight bounds on the complexity of parallel sorting","author":"Leighton","year":"1985","journal-title":"IEEE Trans. Comput. C-34"},{"key":"10.1016\/0167-739X(92)90071-I_BIB21","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1007\/BF01762110","article-title":"Communication-efficient parallel algorithms for distributed random-access machines","volume":"3","author":"Leiserson","year":"1988","journal-title":"Algorithmica"},{"key":"10.1016\/0167-739X(92)90071-I_BIB22","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1007\/BF00264615","article-title":"Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel of parallel memories","volume":"21","author":"Mehlhorn","year":"1984","journal-title":"Acta Inform."},{"key":"10.1016\/0167-739X(92)90071-I_BIB23","first-page":"639","article-title":"A communication-time tradeoff","volume":"16","author":"Papadimitriou","year":"1987","journal-title":"J. ACM"},{"key":"10.1016\/0167-739X(92)90071-I_BIB24","first-page":"300","article-title":"Towards an architechture independent analysis of parallel algorithms","author":"Papadimitriou","year":"1990","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0167-739X(92)90071-I_BIB25","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":"CACM"},{"key":"10.1016\/0167-739X(92)90071-I_BIB26","series-title":"Proc. 29th Annual IEEE Symp. on Foundations of Computer Science","first-page":"256","article-title":"Universal packet routing algorithms","author":"Leighton","year":"1988"},{"key":"10.1016\/0167-739X(92)90071-I_BIB27","series-title":"Proc. 26th Annual Symp. on Foundations of Computer Science","first-page":"496","article-title":"An optimal parallel algorithm for integer sorting","author":"Reif","year":"1985"},{"key":"10.1016\/0167-739X(92)90071-I_BIB28","first-page":"289","article-title":"Type architectures, shared memory, and the corollary of modest potential","volume":"1","author":"Snyder","year":"1986"},{"key":"10.1016\/0167-739X(92)90071-I_BIB29","first-page":"637","article-title":"Cm\u2217 \u2014 a modular, multiprocessor","volume":"46","author":"Swan","year":"1977"},{"key":"10.1016\/0167-739X(92)90071-I_BIB30","article-title":"General purpose parallel architectures","volume":"Vol. A","author":"Valiant","year":"1991"},{"key":"10.1016\/0167-739X(92)90071-I_BIB31","series-title":"Proc. Internat. Conf. on Parallel Processing","first-page":"924","article-title":"Parallel algorithms for bucket sorting and the data dependent prefix problem","author":"Wagner","year":"1986"},{"key":"10.1016\/0167-739X(92)90071-I_BIB32","article-title":"The complexity of parallel computation","author":"Wyllie","year":"1979"}],"container-title":["Future Generation Computer Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167739X9290071I?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167739X9290071I?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T11:53:39Z","timestamp":1551095619000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167739X9290071I"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,9]]},"references-count":32,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1992,9]]}},"alternative-id":["0167739X9290071I"],"URL":"https:\/\/doi.org\/10.1016\/0167-739x(92)90071-i","relation":{},"ISSN":["0167-739X"],"issn-type":[{"value":"0167-739X","type":"print"}],"subject":[],"published":{"date-parts":[[1992,9]]}}}