BEGIN:VCALENDAR
PRODID:-//Microsoft Corporation//Outlook MIMEDIR//EN
VERSION:2.0
BEGIN:VEVENT
DTSTART:20141119T223000Z
DTEND:20141119T230000Z
LOCATION:393-94-95
DESCRIPTION;ENCODING=QUOTED-PRINTABLE:ABSTRACT: In this paper, we present an approach to fault-tolerant execution of dynamic task graphs scheduled using work-stealing.  In particular, we focus on selective and localized recovery of tasks in the presence of soft faults. We present an application programming interface that elicits the basic task graph structure in terms of successor and predecessor relationships. The work-stealing based task graph scheduling algorithm is then augmented to enable recovery when the data and meta-data associated with a task get corrupted. We use this redundancy, and the information on the task graph provided by the API, to selectively recovery from faults with low space and time overheads. We show that the fault-tolerant design retains the essential properties of the underlying work stealing-based task scheduling algorithm. We also show that the fault tolerant execution is asymptotically optimal when the re-execution of tasks is taken into account.  Experimental evaluation demonstrates the effectiveness of the approach.
SUMMARY:Fault-Tolerant Dynamic Task Graph Scheduling
PRIORITY:3
END:VEVENT
END:VCALENDAR