Page 1 |
Save page Remove page | Previous | 1 of 130 | Next |
|
small (250x250 max)
medium (500x500 max)
Large (1000x1000 max)
Extra Large
large ( > 500x500)
Full Resolution
All (PDF)
|
This page
All
|
RESILIENCY-AWARE SCHEDULING
by
Jeremy Abramson
A Dissertation Presented to the
FACULTY OF THE USC GRADUATE SCHOOL
UNIVERSITY OF SOUTHERN CALIFORNIA
In Partial Fulfillment of the
Requirements for the Degree
DOCTOR OF PHILOSOPHY
(COMPUTER SCIENCE)
May 2013
Copyright 2013 Jeremy Abramson
Object Description
| Title | Resiliency-aware scheduling |
| Author | Abramson, Jeremy D. |
| Author email | jdabrams@usc.edu;jeremy.d.abramson@gmail.com |
| Degree | Doctor of Philosophy |
| Document type | Dissertation |
| Degree program | Computer Science (High Performance Computing and Simulations) |
| School | Viterbi School of Engineering |
| Date defended/completed | 2013-01-10 |
| Date submitted | 2013-03-05 |
| Date approved | 2013-03-05 |
| Restricted until | 2013-03-05 |
| Date published | 2013-03-05 |
| Advisor (committee chair) | Diniz, Pedro C. |
| Advisor (committee member) |
Nakano, Aiichiro Raghavendra, Cauligi S. |
| Abstract | Hostile environments, shrinking feature sizes and processor aging elicit a need for resilient computing. Traditional course-grained approaches, such as software Checkpoint and Restart (C/R) and hardware Triple Modular Redundancy (TMR), while exhibiting acceptable levels of fault coverage, are often wasteful of resources such as time, device/chip area or power. In order to mitigate these shortcomings, Resiliency-aware Scheduling (RaS), a source-level approach is introduced and described. Resiliency-aware Scheduling combines traditional compiler techniques such as critical path and dependency analysis with the ability to potentially modify the target architecture’s resource configuration. This new approach can, in many cases, offer operational coverage similar to traditional schemes, while enjoying a performance advantage and area savings. ❧ To support Resiliency-aware Scheduling, several novel concepts and contributions are introduced. First, this thesis introduces the concept of Intrinsic Resiliency (IR), a measure of available Temporal Redundancy (TR) due to a computation’s lack of instruction-level parallelism for a fixed set of resources. Second, Hybrid TMR (hTMR), a flexible hardware design scheme that allows for trade-offs between performance and resiliency is presented. By implementing hTMR units, an RaS-hardened design maintains operational coverage while providing more scheduling flexibility, and thereby potentially better performance, than designs using traditional monolithic TMR units. Lastly, two distinct Resiliency-aware Scheduling infrastructures are described: the first based on the Open64 compiler, targeting Field Programmable Gate Arrays (FPGA), and the second based on the Vex compiler toolchains, targeting reconfigurable softcore Very Long Instruction Word (VLIW) architectures. ❧ This thesis also presents promising experimental results from the use of these two infrastructures. For the FPGA target, when using slice Look Up Tables (LUT) as the design metric, the RaS designs synthesized from a test suite of realistic kernel codes were, on average, 19% smaller than the TMR designs with equivalent performance and operational coverage. For the softcore VLIW target, the RaS-hardened executables developed for a case study perform between 15% and 40% faster than a competing software hardening approach. The RaS-derived VLIW executables are also shown to scale better than TMR, with up to a 40% performance improvement over an equivalently sized TMR computation. ❧ While mainstream compilation and synthesis tools exclusively focus on raw execution time or silicon area usage, the increasing rates of soft errors will likely prompt tool designers to focus on error mitigation as an integral part of their design methodologies. The ability to handle resiliency in the same automated fashion as other design attributes, such as area or power consumption, is greatly needed as architectures evolve. The work described here is a first step in this direction. |
| Keyword | resiliency; compilers; FPGA; reconfigurable; fault-tolerance; area consumption; SEU; errors; single-event upsets; scheduling; VLIW |
| Language | English |
| Part of collection | University of Southern California dissertations and theses |
| Publisher (of the original version) | University of Southern California |
| Place of publication (of the original version) | Los Angeles, California |
| Publisher (of the digital version) | University of Southern California. Libraries |
| Provenance | Electronically uploaded by the author |
| Type | texts |
| Legacy record ID | usctheses-m |
| Contributing entity | University of Southern California |
| Rights | Abramson, Jeremy D. |
| Physical access | The author retains rights to his/her dissertation, thesis or other graduate work according to U.S. copyright law. Electronic access is being provided by the USC Libraries in agreement with the author, as the original true and official version of the work, but does not grant the reader permission to use the work if the desired use is covered by copyright. It is the author, as rights holder, who must provide use permission if such use is covered by copyright. The original signature page accompanying the original submission of the work to the USC Libraries is retained by the USC Libraries and a copy of it may be obtained by authorized requesters contacting the repository e-mail address given. |
| Repository name | University of Southern California Digital Library |
| Repository address | USC Digital Library, University of Southern California, University Park Campus MC 7002, 106 University Village, Los Angeles, California 90089-7002, USA |
| Repository email | cisadmin@dots.usc.edu |
| Archival file | uscthesesreloadpub_Volume7/etd-AbramsonJe-1459.pdf |
Description
| Title | Page 1 |
| Contributing entity | University of Southern California |
| Repository email | cisadmin@dots.usc.edu |
| Full text | RESILIENCY-AWARE SCHEDULING by Jeremy Abramson A Dissertation Presented to the FACULTY OF THE USC GRADUATE SCHOOL UNIVERSITY OF SOUTHERN CALIFORNIA In Partial Fulfillment of the Requirements for the Degree DOCTOR OF PHILOSOPHY (COMPUTER SCIENCE) May 2013 Copyright 2013 Jeremy Abramson |
