BEGIN:VCALENDAR
VERSION:2.0
PRODID:Linklings LLC
BEGIN:VTIMEZONE
TZID:America/New_York
X-LIC-LOCATION:America/New_York
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:19700308T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=2SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:19701101T020000
RRULE:FREQ=YEARLY;BYMONTH=11;BYDAY=1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20210402T160544Z
LOCATION:Poster Module
DTSTART;TZID=America/New_York:20201119T083000
DTEND;TZID=America/New_York:20201119T170000
UID:submissions.supercomputing.org_SC20_sess337_rpost138@linklings.com
SUMMARY:Quantifying the Overheads of the Modern Linux I/O Stack
DESCRIPTION:Posters, Research Posters\n\nQuantifying the Overheads of the 
 Modern Linux I/O Stack\n\nLogan, Kougkas, Sun\n\nThe performance of the Li
 nux I/O stack is critical to the performance of distributed storage applic
 ations. Recent research has shown that the Linux I/O stack introduces mult
 iple overheads that significantly reduce and randomize the performance of 
 I/O operations. A lesser amount of research has been conducted into quanti
 fying the software overheads in the Linux I/O stack. In this research, we 
 quantify this overhead by tracing the POSIX read()/write() system calls on
  various storage devices and filesystems. By comparing the amount of time 
 spent in software versus the amount of time spent in performing I/O, we ca
 n gain insight on how much overhead the Linux I/O stack produces and explo
 re solutions that can mitigate these overheads.\n\nWe will be presenting t
 he amount of time spent in different layers of the Linux I/O stack to show
  where the overheads are, and we will explore potential ways to bypass the
 se overheads.\n\nRegistration Category: Tech Program Reg Pass, Exhibits Re
 g Pass
END:VEVENT
END:VCALENDAR