PPT-Programming Abstractions for Approximate Computing

Michael Carbin with Sasa Misailovic Hank Hoffmann Deokhwan Kim Stelios Sidiroglou Martin Rinard MIT Challenges for Programming Expression specifying approximations. All Programmable Abstractions push beyond traditional RTL design methodologies to automate all aspects of system development and algorithm deployment into all programmable FPGAs SoC and 3D ICs Xilinx and its Alliance members are working together to Ulya. . R. . Karpuzcu. ukarpuzc@umn.edu. . 12/01/2015. Outline. Background. Pitfalls & Fallacies. Practical Guidelines. 2. 12/01/2015. On Quantification of Accuracy Loss in Approximate Computing. University of Washington. Adrian Sampson, . Hadi. Esmaelizadeh,. 1. Michael . Ringenburg. , . Reneé. St. Amant,. 2. . Luis . Ceze. , . Dan Grossman. , Mark . Oskin. , Karin Strauss,. 3. and Doug Burger. Cynthia Lee. CS106X. Today’s Topics. Quick final exam discussion. Details/logistics, topics, sources for practice problems. Quarter wrap-up. Putting it all together: what have we accomplished together this quarter?. Chapter 1 — Computer Abstractions and Technology — . 2. Classes of Computers. Personal computers. General purpose, variety of software. Subject to cost/performance tradeoff. Server computers. Network based. Cynthia Lee. CS106B. Today’s Topics. Quick final exam discussion. Details/logistics, topics, sources for practice problems. Quarter wrap-up. Putting it all together: what have we accomplished together this quarter?. CSE 332 Data Abstractions: A Heterozygous Forest of AVL, Splay, and B Trees Kate Deibel Summer 2012 July 2, 2012 CSE 332 Data Abstractions, Summer 2012 1 From last time… Binary search trees can give us great performance due to providing a structured binary search. Lecture 19: Analysis of Fork-Join Parallel Programs. Dan Grossman. Spring 2010. Where are we. Done:. How to use . fork. , and . join. to write a parallel algorithm. Why using divide-and-conquer with lots of small tasks is best. Lecture 6: Dictionaries; Binary Search Trees. Dan Grossman. Spring 2010. Where we are. Studying the absolutely essential ADTs of computer science and classic data structures for implementing them. ADTs so far:. Lecture 9: B Trees. Dan Grossman. Spring 2010. Our goal. Problem: A dictionary with so much data most of it is on disk. Desire: A balanced tree (logarithmic height) that is even shallower than AVL trees so that we can minimize disk accesses and exploit disk-block size. Lecture 15: Introduction to Graphs. Dan Grossman. Spring 2010. Graphs. A graph is a formalism for representing relationships among items. Very general definition because very general concept. A . graph. Dictionary ADT. : Arrays, Lists and . Trees. Kate Deibel. Summer 2012. June 27, 2012. CSE 332 Data Abstractions, Summer 2012. 1. Where We Are. Studying the absolutely essential ADTs of computer science and classic data structures for implementing them. The Desired Brand Effect Stand Out in a Saturated Market with a Timeless Brand The Desired Brand Effect Stand Out in a Saturated Market with a Timeless Brand