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_post185@linklings.com
SUMMARY:Characterizing Declustered Software RAID for Enhancing Storage Rel
 iability and Performance
DESCRIPTION:Poster\nTech Program Reg Pass, Exhibits Reg Pass\n\nCharacteri
 zing Declustered Software RAID for Enhancing Storage Reliability and Perfo
 rmance\n\nQiao, Fu, Chen, Settlemyer\n\nRedundant array of independent dis
 ks (RAID) has been widely used to address the reliability issue in storage
  systems. As the scale of modern storage systems continues growing, disk f
 ailure becomes the norm. With ever-increasing disk capacity, RAID recovery
  based on disk rebuild becomes more costly, which causes significant perfo
 rmance degradation and even unavailability of storage systems. Declustered
  parity and data placement in RAID aims to enhance the recovery performanc
 e by shuffling data among all disks in a RAID group. All disks in the RAID
  group participate in data reconstruction, which leads to reduction of the
  RAID rebuild time. In this work, we extensively evaluate declustered RAID
  in terms of the performance of application I/O and recovery time. Our exp
 erimental results in ZFS show that the speedup of declustered RAID over tr
 aditional RAID is sub-linear to the number of disks in the storage pool.
URL:https://sc18.supercomputing.org/presentation/?id=post185&sess=sess322
END:VEVENT
END:VCALENDAR