{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T23:53:03Z","timestamp":1649116383935},"reference-count":22,"publisher":"Elsevier BV","issue":"12","license":[{"start":{"date-parts":[[1992,12,1]],"date-time":"1992-12-01T00:00:00Z","timestamp":723168000000},"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":["Parallel Computing"],"published-print":{"date-parts":[[1992,12]]},"DOI":"10.1016\/0167-8191(92)90126-r","type":"journal-article","created":{"date-parts":[[2003,8,8]],"date-time":"2003-08-08T06:10:42Z","timestamp":1060323042000},"page":"1363-1380","source":"Crossref","is-referenced-by-count":1,"title":["Parallel-architecture-directed program transformation"],"prefix":"10.1016","volume":"18","author":[{"given":"David","family":"Sharp","sequence":"first","affiliation":[]},{"given":"Martin","family":"Cripps","sequence":"additional","affiliation":[]},{"given":"John","family":"Darlington","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0167-8191(92)90126-R_BIB1","series-title":"Parallel Sorting Algorithms","author":"Akl","year":"1985"},{"issue":"No. 3","key":"10.1016\/0167-8191(92)90126-R_BIB2","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1145\/2514.2516","article-title":"A Taxonomy of Parallel Sorting Algorithms","volume":"Vol. 16","author":"Bitton","year":"1984","journal-title":"Computing Surveys"},{"issue":"1","key":"10.1016\/0167-8191(92)90126-R_BIB3","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1093\/comjnl\/23.1.61","article-title":"Algorithm classification through synthesis","volume":"23","author":"Clark","year":"1980","journal-title":"Computer J."},{"key":"10.1016\/0167-8191(92)90126-R_BIB4","series-title":"Selected reprints on dataflow and reduction architectures","article-title":"The design and implementation of ALICE: A parallel graph reduction machine","author":"Cripps","year":"1987"},{"key":"10.1016\/0167-8191(92)90126-R_BIB5","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/BF00263742","article-title":"A system which automatically improves programs","volume":"6","author":"Darlington","year":"1976","journal-title":"Acta Inform."},{"key":"10.1016\/0167-8191(92)90126-R_BIB6","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1109\/TC.1982.1675993","article-title":"Experience with multiprocessor algorithms","volume":"C-31","author":"Deminet","year":"1982","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0167-8191(92)90126-R_BIB7","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1007\/BF01934992","article-title":"Analysis of the performance of the parallel quicksort method","volume":"25","author":"Evans","year":"1985","journal-title":"BIT"},{"key":"10.1016\/0167-8191(92)90126-R_BIB8","series-title":"Proc. IEEE Internat. Conf. Parallel Processing (ICPP)","first-page":"384","article-title":"Self-clocking networks","author":"Field","year":"1985"},{"issue":"12","key":"10.1016\/0167-8191(92)90126-R_BIB9","doi-asserted-by":"crossref","first-page":"1619","DOI":"10.1109\/12.9738","article-title":"A benchmark parallel sort for shared memory multiprocessors","volume":"37","author":"Francis","year":"1988","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0167-8191(92)90126-R_BIB10","series-title":"Efficient Parallel Algorithms","author":"Gibbons","year":"1988"},{"issue":"8","key":"10.1016\/0167-8191(92)90126-R_BIB11","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1145\/359576.359582","article-title":"Fast parallel sorting algorithms","volume":"21","author":"Hirschberg","year":"1978","journal-title":"Commun. ACM"},{"key":"10.1016\/0167-8191(92)90126-R_BIB12","first-page":"295","article-title":"Parallel sorting algorithms","volume":"Vol. 13","author":"Lakshmivarahan","year":"1984"},{"key":"10.1016\/0167-8191(92)90126-R_BIB13","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0020-0190(89)90116-6","article-title":"A fast parallel quicksort algorithm","author":"Martel","year":"1989","journal-title":"Inform. Processing Letters"},{"key":"10.1016\/0167-8191(92)90126-R_BIB14","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/0167-8191(87)90063-9","article-title":"Problem-heap: A paradigm for multiprocessor algorithms","volume":"4","author":"Moller-Nilesen","year":"1987","journal-title":"Parallel Comput."},{"issue":"7","key":"10.1016\/0167-8191(92)90126-R_BIB15","doi-asserted-by":"crossref","first-page":"669","DOI":"10.1109\/TC.1978.1675167","article-title":"New parallel sorting schemes","volume":"C-27","author":"Preparata","year":"1978","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0167-8191(92)90126-R_BIB16","first-page":"305","article-title":"A parallel implementation strategy for quicksort","volume":"Vol. 1","author":"Sharp","year":"1989"},{"key":"10.1016\/0167-8191(92)90126-R_BIB17","article-title":"Functional language program transformation for parallel computer architectures","author":"Sharp","year":"1990"},{"key":"10.1016\/0167-8191(92)90126-R_BIB18","article-title":"A synthesis of a dynamic message-passing algorithm for quicksort","author":"Sharp","year":"1991"},{"key":"10.1016\/0167-8191(92)90126-R_BIB19","article-title":"A case study in the synthesis of parallel functional programs for message-passing architectures","author":"Sharp","year":"1991"},{"key":"10.1016\/0167-8191(92)90126-R_BIB20","article-title":"Synthesis of the Fast Fourier Transform algorithm by functional language program transformation","author":"Sharp","year":"1991"},{"key":"10.1016\/0167-8191(92)90126-R_BIB21","series-title":"Proc. Third IEEE Symp. on Parallel and Distributed Processing","article-title":"Parallel algorithms that solve problems by communication","author":"Sharp","year":"1991"},{"key":"10.1016\/0167-8191(92)90126-R_BIB22","year":"1987","journal-title":"Thinking Machines Corporation Technical Report Series HA87-4"}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016781919290126R?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016781919290126R?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,15]],"date-time":"2019-03-15T01:26:48Z","timestamp":1552613208000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/016781919290126R"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,12]]},"references-count":22,"journal-issue":{"issue":"12","published-print":{"date-parts":[[1992,12]]}},"alternative-id":["016781919290126R"],"URL":"https:\/\/doi.org\/10.1016\/0167-8191(92)90126-r","relation":{},"ISSN":["0167-8191"],"issn-type":[{"value":"0167-8191","type":"print"}],"subject":[],"published":{"date-parts":[[1992,12]]}}}