World Scientific
  • Search
Skip main navigation

Cookies Notification

We use cookies on this site to enhance your user experience. By continuing to browse the site, you consent to the use of our cookies. Learn More
×
Our website is made possible by displaying certain online content using javascript.
In order to view the full content, please disable your ad blocker or whitelist our website www.worldscientific.com.

System Upgrade on Tue, Oct 25th, 2022 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at [email protected] for any enquiries.
Special Issue on High-Level Parallel Programming and ApplicationsNo Access

MESSAGE PASSING WITHOUT MEMORY COPY

    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.

    References

    • R. M. Karp and R. E. Miller, SIAM Journal of Applied Mathematics 14(6), 1390 (1966), DOI: 10.1137/0114108. Crossref, ISIGoogle Scholar
    • G.   Agha , Actors: A Model of Concurrent Computation in Distributed Systems ( MIT Press , Cambridge, MA , 1986 ) . CrossrefGoogle Scholar
    • M.   Snir et al. , MPI: The Complete Reference ( MIT Press , Cambridge, MA , 1996 ) . Google Scholar
    • D. Gelernter, ACM Transactions on Programming Languages and Systems 7(1), 80 (1985), DOI: 10.1145/2363.2433. Crossref, ISIGoogle Scholar
    • R. Cypher and E. Leu, The Semantics of Blocking and Nonblocking Send and Receive Primitives, Proc. 18th IEEE Int. Parallel Processing Sym. (1994) pp. 729–735. Google Scholar
    • G. Yaikhom, Message Passing with Communication Structures. Ph.D. Thesis, School of Informatics, University of Edinburgh, UK, 2006 . Google Scholar
    • G. Yaikhom, Buffered Branching Channels with Rendezvous Message Passing, Proc. 23rd IASTED Int. Conf. on Parallel and Distributed Computing and Networks (PDCN) (2005) pp. 184–192. Google Scholar
    • M.   Cole , Algorithmic Skeletons: Structured Management of Parallel Computation ( MIT Press , Cambridge, MA , 1989 ) . Google Scholar
    • M. Cole, Parallel Computing 30(3), 389 (2004), DOI: 10.1016/j.parco.2003.12.002. Crossref, ISIGoogle Scholar
    • D. R.   Butenhof , Programming with POSIX Threads ( Addison-Wesley , 1997 ) . Google Scholar