DOCSLIB.ORG

Seeking Solutions in Configurable Computing

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Seeking Solutions in Configurable Computing Seeking Solutions in Configurable Theme Feature Computing Configurable computing offers the potential of producing powerful new computing systems. Will current research overcome the dearth of commercial applicability to make such systems a reality? onfigurable computing systems com- figuration information for the programmable switches William H. bine programmable hardware with and state information for active computations. Before Mangione-Smith programmable processors to capitalize programming, the chips present a partial architecture, University of California, on the strengths of hardware and soft- which is then refined according to the configuration Los Angeles C ware. Often these systems must also information. The configured device provides an exe- Brad Hutchings address the difficulties of both hardware and software, cution environment for a specific application. Brigham Young University because they mix the technology. While the origins of The most common devices used for configurable configurable computing go back at least 30 years, the computing are field programmable gate arrays. FPGAs David Andrews University of past eight years have brought about a significant present the abstraction of gate arrays, allowing devel- Arkansas increase in research activity. opers to manipulate flip-flops, small amounts of mem- André DeHon Since at least 1989,1 configurable computing sys- ory, and logic gates. University of tems2 have demonstrated the potential for achieving Figure 1 illustrates the basic architectural compo- California, Berkeley high performance for a range of applications, includ- nents of all configurable computers. This highly Carl Ebeling ing image filtering, convolution, morphology, feature abstracted model allows a wide range of design choices, University of extraction, and object tracking. Researchers have all of which revolve around three main decisions. Washington developed prototype systems that achieve performance Reiner an order of magnitude higher than more conventional • Granularity of programmable hardware. Most Hartenstein approaches for a number of applications. However, existing configurable computers use commercial University of Kaiserslautern realizing this potential outside of the laboratory has FPGAs. Consequently, application development Oskar proven difficult because these systems rely on manip- involves the use of traditional CAD tools, which Mencer ulating low-level abstractions—digital circuits, for were developed for application-specific integrated Stanford example—and thus require highly skilled developers. circuits (ASICs). Many application developers University find this low-level abstraction difficult to work John Morris CURRENT STATE OF AFFAIRS with, and the systems achieve poor circuit den- University of Western The earliest configurable computing machine was sity for highly regular structures such as multi- Australia likely proposed, designed, and implemented by Gerald pliers. To raise the level of abstraction, several Krishna Palem Estrin at UCLA in the early 1960s.3 Estrin proposed the configurable computing systems under develop- New York University “fixed plus variable structure computer,” which dedi- ment limit the programmable hardware to the Viktor K. cated hardware to both an (inflexible) abstraction of a interconnect, and in the place of gates and flip- Prasanna programmable processor and a (flexible) component flops they use components such as arithmetic logic University of that implemented digital logic. This basic architecture, units (ALUs) or multipliers. Southern • California which supports programmed hardware and software, is Proximity of the CPU to the programmable hard- at the core of all subsequent configurable computing ware. First-generation systems typically used Henk A.E. Spaanenburg systems. Unfortunately, Estrin’s architectural concepts peripheral buses like the Sparc SBus to provide a Lockheed were well ahead of the enabling technology, and he was coprocessor-like structure. Recently, some re- Sanders only able to prototype a crude approximation of his searchers have argued that the programmable vision. Many of the concepts that are now being dis- hardware must be much closer to the processor, covered by the configurable computing community lie perhaps even on the datapath, fed by processor quietly unheeded in Estrin’s early publications. registers. This issue affects hardware design as The enabling technology behind the renewed inter- well as application development. est in configurable computing is the availability of • Capacity. Different system designers have made high-density VLSI devices that use programmable drastically different choices about fundamental switches to implement flexible hardware architectures. questions of system capacity. What is the best These chips contain memory cells that hold both con- ratio of programmable hardware to memory size 38 Computer 0018-9162/97/$10.00 © 1997 IEEE . and bandwidth? Or processor communication Memory bandwidth? How much programmable hardware is required: an unlimited amount for applications with unbounded parallelism or only so much? Granularity of programmable hardware The configurable computing community is divided into two camps, according to the level of abstraction provided by the programmable hardware. The major- Microprocessor ity of current research efforts use commercial FPGAs Memory and manipulate digital circuits through logic gates and Programmable flip-flops. We will refer to these devices as netlist com- hardware: Gates puters. As part of conventional CAD development of and/or interconnect ASICs, digital circuits are translated into netlists, which are composed of logic gates and flip-flops. In the second camp are the newer architectures, Memory which are based on “chunky” function units such as Memory complete ALUs and multipliers. These architectures limit the programmable hardware to the interconnect among the function units, but implement those units Operation Operation specified with in much less IC area. specified in explicit concurrency, such Netlist computers. A typical netlist computing high-level as loops extracted from language, C or Fortran, device is an FPGA containing thousands of low-pow- like C, VHDL, Verilog, or ered processing elements. For example, an FPGA cell Fortran, schematic diagrams might consist of a single flip-flop and a function gen- Pascal, or Java of digital circuits erator that implements a Boolean function of four variables. FPGAs have a programmable interconnect that is manipulated as individual wires. Because of must be concerned with the size and usage of the FPGA Figure 1. their fine granularity, netlist computers are the most devices, the size and usage of the memories, and finally Architectural flexible configurable computers; their elements can the overall interconnection of all devices on the plat- components of a be used to implement state machines, datapaths, and form during all phases of the design process. The configurable nearly any digital circuit. This flexibility is purchased design process is therefore more difficult and time- computer. with additional silicon, and it results in lowered per- consuming. Furthermore, modifications can require a formance on certain classes of problems, compared significant amount of CAD compilation time. to chunky architectures. The two best-known netlist The challenge to the designers of netlist computers computers are Splash4 and DECPeRLe-1.1 is to show that the increased flexibility presented by Conceptually, Splash consists of a linear array of a low-level abstraction is essential to enable an impor- processing elements. This topology makes Splash a tant class of applications, thus compensating for the good candidate for linear-systolic applications, which increased design difficulty. While a small number of stress neighbor-to-neighbor communications. Because netlist computing systems are available,5 they have of limited routing resources, Splash has not proven as achieved little commercial success thus far. effective at implementing multichip applications that Chunky function unit architectures. General-pur- are not linear systolic, though some progress has been pose processors (including digital signal processors) made. The DECPeRLe-1 is organized as a two-dimen- use optimized function units that operate in bit-par- sional mesh and consists of a 4 × 4 array of FPGAs. allel fashion on long data words. Compared with Each FPGA has connections to its nearest neighbors GPPs, FPGAs are inefficient for performing ordinary as well as to a column bus and a row bus. arithmetic and logic operations. Netlist computing The designers of Splash and the DECPeRLe-1 con- has the advantage when it comes to nonstandard bit- structed them as attached accelerators alongside work- oriented computations such as count-ones, find-first- stations. Neither Splash nor DECPerRLe-1 provide one, or complicated masking and filtering. general-purpose routing networks between FPGAs. At the same time, much of the research in config- Instead they require the designer to manually partition urable computing has focused on parallel DSP applica- the circuit during the design phase, ensuring that the tions. Examples include image morphology, sensor available interconnect is used as efficiently as possible. beam forming, and object recognition. These tasks usu- The netlist computer presents a number of serious ally process sensor data that is 8-12 bits wide. Some fil- challenges to application development. The developers tering might also be necessary, which typically requires December 1997 39
Load more

Recommended publications
  • Sustaining Moore's Law Through Inexactness
    Sustaining Moore’s Law Through Inexactness A Mathematical Foundation John Augustine,1∗ Krishna Palem,2 Parishkrati1 1Department of Computer Science and Engineering, Indian Institute of Technology Madras, Chennai, India. 2Department of Computer Science, Rice University, Houston, USA. ∗Corresponding author; E-mail: augustine@iitm:ac:in. Abstract Inexact computing aims to compute good solutions that require considerably less resource – typically energy – compared to computing exact solutions. While inexactness is motivated by concerns derived from technology scaling and Moore’s law, there is no formal or foundational framework for reasoning about this novel approach to designing algorithms. In this work, we present a fundamental relationship between the quality of computing the value of a boolean function and the energy needed to compute it in a mathematically rigorous and general setting. On this basis, one can study the tradeoff between the quality of the solution to a problem and the amount of energy that is consumed. We accomplish this by introducing a computational model to classify problems based on notions of symmetry inspired by physics. We show that some problems are symmetric in that every input bit is, in a sense, equally important, while other problems display a great deal of asymmetry in the importance of input bits. We believe that our model is novel and provides a foundation for inexact Computing. Building on this, we show that asymmetric problems allow us to invest resources favoring the important bits – a feature that can be leveraged to design efficient inexact algorithms. On the negative side and in contrast, we can prove that the best inexact algorithms for symmetric problems are no better than simply reducing the resource investment uniformly across all bits.
    [Show full text]
  • An Efficient Memory Operations Optimization Technique for Vector Loops on Itanium 2 Processors
    An Efficient Memory Operations Optimization Technique for Vector Loops on Itanium 2 Processors William JALBY, Christophe LEMUET, Sid-Ahmed-Ali TOUATI April 10, 2009 Abstract To keep up with a large degree of instruction level parallelism (ILP), the Itanium 2 cache systems use a complex organization scheme: load/store queues, banking and interleaving. In this paper, we study the impact of these cache systems on memory instructions scheduling. We demonstrate that, if no care is taken at compile time, the non-precise memory disambiguation mechanism and the banking structure cause severe performance loss, even for very simple regular codes. We also show that grouping the memory operations in a pseudo-vectorized way enables the compiler to generate more effective code for the Itanium 2 processor. The impact of this code optimization technique on register pressure is analyzed for various vectorization schemes. keywords Performance Measurement, Cache Optimization, Memory Access Optimization, Bank Conflicts, Memory Address Disambiguation, Instruction Level Parallelism. 1 Introduction To satisfy the ever increasing data request rate of modern microprocessors, large multilevel memory hierarchies are no longer the unique efficient solution [8]: computer architects have to rely on more and more sophisticated mech- anisms [10, 6], in particular, load/store queues (to decouple memory access and arithmetic operations), banking and interleaving (to increase bandwidth), prefetch mechanisms (to offset latency). One key mechanism to tolerate/hide memory latency is the out-of-order processing of memory requests. With the advent of superscalar processors, the concept of load/store queues has become a standard. The basic principle is simple: consecutively issued memory requests are stored in a queue and simultaneously processed.
    [Show full text]
  • School of Electrical and Computer Engineering 2000-2001 Annual Report
    School of Electrical and Computer Engineering 2000-2001 Annual Report School of Electrical and Computer Engineering TABLE OF CONTENTS HIGHLIGHTS OF THE YEAR . .1 ACADEMIC OPERATIONS Undergraduate Instructional Operations . .25 PERSONNEL Graduate Instructional Operations . .25 Faculty Profile . .7 International Study Opportunities . .25 Academic Faculty . .7 GTREP Faculty . .13 EXTERNAL AFFAIRS Professors Emeriti . .13 College of Engineering Hall of Fame . .27 Joint Faculty Appointments . .14 Council of Outstanding Young Engineering Alumni . .27 Adjunct and Part-time Appointments . .14 Academy of Distinguished Engineering Alumni . .27 Faculty Service on Institute Governing Bodies and Committees . .14 Georgia Tech Foundation Grants and Gifts . .28 Technical Interest Groups . .15 ECE Alumni/Professional Advisory Board . .29 Standing Committees . .16 Continuing Education Conferences and Courses . .17 RESEARCH ACTIVITY . .30 Research and Administrative Personnel . .18 FINANCIAL SUMMARY STUDENTS Financial Summary . .30 Student Body Profile . .20 Expenditure Summary . .30 Degrees Awarded . .20 i Student Honors and Awards . .20 CONTACT INFORMATION . .inside back cover Ph.D. Students Graduated . .21 IEEE Student Branch Officers . .24 Eta Kappa Nu Officers . .24 ECE Student Advisory Council . .24 SCHOOL OF ELECTRICAL AND COMPUTER ENGINEERING MISSION STATEMENT UNITY OF PURPOSE Our purpose is to provide students at all degree levels with the highest quality preparation for successful professional careers, and through dedicated scholarship, to advance
    [Show full text]
  • Flexible Error Handling for Embedded Real-Time Systems – Operating System and Run-Time Aspects –
    Flexible Error Handling for Embedded Real-Time Systems – Operating System and Run-Time Aspects – Dissertation zur Erlangung des Grades eines Doktors der Ingenieurwissenschaften der Technischen Universität Dortmund an der Fakultät für Informatik von Andreas Heinig Dortmund 2015 Tag der mündlichen Prüfung: 30. April 2015 Dekan / Dekanin: Prof. Dr. Gernot A. Fink Gutachter / Gutachterinnen: Prof. Dr. Peter Marwedel Prof. Dr. Hermann Härtig (TU Dresden) Acknowledgments I would like to thank my advisor Prof. Peter Marwedel for the initial ideas that lead to this dissertation. Without his advises, writing this thesis in this form would not be feasible. Very special thanks go to Dr. Michael Engel for all the discussions, the advices he gave over the years, and his intensive proof-reading support of this thesis and my publications. I would also like to thank my collaborating colleagues at the Department of Computer Science 12 with special thanks to Florian Schmoll. He provided the compiler support which is required by the flexible error handling approach presented in this thesis. Furthermore, he was available for high valuable technical discussions. Thanks go also to Björn Bönninghoff for providing the timing model for the H.264 decoder and to Ingo Korb for providing various bug fixes for the H.264 library. For proof-reading, I would like to thank Helana Kotthaus, Olaf Neugebauer, Florian Schmoll, and Björn Bönninghoff. My research visit at NTU Singapore was enabled by Prof. Dr. Vincent Mooney and Prof. Dr. Krishna Palem. I like to thank both for the advices that leaded to a publication which received a best paper award.
    [Show full text]
  • Lecture Notes in Computer Science 1742 Edited by G
    Lecture Notes in Computer Science 1742 Edited by G. Goos, J. Hartmanis and J. van Leeuwen 3 Berlin Heidelberg New York Barcelona Hong Kong London Milan Paris Singapore Tokyo P.S. Thiagarajan R. Yap (Eds.) Advances in Computing Science – ASIAN’99 5th Asian Computing Science Conference Phuket, Thailand, December 10-12,1999 Proceedings 13 Series Editors Gerhard Goos, Karlsruhe University, Germany Juris Hartmanis, Cornell University, NY, USA Jan van Leeuwen, Utrecht University, The Netherlands Volume Editors P.S. Thiagarajan Chennai Mathematical Institute 92 G.N. Chetty Road, T. Nagar, Chennai 600 017, India E-mail: [email protected] Roland Yap National University of Singapore, School of Computing Lower Kent Ridge Road, Singapore 119260 E-mail: [email protected] Cataloging-in-Publication data applied for Die Deutsche Bibliothek - CIP-Einheitsaufnahme Advances in computing science - ASIAN ’99 : proceedings / 5th Asian Computing Science Conference, Phuket, Thailand, December 10 - 12, 1999. P. S. Thiagarajan ; R. Yap (ed.) - Berlin ; Heidelberg ; New York ; Barcelona ; Hong Kong ; London ; Milan ; Paris ; Singapore ; Tokyo : Springer, 1999 (Lecture notes in computer science ; Vol. 1742) ISBN 3-540-66856-X CR Subject Classification (1998): F.3, F.4, I.2.3, C.2, C.3, D.3 ISSN 0302-9743 ISBN 3-540-66856-X Springer-Verlag Berlin Heidelberg New York This work is subject to copyright. All rights are reserved, whether the whole or part of the material is concerned, specifically the rights of translation, reprinting, re-use of illustrations, recitation, broadcasting, reproduction on microfilms or in any other way, and storage in data banks. Duplication of this publication or parts thereof is permitted only under the provisions of the German Copyright Law of September 9, 1965, in its current version, and permission for use must always be obtained from Springer-Verlag.
    [Show full text]
  • Hardware and Software for Approximate Computing
    HARDWAREANDSOFTWARE FORAPPROXIMATECOMPUTING adrian sampson A dissertation submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy University of Washington 2015 Reading Committee: Luis Ceze, Chair Dan Grossman, Chair Mark Oskin Program Authorized to Offer Degree: Computer Science & Engineering © 2015 Adrian Sampson abstract HARDWAREANDSOFTWARE FORAPPROXIMATECOMPUTING Adrian Sampson Chairs of the Supervisory Committee: Associate Professor Luis Ceze Associate Professor Dan Grossman Computer Science & Engineering Approximate computing is the idea that we are hindering computer systems’ ef- ficiency by demanding too much accuracy from them. While precision is crucial for some tasks, many modern applications are fundamentally approximate. Per- fect answers are unnecessary or even impossible in domains such as computer vi- sion, machine learning, speech recognition, search, graphics, and physical simu- lation. Today’s systems waste time, energy, and complexity to provide uniformly pristine operation for applications that do not require it. Resilient applications are not, however, a license for computers to abandon predictability in favor of arbitrary errors. We need abstractions that incorporate approximate operation in a disciplined way. Application programmers should be able to exploit these richer abstractions to treat accuracy as a resource and trade it off for more traditional resources such as time, space, or energy. This dissertation explores new abstractions for approximate computing across hardware
    [Show full text]
  • Overcoming the Power Wall by Exploiting Application Inexactness and Emerging COTS Architectural Features: Trading Precision for Improving Application Quality 1
    ARGONNE NATIONAL LABORATORY 9700 South Cass Avenue Lemont, Illinois 60439 Overcoming the Power Wall by Exploiting Application Inexactness and Emerging COTS Architectural Features: Trading Precision for Improving Application Quality 1 Mike Fagan, Jeremy Schlachter, Kazutomo Yoshii, Sven Leyffer, Krishna Palem, Marc Snir, Stefan M. Wild, and Christian Enz Mathematics and Computer Science Division Preprint ANL/MCS-P6040-0816 August 2016 Updates to this preprint may be found at http://www.mcs.anl.gov/publications 1This material was based upon work supported by the U.S. Department of Energy, Office of Science, Offices of Basic Energy Sciences and Advanced Scientific Computing Research under Contract No. DE-AC02-06CH11357. Overcoming the Power Wall by Exploiting Inexactness and Emerging COTS Architectural Features Trading Precision for Improving Application Quality Mike Fagan†, Jeremy Schlachter‡, Kazutomo Yoshii∗, Sven Leyffer∗, Krishna Palem†, Marc Snir∗, Stefan M. Wild∗, and Christian Enz‡ ∗Mathematics and Computer Science Division Argonne National Laboratory, Lemont, IL 60439, USA †Department of Computer Science Rice University, Houston, TX, USA ‡Integrated Circuits Laboratory (ICLAB) Ecole Polytechnique Fed´ erale´ de Lausanne (EPFL), Neuchatel,ˆ Switzerland Abstract—Energy and power consumption are major limita- engaged in a project aimed at leading to the deployment of tions to continued scaling of computing systems. Inexactness an exascale computer by 2023. Power consumption is a major where the quality of the solution can be traded for energy savings obstacle to the timely deployment of an exascale platform. has been proposed as a counterintuitive approach to overcoming those limitation. However, in the past, inexactness has been neces- The current top supercomputer, Sunway, consumes 15.3MW sitated the need for highly customized or specialized hardware.
    [Show full text]
  • GRADUATE STUDY in COMPUTER SCIENCE Rice University Graduate
    Graduate Study at MESSAGE FROM THE DEPARTMENT CHAIR GRADUATE STUDY IN Computers and computing are an integral part of our lives today. Computing is revolutionizing the process of research, development, and discovery in all fields of COMPUTER SCIENCE engineering and science. The societal impact of computing continues to increase Rice University as computers become more broadly accessible. Meanwhile, the foundations of computing also continue to change at a dizzying pace. New technologies, such as manycore processors, mobile computing, and cloud computing are reshaping the landscape of computing, and new challenges are emerging as computer science WWW.COMPSCI.RICE.EDU becomes increasingly multidisciplinary. Leading-edge skills in Computer Science are in demand by employers across a wide range of industries. A strong Computer Science department is essential to Rice’s mission to be a world-class research university that prepares students to contribute to the advancement of society. Rice has a long history of leadership in computing, starting with development of the R1 computer in the late 1950s. The Department of Computer Science is continuing this legacy by advancing the frontiers of computing. We have a three- fold mission: to create knowledge, to disseminate knowledge, and to provide ser- vice to our communities—the local Rice community and the broader community beyond the campus. We serve as a center of expertise in computing technologies for our university, our research collaborators, and our industry partners. On the research front, our faculty, staff, and students are exploring innovative ideas in areas that range from parallel computing through text and data analytics, from ways to program computers through ways to build them, and from funda- mental principles of logic and discrete mathematics through the application of those principles to gaming, voting, and driving robots.
    [Show full text]
  • An Optimum Inexact Design for an Energy Efficient Hearing
    An Optimum Inexact Design for an Energy Efficient Hearing Aid Sai Praveen Kadiyala, Aritra Sen, Shubham Mahajan, Quingyun Wang, Avinash Lingamaneni, James Sneed German, Hong Xu, Krishna Palem, Arindam Basu To cite this version: Sai Praveen Kadiyala, Aritra Sen, Shubham Mahajan, Quingyun Wang, Avinash Lingamaneni, et al.. An Optimum Inexact Design for an Energy Efficient Hearing Aid. Journal of Low Power Electronics, American Scientific Publishers, 2019, 15 (2), pp.129-143. 10.1166/jolpe.2019.1610. hal-02546135 HAL Id: hal-02546135 https://hal.archives-ouvertes.fr/hal-02546135 Submitted on 17 Apr 2020 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. Copyright © 2019 American Scientific Publishers Journal of All rights reserved Low Power Electronics Printed in the United States of America Vol. 15, 129–143, 2019 An Optimum Inexact Design for an Energy Efficient Hearing Aid Sai Praveen Kadiyala1 ∗,AritraSen2, Shubham Mahajan2, Quingyun Wang2, Avinash Lingamaneni3, James Sneed German4, Hong Xu5, Krishna V. Palem6, and Arindam Basu2 1School of Computer Science
    [Show full text]
  • Exploiting Errors for Efficiency: a Survey from Circuits to Algorithms
    Exploiting Errors for Efficiency: A Survey from Circuits to Applications The MIT Faculty has made this article openly available. Please share how this access benefits you. Your story matters. Citation Stanley-Marbell, Phillip et al. "Exploiting Errors for Efficiency: A Survey from Circuits to Applications." ACM Computing Surveys 53, 3 (July 2020): dx.doi.org/10.1145/3394898 © 2020 ACM As Published http://dx.doi.org/10.1145/3394898 Publisher Association for Computing Machinery (ACM) Version Original manuscript Citable link https://hdl.handle.net/1721.1/129955 Terms of Use Creative Commons Attribution-Noncommercial-Share Alike Detailed Terms http://creativecommons.org/licenses/by-nc-sa/4.0/ Exploiting Errors for Efficiency: A Survey from Circuits to Algorithms PHILLIP STANLEY-MARBELL, University of Cambridge ARMIN ALAGHI, University of Washington MICHAEL CARBIN, Massachusetts Institute of Technology EVA DARULOVA, Max Planck Institute for Software Systems LARA DOLECEK, University of California at Los Angeles ANDREAS GERSTLAUER, The University of Texas at Austin GHAYOOR GILLANI, University of Twente DJORDJE JEVDJIC, National University of Singapore THIERRY MOREAU, University of Washington MATTIA CACCIOTTI, École Polytechnique Fédérale de Lausanne ALEXANDROS DAGLIS, École Polytechnique Fédérale de Lausanne NATALIE ENRIGHT JERGER, University of Toronto BABAK FALSAFI, École Polytechnique Fédérale de Lausanne SASA MISAILOVIC, University of Illinois at Urbana-Champaign ADRIAN SAMPSON, Cornell University DAMIEN ZUFFEREY, Max Planck Institute for
    [Show full text]
  • Error-Efficient Computing Systems
    Full text available at: http://dx.doi.org/10.1561/1000000049 Error-Efficient Computing Systems Phillip Stanley-Marbell University of Cambridge [email protected] Martin Rinard Massachusetts Institute of Technology [email protected] Boston — Delft Full text available at: http://dx.doi.org/10.1561/1000000049 Foundations and Trends® in Electronic Design Automation Published, sold and distributed by: now Publishers Inc. PO Box 1024 Hanover, MA 02339 United States Tel. +1-781-985-4510 www.nowpublishers.com [email protected] Outside North America: now Publishers Inc. PO Box 179 2600 AD Delft The Netherlands Tel. +31-6-51115274 The preferred citation for this publication is P. Stanley-Marbell and M. Rinard. Error-Efficient Computing Systems. Foundations and Trends® in Electronic Design Automation, vol. 11, no. 4, pp. 362–461, 2017. ® This Foundations and Trends issue was typeset in LATEX using a class file designed by Neal Parikh. Printed on acid-free paper. ISBN: 978-1-68083-358-4 © 2017 P. Stanley-Marbell and M. Rinard All rights reserved. No part of this publication may be reproduced, stored in a retrieval system, or trans- mitted in any form or by any means, mechanical, photocopying, recording or otherwise, without prior written permission of the publishers. Photocopying. In the USA: This journal is registered at the Copyright Clearance Center, Inc., 222 Rose- wood Drive, Danvers, MA 01923. Authorization to photocopy items for internal or personal use, or the internal or personal use of specific clients, is granted by now Publishers Inc for users registered with the Copyright Clearance Center (CCC).
    [Show full text]
  • Microarchitecture-Aware Physical Planning for Deep Submicron Technology Mongkol Ekpanyapong
    Microarchitecture-Aware Physical Planning for Deep Submicron Technology A Thesis Presented to The Academic Faculty by Mongkol Ekpanyapong In Partial Fulfillment of the Requirements for the Degree Doctor of Philosophy School of Electrical and Computer Engineering Georgia Institute of Technology May 2006 Microarchitecture-Aware Physical Planning for Deep Submicron Technology Approved by: Asst. Professor Sung Kyu Lim, Advisor Professor Abhijit Chatterjee School of Electrical and School of Electrical and Computer Engineering Computer Engineering Georgia Institute of Technology, Adviser Georgia Institute of Technology Professor Sudhakar Yalamanchili Asst. Professor Gabriel H. Loh School of Electrical and College of Computing Computer Engineering Georgia Institute of Technology Georgia Institute of Technology Asst. Professor Hsien-Hsin Sean Lee School of Electrical and Computer Engineering Georgia Institute of Technology Date Approved Novermber 14, 2005 Dedicated to my mother, Anongrath Saesua and my father, Veerachai Ekpanyapong iii ACKNOWLEDGEMENTS I would like to express my sincere gratitude to Professor Sung Kyu Lim for his guidance of my research and his patience during my Ph.D. study at Georgia Tech. I would like to thank my thesis committee members, Professor Sudhakar Yalamanchili, Professor Hsien-Hsin Sean Lee, Professor Abhijit Chatterjee, Prof. Gabriel H. Loh for their valuable suggestions, especially Professor Yalamanchili and Professor Lee who served me as my reading committee members. I also would like to thank my thesis proposal committee member, Professor Alan Doolittle for his valuable suggestion. I would like to thank all the members of GTCAD and CREST groups for their support and friendship, especially, Jacob Minz, Michael B. Healy, Thaisiri Watewai, Ismail F. Baskaya, J.C.
    [Show full text]