{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T13:57:28Z","timestamp":1648735048877},"reference-count":7,"publisher":"World Scientific Pub Co Pte Lt","issue":"01","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Process. Lett."],"published-print":{"date-parts":[[2008,3]]},"abstract":"<jats:p>We consider here reduction of send latencies for send-and-forget type communications, where senders do not reuse data that have already been sent. We introduce a commit based message sending approach, and describe the corresponding application programming interfaces. These interfaces allow applications to take advantage of message buffering, such as overlapping of computations and communications, while avoiding performance degradation due to intermediate memory copy. The approach works by allowing applications to safely access the implementation buffer through the provided interfaces. Experimental results show that the new approach is effective, and reduces the interface latency significantly compared to related approaches. Since send-and-forget type communications are often observed in skeletal programming, we demonstrate the approach by implementing a pipeline algorithmic skeleton.<\/jats:p>","DOI":"10.1142\/s0129626408003247","type":"journal-article","created":{"date-parts":[[2008,3,25]],"date-time":"2008-03-25T12:05:59Z","timestamp":1206446759000},"page":"87-100","source":"Crossref","is-referenced-by-count":0,"title":["MESSAGE PASSING WITHOUT MEMORY COPY"],"prefix":"10.1142","volume":"18","author":[{"given":"Gagarine","family":"Yaikhom","sequence":"first","affiliation":[{"name":"School of Computer Science, Cardiff University, Cardiff - CF24 3AA, UK"}]}],"member":"219","published-online":{"date-parts":[[2011,11,21]]},"reference":[{"key":"rf1","doi-asserted-by":"publisher","DOI":"10.1137\/0114108"},{"key":"rf2","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/1086.001.0001","volume-title":"Actors: A Model of Concurrent Computation in Distributed Systems","author":"Agha G.","year":"1986"},{"key":"rf3","volume-title":"MPI: The Complete Reference","author":"Snir M.","year":"1996"},{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1145\/2363.2433"},{"key":"rf8","volume-title":"Algorithmic Skeletons: Structured Management of Parallel Computation","author":"Cole M.","year":"1989"},{"key":"rf9","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2003.12.002"},{"key":"rf10","volume-title":"Programming with POSIX Threads","author":"Butenhof D. R.","year":"1997"}],"container-title":["Parallel Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129626408003247","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,6]],"date-time":"2021-09-06T10:00:43Z","timestamp":1630922443000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129626408003247"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,3]]},"references-count":7,"journal-issue":{"issue":"01","published-online":{"date-parts":[[2011,11,21]]},"published-print":{"date-parts":[[2008,3]]}},"alternative-id":["10.1142\/S0129626408003247"],"URL":"https:\/\/doi.org\/10.1142\/s0129626408003247","relation":{},"ISSN":["0129-6264","1793-642X"],"issn-type":[{"value":"0129-6264","type":"print"},{"value":"1793-642X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,3]]}}}