Crossmark

Scalable connectionless RDMA over unreliable datagrams

Crossref DOI link: https://doi.org/10.1016/j.parco.2015.03.009

Published Print: 2015-10

Update policy: https://doi.org/10.1016/elsevier_cm_policy

Authors

Grant, Ryan E.

Rashti, Mohammad J.

Balaji, Pavan

Afsahi, Ahmad
Funding

Funding for this research was provided by:

Office of Science

U.S. Department of Energy

National Science Foundation (0702182)

Ontario Innovation Trust (7154)

Savannah River Operations Office, U.S. Department of Energy

Advanced Scientific Computing Research (DE-AC02-06CH11357)

Natural Sciences and Engineering Research Council of Canada (RGPIN/238964-2011)
License Information

Text and Data Mining valid from 2015-10-01

Text and Data Mining valid from 2015-10-01

Accepted Manuscript valid from 2016-05-24
More Information

This article is maintained by: Elsevier

Article Title: Scalable connectionless RDMA over unreliable datagrams

Journal Title: Parallel Computing

CrossRef DOI link to publisher maintained version: https://doi.org/10.1016/j.parco.2015.03.009

Content Type: article

Copyright: Copyright © 2015 Elsevier B.V. Published by Elsevier B.V. All rights reserved.