{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T15:10:21Z","timestamp":1649171421208},"reference-count":16,"publisher":"World Scientific Pub Co Pte Lt","issue":"04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Process. Lett."],"published-print":{"date-parts":[[2003,12]]},"abstract":"<jats:p>Skeletons are reusable, parameterized program components with well-defined semantics and pre-packaged efficient parallel implementation. This paper develops a new, provably cost-optimal implementation of the DS (double-scan) skeleton for programming divide-and-conquer algorithms. Our implementation is based on a novel data structure called plist (pointed list); implementation's performance is estimated using an analytical model. We demonstrate the use of the DS skeleton for parallelizing a tridiagonal system solver and report experimental results for its MPI implementation on a Cray T3E and a Linux cluster: they confirm the performance improvement achieved by the cost-optimal implementation and demonstrate its good predictability by our performance model.<\/jats:p>","DOI":"10.1142\/s0129626403001525","type":"journal-article","created":{"date-parts":[[2004,3,5]],"date-time":"2004-03-05T11:52:36Z","timestamp":1078487556000},"page":"575-587","source":"Crossref","is-referenced-by-count":1,"title":["COST OPTIMALITY AND PREDICTABILITY OF PARALLEL PROGRAMMING WITH SKELETONS"],"prefix":"10.1142","volume":"13","author":[{"given":"HOLGER","family":"BISCHOF","sequence":"first","affiliation":[{"name":"Universit\u00e4t M\u00fcnster Einsteinstr. 62, 48149 M\u00fcnster, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"SERGEI","family":"GORLATCH","sequence":"additional","affiliation":[{"name":"Universit\u00e4t M\u00fcnster Einsteinstr. 62, 48149 M\u00fcnster, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"EMANUEL","family":"KITZELMANN","sequence":"additional","affiliation":[{"name":"Universit\u00e4t M\u00fcnster Einsteinstr. 62, 48149 M\u00fcnster, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,21]]},"reference":[{"key":"rf1","doi-asserted-by":"crossref","unstructured":"H.\u00a0Bischof and S.\u00a0Gorlatch, Euro-Par 2002, LNCS\u00a02400, eds. B.\u00a0Monien and R.\u00a0Feldmann (Springer, 2002)\u00a0pp. 640\u2013647.","DOI":"10.1007\/3-540-45706-2_88"},{"key":"rf2","series-title":"Technical Report 2002\/06","volume-title":"The double-scan skeleton and its parallelization","author":"Bischof H.","year":"2002"},{"key":"rf3","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-61626-8_95"},{"key":"rf6","doi-asserted-by":"crossref","unstructured":"M.\u00a0Danelutto, F.\u00a0Pasqualetti and S.\u00a0Pelagatti, Euro-Par'97, LNCS\u00a01300, eds. C.\u00a0Lengauer, M.\u00a0Griebl and S.\u00a0Gorlatch (Springer, 1997)\u00a0pp. 619\u2013628.","DOI":"10.1007\/BFb0002792"},{"key":"rf7","doi-asserted-by":"crossref","unstructured":"M.\u00a0Danelutto and M.\u00a0Stigliani, EuroPar 2000, LNCS\u00a01900, eds. A.\u00a0Bode (Springer, 2000)\u00a0pp. 1175\u20131184.","DOI":"10.1007\/3-540-44520-X_166"},{"key":"rf8","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796899003536"},{"key":"rf9","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0024729"},{"key":"rf10","doi-asserted-by":"publisher","DOI":"10.1007\/s002360050174"},{"key":"rf11","volume-title":"The Skeleton-Based Parallelization of Divide-and-conquer Recursions","author":"Herrmann C. A.","year":"2000"},{"key":"rf12","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1142\/S0129626400000238","volume":"10","author":"Herrmann C. A.","journal-title":"Parallel Processing Letters"},{"key":"rf13","doi-asserted-by":"crossref","unstructured":"H.\u00a0Kuchen, Euro-Par 2002, LNCS\u00a02400, eds. B.\u00a0Monien and R.\u00a0Feldmann (Springer, 2002)\u00a0pp. 620\u2013629.","DOI":"10.1007\/3-540-45706-2_86"},{"key":"rf14","volume-title":"Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes","author":"Leighton F. T.","year":"1992"},{"key":"rf15","doi-asserted-by":"publisher","DOI":"10.1109\/12.338101"},{"key":"rf16","unstructured":"J.\u00a0O'Donnell, Functional Programming: Glasgow 1993, Workshops in Computing (1993)\u00a0pp. 193\u2013200."},{"key":"rf17","volume-title":"Parallel Computing","author":"Quinn M. J.","year":"1994"},{"key":"rf18","doi-asserted-by":"publisher","DOI":"10.1145\/355945.355947"}],"container-title":["Parallel Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129626403001525","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,31]],"date-time":"2020-03-31T11:42:36Z","timestamp":1585654956000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129626403001525"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,12]]},"references-count":16,"journal-issue":{"issue":"04","published-online":{"date-parts":[[2011,11,21]]},"published-print":{"date-parts":[[2003,12]]}},"alternative-id":["10.1142\/S0129626403001525"],"URL":"https:\/\/doi.org\/10.1142\/s0129626403001525","relation":{},"ISSN":["0129-6264","1793-642X"],"issn-type":[{"value":"0129-6264","type":"print"},{"value":"1793-642X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003,12]]}}}