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:20181221T160904Z
LOCATION:C2/3/4 Ballroom
DTSTART;TZID=America/Chicago:20181113T083000
DTEND;TZID=America/Chicago:20181113T170000
UID:submissions.supercomputing.org_SC18_sess322_post181@linklings.com
SUMMARY:Implementing Efficient Data Compression and Encryption in a Persis
 tent Key-Value Store for HPC
DESCRIPTION:Poster\nTech Program Reg Pass, Exhibits Reg Pass\n\nImplementi
 ng Efficient Data Compression and Encryption in a Persistent Key-Value Sto
 re for HPC\n\nKim, Vetter\n\nRecently, persistent data structures, like ke
 y-value stores (KVSs), which are stored in an HPC system's nonvolatile mem
 ory, provide an attractive solution for a number of emerging challenges li
 ke limited I/O performance. This paper investigates how to efficiently int
 egrate data compression and encryption into persistent KVSs for HPC with t
 he ultimate goal of hiding their costs and complexity in terms of performa
 nce and ease of use. We implement the proposed techniques on top of a dist
 ributed embedded KVS to evaluate the benefits and costs of incorporating t
 hese capabilities along different points in the dataflow path, illustratin
 g differences in effective bandwidth, latency, and additional computationa
 l expense.
URL:https://sc18.supercomputing.org/presentation/?id=post181&sess=sess322
END:VEVENT
END:VCALENDAR