BEGIN:VCALENDAR
VERSION:2.0
PRODID:Linklings LLC
BEGIN:VTIMEZONE
TZID:America/Denver
X-LIC-LOCATION:America/Denver
BEGIN:DAYLIGHT
TZOFFSETFROM:-0700
TZOFFSETTO:-0600
TZNAME:MDT
DTSTART:19700308T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=2SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0600
TZOFFSETTO:-0700
TZNAME:MST
DTSTART:19701101T020000
RRULE:FREQ=YEARLY;BYMONTH=11;BYDAY=1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20200129T163557Z
LOCATION:505
DTSTART;TZID=America/Denver:20191118T112000
DTEND;TZID=America/Denver:20191118T113000
UID:submissions.supercomputing.org_SC19_sess128_ws_ia101@linklings.com
SUMMARY:RDMA vs. RPC for Implementing Distributed Data Structures
DESCRIPTION:Workshop\n\nRDMA vs. RPC for Implementing Distributed Data Str
 uctures\n\nBrock, Chen, Yan, Owens, Buluç...\n\nDistributed data structure
 s are key to implementing scalable applications for scientific simulations
  and data analysis.  In this paper we look at two implementation styles fo
 r distributed data structures: remote direct memory access (RDMA) and remo
 te procedure call (RPC).  We focus on operations that require individual a
 ccesses to remote portions of a distributed data structure, e.g., accessin
 g a hash table bucket or distributed queue, rather than global operations 
 in which all processors collectively exchange information.  We look at the
  trade-offs between the two styles through microbenchmarks and a performan
 ce model that approximates the cost of each.  The RDMA operations have dir
 ect hardware support in the network and therefore lower latency and overhe
 ad, while the RPC operations are more expressive but higher cost and can s
 uffer from lack of attentiveness from the remote side.   We also run exper
 iments to compare the real-world performance of RDMA- and RPC-based data s
 tructure operations with the predicted performance to evaluate the accurac
 y of our model, and show that while the model does not always precisely pr
 edict running time, it allows us to choose the best implementation in the 
 examples shown.  We believe this analysis will assist developers in design
 ing data structures that will perform well on current network architecture
 s, as well as network architects in providing better support for this clas
 s of distributed data structures.\n\nTag: Workshop Reg Pass, Algorithms, A
 rchitectures, Irregular Applications\n\nRegistration Category: Workshop Re
 g Pass, Algorithms, Architectures, Irregular Applications
URL:https://sc19.supercomputing.org/presentation/?id=ws_ia101&sess=sess128
END:VEVENT
END:VCALENDAR