{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:16:25Z","timestamp":1750220185621,"version":"3.41.0"},"reference-count":25,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2022,5,31]],"date-time":"2022-05-31T00:00:00Z","timestamp":1653955200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGMOD Rec."],"published-print":{"date-parts":[[2022,5,31]]},"abstract":"<jats:p>In this paper, we propose the Data Flow Interface (DFI) as a way to make it easier for data processing systems to exploit high-speed networks without the need to deal with the complexity of RDMA. By lifting the level of abstraction, DFI factors out much of the complexity of network communication and makes it easier for developers to declaratively express how data should be efficiently routed to accomplish a given distributed data processing task. As we show in our experiments, DFI is able to support a wide variety of data-centric applications with high performance at a low complexity for the applications.<\/jats:p>","DOI":"10.1145\/3542700.3542705","type":"journal-article","created":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T22:10:16Z","timestamp":1654121416000},"page":"15-22","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["DFI: The Data Flow Interface for High-Speed Networks"],"prefix":"10.1145","volume":"51","author":[{"given":"Lasse","family":"Thostrup","sequence":"first","affiliation":[{"name":"TU Darmstadt"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jan","family":"Skrzypczak","sequence":"additional","affiliation":[{"name":"Zuse Institute, Berlin"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthias","family":"Jasny","sequence":"additional","affiliation":[{"name":"TU Darmstadt"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tobias","family":"Ziegler","sequence":"additional","affiliation":[{"name":"TU Darmstadt"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carsten","family":"Binnig","sequence":"additional","affiliation":[{"name":"TU Darmstadt"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,6]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"CIDR","author":"Alonso G.","year":"2019","unstructured":"G. Alonso , C. Binnig , I. Pandis , K. Salem , J. Skrzypczak , R. Stutsman , L. Thostrup , T. Wang , Z. Wang , and T. Ziegler . DPI: the data processing interface for modern networks . In CIDR , 2019 . G. Alonso, C. Binnig, I. Pandis, K. Salem, J. Skrzypczak, R. Stutsman, L. Thostrup, T. Wang, Z. Wang, and T. Ziegler. DPI: the data processing interface for modern networks. In CIDR, 2019."},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.14778\/3055540.3055545"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2750547"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.14778\/2904483.2904485"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.14778\/3236187.3236209"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807128.1807152"},{"key":"e_1_2_1_7_1","first-page":"401","volume-title":"NSDI","author":"Dragojevic A.","year":"2014","unstructured":"A. Dragojevic , D. Narayanan , M. Castro , and O. Hodson . Farm: Fast remote memory. In 3https:\/\/github.com\/DataManagementLab\/DFI-public R. Mahajan and I. Stoica, editors , NSDI , pages 401 -- 414 , 2014 . A. Dragojevic, D. Narayanan, M. Castro, and O. Hodson. Farm: Fast remote memory. In 3https:\/\/github.com\/DataManagementLab\/DFI-public R. Mahajan and I. Stoica, editors, NSDI, pages 401--414, 2014."},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE48307.2020.00131"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2009.32"},{"key":"e_1_2_1_10_1","volume-title":"Using Advanced MPI: Modern Features of the Message-Passing Interface","author":"Gropp W.","year":"2014","unstructured":"W. Gropp Using Advanced MPI: Modern Features of the Message-Passing Interface . The MIT Press , 2014 . W. Gropp et al. Using Advanced MPI: Modern Features of the Message-Passing Interface. The MIT Press, 2014."},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2619239.2626299"},{"key":"e_1_2_1_12_1","first-page":"185","volume-title":"OSDI","author":"Kalia A.","year":"2016","unstructured":"A. Kalia , M. Kaminsky , and D. G. Andersen . Fasst: Fast, scalable and simple distributed transactions with two-sided (RDMA) datagram rpcs . In OSDI , pages 185 -- 201 , 2016 . A. Kalia, M. Kaminsky, and D. G. Andersen. Fasst: Fast, scalable and simple distributed transactions with two-sided (RDMA) datagram rpcs. In OSDI, pages 185--201, 2016."},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1155\/2015\/575687"},{"issue":"4","key":"e_1_2_1_14_1","first-page":"18","article-title":"Paxos made simple","volume":"32","author":"Lamport L.","year":"2001","unstructured":"L. Lamport Paxos made simple . ACM Sigact News , 32 ( 4 ): 18 -- 25 , 2001 . L. Lamport et al. Paxos made simple. ACM Sigact News, 32(4):18--25, 2001.","journal-title":"ACM Sigact News"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3132747.3132756"},{"key":"e_1_2_1_16_1","first-page":"467","volume-title":"OSDI","author":"Li J.","year":"2016","unstructured":"J. Li , E. Michael , N. K. Sharma , A. Szekeres , and D. R. K. Ports . Just say NO to paxos overhead: Replacing consensus with network ordering . In OSDI , pages 467 -- 483 , 2016 . J. Li, E. Michael, N. K. Sharma, A. Szekeres, and D. R. K. Ports. Just say NO to paxos overhead: Replacing consensus with network ordering. In OSDI, pages 467--483, 2016."},{"key":"e_1_2_1_17_1","first-page":"103","volume-title":"ATC","author":"Mitchell C.","year":"2013","unstructured":"C. Mitchell , Y. Geng , and J. Li . Using one-sided RDMA reads to build a fast, cpu-efficient key-value store . In ATC , pages 103 -- 114 , 2013 . C. Mitchell, Y. Geng, and J. Li. Using one-sided RDMA reads to build a fast, cpu-efficient key-value store. In ATC, pages 103--114, 2013."},{"key":"e_1_2_1_18_1","first-page":"305","volume-title":"ATC","author":"Ongaro D.","year":"2014","unstructured":"D. Ongaro and J. K. Ousterhout . In search of an understandable consensus algorithm . In ATC , pages 305 -- 319 , 2014 . D. Ongaro and J. K. Ousterhout. In search of an understandable consensus algorithm. In ATC, pages 305--319, 2014."},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2749246.2749267"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3448016.3452816"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3127479.3128609"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3302424.3303975"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3389724"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/s13222-020-00355-7"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3300081"}],"container-title":["ACM SIGMOD Record"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3542700.3542705","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3542700.3542705","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:02:22Z","timestamp":1750186942000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3542700.3542705"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5,31]]},"references-count":25,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,5,31]]}},"alternative-id":["10.1145\/3542700.3542705"],"URL":"https:\/\/doi.org\/10.1145\/3542700.3542705","relation":{},"ISSN":["0163-5808"],"issn-type":[{"type":"print","value":"0163-5808"}],"subject":[],"published":{"date-parts":[[2022,5,31]]},"assertion":[{"value":"2022-06-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}