{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,4]],"date-time":"2023-09-04T15:49:48Z","timestamp":1693842588607},"reference-count":4,"publisher":"World Scientific Pub Co Pte Lt","issue":"02","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Process. Lett."],"published-print":{"date-parts":[[2002,6]]},"abstract":"<jats:p> This paper describes the transformation of (almost arbitrary) sequential functions on covers to parallel, collective operations (skeletons). This allows the direct re-use of existing, but sequential, code on parallel machines without the necessity to hand-code the desired parallel operations. A necessary pre-requisite for this skeleton lifting is the availability of a cover which holds the mapping information of the local subobjects, including their topology information. The lifting transformation distinguishes sequential values, which are available on each processor, from parallel values, which are only stored once. Accesses to parallel values are either ignored locally if they will be computed on another processor, or they induce communication messages to transfer the necessary data, depending on the behavior of the original function. <\/jats:p>","DOI":"10.1142\/s0129626402000963","type":"journal-article","created":{"date-parts":[[2002,10,28]],"date-time":"2002-10-28T06:43:09Z","timestamp":1035787389000},"page":"267-284","source":"Crossref","is-referenced-by-count":2,"title":["LIFTING SEQUENTIAL FUNCTIONS TO PARALLEL SKELETONS"],"prefix":"10.1142","volume":"12","author":[{"given":"THOMAS","family":"NITSCHE","sequence":"first","affiliation":[{"name":"Institut f\u00fcr Software und Theoretische  Informatik, Technische Universit\u00e4t Berlin, Franklinstr. 28\/29, Sekr.  FR5-13, 10587 Berlin, Germany"}]}],"member":"219","published-online":{"date-parts":[[2011,11,21]]},"reference":[{"issue":"2","key":"p_5","first-page":"239","volume":"10","author":"Ch C.A.","year":"2000","journal-title":"Parallel Processing Letters"},{"key":"p_12","doi-asserted-by":"publisher","DOI":"10.1007\/s002360050174"},{"key":"p_15","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6423(95)00015-1"},{"key":"p_17","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-6423(99)00028-3"}],"container-title":["Parallel Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129626402000963","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T09:34:02Z","timestamp":1565170442000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129626402000963"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,6]]},"references-count":4,"journal-issue":{"issue":"02","published-online":{"date-parts":[[2011,11,21]]},"published-print":{"date-parts":[[2002,6]]}},"alternative-id":["10.1142\/S0129626402000963"],"URL":"https:\/\/doi.org\/10.1142\/s0129626402000963","relation":{},"ISSN":["0129-6264","1793-642X"],"issn-type":[{"value":"0129-6264","type":"print"},{"value":"1793-642X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2002,6]]}}}