MS Thesis Defense - Florian Raudies

Starts:
1:00 pm on Friday, June 27, 2014
Ends:
2:30 pm on Friday, June 27, 2014
Location:
8 Saint Mary's Street, Room 339
Robust, Malleable Computing Through Lookup Tables -- Date: Friday, June 27, 2014, 1:00pm -- 8 Saint Mary's Street, Room 339 -- Advisor: Ajay Joshi (ECE); Committee: Gregory Snider (HP labs); Martin Herbordt (ECE) --- Cloud computing demands the re-configurability on a sub-core basis to maximize the performance per customer application and overall utilization of hardware resources in a data center. We propose lookup table based hybrid designs of arithmetic units that can also function as cache, thus supporting re-configurability. These designs are comparable in area and timing to conventional gate logic designs and are more robust to soft errors than conventional gate logic designs.