BEGIN:VCALENDAR
PRODID:-//Microsoft Corporation//Outlook MIMEDIR//EN
VERSION:2.0
BEGIN:VEVENT
DTSTART:20141119T220000Z
DTEND:20141119T223000Z
LOCATION:391-92
DESCRIPTION;ENCODING=QUOTED-PRINTABLE:ABSTRACT: Object storage is considered a promising solution for the next-generation (exascale) high performance computing platform due to its flexible and high performance object interface. However, delivering high burst-write throughput is still a critical challenge. Although deploying more storage servers can potentially provide higher throughput, it can be ineffective as the burst-write throughput is limited by a small number of possible stragglers. In this paper, we propose a two-choice randomized dynamic I/O scheduler to avoid stragglers and hence achieve high throughput. The contributions include: 1) we propose a two-choice randomized dynamic I/O scheduler with collaborative probe and preassign strategies; 2) we design and implement a redirect table and metadata maintainer to address the metadata management challenge introduced by dynamic I/O scheduling; and 3) we evaluate the proposed scheduler with both simulation and experimental tests in HPC cluster. The evaluation results confirmed the scalability and performance benefits of the proposed I/O scheduler.
SUMMARY:Two-Choice Randomized Dynamic I/O Scheduler for Object Storage Systems
PRIORITY:3
END:VEVENT
END:VCALENDAR