BEGIN:VCALENDAR
VERSION:2.0
PRODID:Linklings LLC
BEGIN:VTIMEZONE
TZID:America/Chicago
X-LIC-LOCATION:America/Chicago
BEGIN:DAYLIGHT
TZOFFSETFROM:-0600
TZOFFSETTO:-0500
TZNAME:CDT
DTSTART:19700308T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=2SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0500
TZOFFSETTO:-0600
TZNAME:CST
DTSTART:19701101T020000
RRULE:FREQ=YEARLY;BYMONTH=11;BYDAY=1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20211207T054802Z
LOCATION:227-228
DTSTART;TZID=America/Chicago:20211116T163000
DTEND;TZID=America/Chicago:20211116T170000
UID:submissions.supercomputing.org_SC21_sess153_pap360@linklings.com
SUMMARY:HatRPC: Hint-Accelerated Thrift RPC over RDMA
DESCRIPTION:Paper\n\nHatRPC: Hint-Accelerated Thrift RPC over RDMA\n\nLi, 
 Shi, Lu\n\nIn this paper, we propose a novel hint-accelerated RPC framewor
 k based on Apache Thrift over Remote Direct Memory Access (RDMA) protocols
 , called HatRPC. HatRPC adopts a hierarchical hint design towards optimizi
 ng heterogeneous RPC services and functions. The proposed hint design is c
 omposed of service-granularity and function-granularity hints for achievin
 g varied optimization goals and reduced design space for further optimizin
 g the underneath RDMA communication engine. The effectiveness and efficien
 cy of HatRPC are validated and evaluated with our proposed Apache Thrift B
 enchmarks (ATB), and an RDMA-enhanced commercial database system. We also 
 co-design a key-value store called HatKV with LMDB and evaluate it with YC
 SB workload. Performance evaluations show that the proposed HatRPC approac
 h can deliver up to 55% performance improvement for ATB benchmarks and up 
 to 1.51x speedup for TPC-H queries compared with vanilla Thrift over IPoIB
 . In addition, the co-designed HatKV can achieve up to 85.5% enhancement f
 or YCSB workload.\n\nTag: Reproducibility Badge, Networks\n\nRegistration 
 Category: Tech Program Reg Pass\n\nReproducibility Badges: Artifact Availa
 ble
END:VEVENT
END:VCALENDAR