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:20260522T150111Z
LOCATION:C2/3/4 Ballroom
DTSTART;TZID=America/Chicago:20181115T083000
DTEND;TZID=America/Chicago:20181115T170000
UID:submissions.supercomputing.org_SC18_sess324_post185@linklings.com
SUMMARY:Characterizing Declustered Software RAID for Enhancing Storage Rel
 iability and Performance
DESCRIPTION:Zhi Qiao and Song Fu (University of North Texas) and Hsing-bun
 g Chen and Bradley Settlemyer (Los Alamos National Laboratory)\n\nRedundan
 t array of independent disks (RAID) has been widely used to address the re
 liability issue in storage systems. As the scale of modern storage systems
  continues growing, disk failure becomes the norm. With ever-increasing di
 sk capacity, RAID recovery based on disk rebuild becomes more costly, whic
 h causes significant performance degradation and even unavailability of st
 orage systems. Declustered parity and data placement in RAID aims to enhan
 ce the recovery performance by shuffling data among all disks in a RAID gr
 oup. 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 experimental results in ZFS show that the speedup o
 f declustered RAID over traditional RAID is sub-linear to the number of di
 sks in the storage pool.\n\nRegistration Category: Tech Program Reg Pass, 
 Exhibits Reg Pass\n\n
END:VEVENT
END:VCALENDAR