Penn ESE534 Spring2012 -- DeHon 1 ESE534: Computer Organization Day 1: January 11, 2012 Introduction and Overview.

Slides:



Advertisements
Similar presentations
Slides Prepared from the CI-Tutor Courses at NCSA By S. Masoud Sadjadi School of Computing and Information Sciences Florida.
Advertisements

Multiprocessors— Large vs. Small Scale Multiprocessors— Large vs. Small Scale.
Lecture 38: Chapter 7: Multiprocessors Today’s topic –Vector processors –GPUs –An example 1.
Lecture 6: Multicore Systems
Reconfigurable Computing CS294-6 Fall 1998 Dr. Andre DeHon.
Caltech CS184a Fall DeHon1 CS184a: Computer Architecture (Structures and Organization) Day1: September 25, 2000 Introduction and Overview.
Balancing Interconnect and Computation in a Reconfigurable Array Dr. André DeHon BRASS Project University of California at Berkeley Why you don’t really.
SYNAR Systems Networking and Architecture Group CMPT 886: Special Topics in Operating Systems and Computer Architecture Dr. Alexandra Fedorova School of.
Caltech CS184a Fall DeHon1 CS184a: Computer Architecture (Structures and Organization) Day20: November 29, 2000 Review.
CS294-6 Reconfigurable Computing Day 5 September 8, 1998 Comparing Computing Devices.
CS294-6 Reconfigurable Computing Day 6 September 10, 1998 Comparing Computing Devices.
Penn ESE Spring DeHon 1 ESE (ESE534): Computer Organization Day 15: March 12, 2007 Interconnect 3: Richness.
Caltech CS184a Fall DeHon1 CS184a: Computer Architecture (Structures and Organization) Day8: October 18, 2000 Computing Elements 1: LUTs.
Penn ESE Spring DeHon 1 ESE (ESE534): Computer Organization Day 9: February 7, 2007 Instruction Space Modeling.
Penn ESE Fall DeHon 1 ESE (ESE534): Computer Organization Day 19: March 26, 2007 Retime 1: Transformations.
Prof. John Nestor ECE Department Lafayette College Easton, Pennsylvania ECE Computer Organization Lecture 2 - Technology.
Penn ESE Spring DeHon 1 ESE (ESE534): Computer Organization Day 26: April 18, 2007 Et Cetera…
Penn ESE Spring DeHon 1 ESE (ESE534): Computer Organization Day 11: February 14, 2007 Compute 1: LUTs.
Penn ESE Spring DeHon 1 ESE (ESE534): Computer Organization Day 4: January 22, 2007 Memories.
EET 4250: Chapter 1 Performance Measurement, Instruction Count & CPI Acknowledgements: Some slides and lecture notes for this course adapted from Prof.
CS 300 – Lecture 2 Intro to Computer Architecture / Assembly Language History.
Penn ESE Spring DeHon 1 ESE (ESE534): Computer Organization Day 1: January 8, 2007 Introduction and Overview.
Penn ESE Spring DeHon 1 FUTURE Timing seemed good However, only student to give feedback marked confusing (2 of 5 on clarity) and too fast.
Penn ESE Spring DeHon 1 ESE (ESE534): Computer Organization Day 5: January 24, 2007 ALUs, Virtualization…
Chapter 1 Sections 1.1 – 1.3 Dr. Iyad F. Jafar Introduction.
Design and Implementation of VLSI Systems (EN1600) lecture01 Sherief Reda Division of Engineering, Brown University Spring 2008 [sources: Weste/Addison.
Reconfigurable Computing. This Class is About Reconfigurable Computing Computer Architecture Coping with Change.
Penn ESE534 Spring DeHon 1 ESE534: Computer Organization Day 11: March 3, 2014 Instruction Space Modeling 1.
CBSSS 2002: DeHon Architecture as Interface André DeHon Friday, June 21, 2002.
Caltech CS184 Winter DeHon CS184: Computer Architecture (Structure and Organization) Day 1: January 3, 2005 Introduction and Overview.
EET 4250: Chapter 1 Computer Abstractions and Technology Acknowledgements: Some slides and lecture notes for this course adapted from Prof. Mary Jane Irwin.
Multi-core Programming Introduction Topics. Topics General Ideas Moore’s Law Amdahl's Law Processes and Threads Concurrency vs. Parallelism.
Sogang University Advanced Computing System Chap 1. Computer Architecture Hyuk-Jun Lee, PhD Dept. of Computer Science and Engineering Sogang University.
Penn ESE534 Spring DeHon 1 ESE534: Computer Organization Day 9: February 24, 2014 Operator Sharing, Virtualization, Programmable Architectures.
Penn ESE370 Fall DeHon 1 ESE370: Circuit-Level Modeling, Design, and Optimization for Digital Systems Day 1: September 5, 2012 Introduction and.
CBSSS 2002: DeHon Costs André DeHon Wednesday, June 19, 2002.
Penn ESE534 Spring DeHon 1 ESE534: Computer Organization Day 7: February 6, 2012 Memories.
Advanced Computer Architecture Fundamental of Computer Design Instruction Set Principles and Examples Pipelining:Basic and Intermediate Concepts Memory.
Penn ESE370 Fall DeHon 1 ESE370: Circuit-Level Modeling, Design, and Optimization for Digital Systems Day 1: September 8, 2010 Introduction and.
Caltech CS184 Winter DeHon 1 CS184a: Computer Architecture (Structure and Organization) Day 7: January 24, 2003 Instruction Space.
Penn ESE370 Fall DeHon 1 ESE370: Circuit-Level Modeling, Design, and Optimization for Digital Systems Day 1: September 7, 2011 Introduction and.
Penn ESE370 Fall DeHon 1 ESE370: Circuit-Level Modeling, Design, and Optimization for Digital Systems Day 1: August 27, 2014 Introduction and Overview.
Penn ESE534 Spring DeHon 1 ESE534: Computer Organization Day 5: February 1, 2010 Memories.
Penn ESE534 Spring DeHon 1 ESE534: Computer Organization Day 1: January 13, 2010 Introduction and Overview.
Processor Level Parallelism. Improving the Pipeline Pipelined processor – Ideal speedup = num stages – Branches / conflicts mean limited returns after.
Single-Chip Heterogeneous Computing: Does the Future Include Custom Logic, FPGAs, and GPGPUs? Wasim Shaikh Date: 10/29/2015.
Caltech CS184 Winter DeHon CS184: Computer Architecture (Structure and Organization) Day 1: January 6, 2003 Introduction and Overview.
Caltech CS184 Winter DeHon 1 CS184a: Computer Architecture (Structure and Organization) Day 13: February 6, 2003 Interconnect 3: Richness.
Computer Organization Yasser F. O. Mohammad 1. 2 Lecture 1: Introduction Today’s topics:  Why computer organization is important  Logistics  Modern.
Penn ESE534 Spring DeHon 1 ESE534 Computer Organization Day 9: February 13, 2012 Interconnect Introduction.
Caltech CS184 Winter DeHon CS184a: Computer Architecture (Structure and Organization) Day 4: January 15, 2003 Memories, ALUs, Virtualization.
Caltech CS184 Winter DeHon 1 CS184a: Computer Architecture (Structure and Organization) Day 11: January 31, 2005 Compute 1: LUTs.
Penn ESE534 Spring DeHon 1 ESE534: Computer Organization Day 11: February 20, 2012 Instruction Space Modeling.
Penn ESE534 Spring DeHon 1 ESE534: Computer Organization Day 8: February 19, 2014 Memories.
Computer Organization IS F242. Course Objective It aims at understanding and appreciating the computing system’s functional components, their characteristics,
ESE534: Computer Organization
ESE534: Computer Organization
ESE534 Computer Organization
ESE532: System-on-a-Chip Architecture
Architecture & Organization 1
Day 1: August 28, 2013 Introduction and Overview
Architecture & Organization 1
ESE534: Computer Organization
ESE534: Computer Organization
ESE534: Computer Organization
A High Performance SoC: PkunityTM
ESE534: Computer Organization
CS184a: Computer Architecture (Structures and Organization)
ESE534: Computer Organization
ESE534: Computer Organization
Presentation transcript:

Penn ESE534 Spring DeHon 1 ESE534: Computer Organization Day 1: January 11, 2012 Introduction and Overview

Penn ESE534 Spring DeHon 2 Today Matter Computes Architecture Matters This Course (short) Unique Nature of This Course Change More on this course

Power of Computation Which set or gates is more powerful? –Set 1: AND2, AND3, AND4 –Set 2: AND2, OR2 –Set 3: NAND2 –Set 4: AND2, XOR2 (assume have unlimited number of gates in each set) Penn ESE534 Spring DeHon 3

4 Review (assert?): Two Universality Facts NAND gate Universality [Day 2, ESE170/CIS240] –We can implement any computation by interconnecting a sufficiently large network of NAND gates Turing Machine is Universal [CIS262] –We can implement any computable function with a TM –We can build a single TM which can be programmed to implement any computable function Day 2 reading ( on Blackboard ) SciAm-level review

Penn ESE534 Spring DeHon 5 Matter Computes We can build NAND gates out of: –transistors (semiconductor devices) physical laws of electron conduction –mechanical switches basic physical mechanics –protein binding / promotion / inhibition Basic biochemical reactions – …many other things Weiss/ NSC 2001

LEGO TM Logic Gates Penn ESE534 Spring DeHon 6

7 Starting Point Given sufficient raw materials: –can implement any computable function Our goal in computer architecture –is not to figure out how to compute new things –rather, it is an engineering problem

Penn ESE534 Spring DeHon 8 Engineering Problem Implement a computation: –with least resources (in fixed resources) with least cost –in least time (in fixed time) –with least energy With fixed energy budget Optimization problem –how do we do it best?

Penn ESE534 Spring DeHon 9 Quote “An Engineer can do for a dime what everyone else can do for a dollar.”

How much difference? Experience running things on multiple architectures? –E.g. GPU, FPGA, Processor…. –Preferably at same technology node. Same Silicon die area Penn ESE534 Spring DeHon 10

Penn ESE534 Spring DeHon 11 Architecture Matters? How much difference is there between architectures? How badly can I be wrong in implementing/picking the wrong architecture? How efficient is the IA-32, IA-64, GPGPU? –Is there much room to do better? Is architecture done? –A solved problem?

Penn ESE534 Spring DeHon 12 Peak Computational Densities from Model Small slice of space –only 2 parameters 100  density across Large difference in peak densities –large design space!

Penn ESE534 Spring DeHon 13 Yielded Efficiency Large variation in yielded density –large design space! FPGA (c=w=1) “Processor” (c=1024, w=64)

Penn ESE534 Spring DeHon 14 Architecture Not Done Many ways, not fully understood –design space –requirements of computation –limits on requirements, density... …and the costs are changing –optimal solutions change –dominant constraints change –creating new challenges and opportunities

Penn ESE534 Spring DeHon 15 Personal Goal? Develop systematic design Parameterize design space –adapt to costs Understand/capture req. of computing Efficiency metrics –(similar to information theory?) …we’ll see a start at these this term Interconnect Memory Compute

Penn ESE534 Spring DeHon 16 Architecture Not Done Not here to just teach you the forms which are already understood –(though, will do that and give you a strong understanding of their strengths and weaknesses) Goal: enable you to design and synthesize new and better architectures

Penn ESE534 Spring DeHon 17 This Course (short) How to organize computations Requirements Design space Characteristics of computations Building blocks –compute, interconnect, retiming, instructions, control Comparisons, limits, tradeoffs

Penn ESE534 Spring DeHon 18 This Course Sort out: –Custom, RISC, SIMD, Vector, VLIW, Multithreaded, Superscalar, EPIC, MIMD, FPGA, GPGPUs Basis for design and analysis Techniques [more detail at end]

Penn ESE534 Spring DeHon 19 Graduate Class Assume you are here to learn –Motivated –Mature Reading –Not 1:1 with lecture and assignments –Won’t be policing you –You may need to follow some links beyond “required” reading Problems –May not be fully, tightly specified

Penn ESE534 Spring DeHon 20 Uniqueness of Class

Penn ESE534 Spring DeHon 21 Not a Traditional Arch. Class Traditional class (240, 370, 501) –focus RISC Processor –history –undergraduate class on  P internals –then graduate class on details This class –much broader in scope –develop design space –see RISC processors in context of alternatives

Penn ESE534 Spring DeHon 22 Authority/History ``Science is the belief in the ignorance of experts.'' -- Richard Feynman Traditional Architecture has been too much about history and authority Should be more about engineering evaluation –physical world is “final authority” Goal: Teach you to think critically and independently about computer design.

Penn ESE534 Spring DeHon 23 Next Few Lectures Quick run through logic/arithmetic basics –make sure everyone remembers –(some see for first time?) –get us ready to start with observations about the key components of computing devices Trivial/old hat for many –But will be some observations couldn’t make in ESE170/CIS370 May be fast if seeing for first time Background quiz intended to help me tune

Penn ESE534 Spring DeHon 24 Themes Design Space Parameterization Costs Change Structure in Computations

Penn ESE534 Spring DeHon 25 Focus Focus on raw computing organization Not worry about nice abstractions, models –501, 370, 240 provide a few good models Instruction Set Architecture (ISA) Shared Memory Transactional… –…and you should know others Dataflow, streaming, data parallel, …

Penn ESE534 Spring DeHon 26 Change A key feature of the computer industry has been rapid and continual change. We must be prepared to adapt. True of this course as well –….things are still changing… –We’ll try to figure it out together…

Penn ESE534 Spring DeHon 27 What has changed? [Discuss] Capacity –Total –Per die Size Applications –Number –Size/complexity of each –Types/variety Use Environment –Embedded –Mission critical Speed –Ratio of fast memory to dense memory –Wire delay vs. Gate delay –Onchip vs. inter-chip Joules/op Mfg cost –Per transistor –Per wafer –NRE (Non-recurring engineering) Reliability Limited by –Transistors, energy…

Penn ESE534 Spring DeHon 28 Intel’s Moore’s Law (Scaling) >1000x

Penn ESE534 Spring DeHon (early VLSI) Early RISC processors –RISC = Reduced Instruction Set Computer –RISC-II, 40K transistors –MIPS, 24K transistors –~10MHz clock cycle Xilinx XC2064 –64 4-LUTs LUT = Look-Up Table 4-LUT – program to be any gate of 4 inputs

Penn ESE534 Spring DeHon 30 Today CPUs –Billions of transistors –6+ CPU per die –Multi-issue, 64b processors –GHz clock cycles –MByte caches FPGAs –>500,000 bit processing elements –10s of Mbits of on-chip RAM AMD Quad Core Opteron Altera Stratix IV

Penn ESE534 Spring DeHon 31 MOS Transistor Scaling (1974 to present) S=0.7 [0.5x per 2 nodes] Pitch Gate Source: 2001 ITRS - Exec. Summary, ORTC Figure [from Andrew Kahng]

Penn ESE534 Spring DeHon 32 Will This Last Forever? Pitch Gate [Moore, ISSCC2003]

Penn ESE534 Spring DeHon 33 More chip capacity? Should a 2010 single-chip multiprocessor look like a 1983 multiprocessor systems? –Processor  processor latency? –Inter-processor bandwidth costs? –Cost of customization? Memory CP Memory CP Memory CP SESESESESESESESE SESESESESESESESE Memory CP I/OProgram MemoryMP Calisto ™ BCM1500 Nichols/Microprocessor Forum 2001 Cosmic Cube / CACM 1985

Penn ESE534 Spring DeHon 34 Memory Levels Why do we have 5+ levels of memory today? –Apple II, IBM PC had 2 –MIPS-X had 3

Penn ESE534 Spring DeHon 35 Historical Power Scaling [Horowitz et al. / IEDM 2005]

Interesting Times Challenges to continue scaling –Power density –Reliability What does the end-of-scaling mean to architecture? Penn ESE534 Spring DeHon 36

Penn ESE534 Spring DeHon 37 Class Components

Penn ESE534 Spring DeHon 38 Class Components Lecture (incl. preclass exercise) –Slides on web before class (you can print if want a follow-along copy) Reading [~1 required paper/lecture] –No text (mostly online: Blackboard, IEEE, ACM) 9 assignments –(roughly 1 per week) Final design/analysis exercise –(~4 weeks) Note syllabus, course admin online

Preclass Exercise Like Background Quiz but more focused Motivate the topic of the day –Introduce a problem –Introduce a design space, tradeoff, transform Work for ~5 minutes before start lecturing Penn ESE534 Spring DeHon 39

Penn ESE534 Spring DeHon 40 Feedback Will have anonymous feedback sheets for each lecture –Clarity? –Speed? –Vocabulary? –General comments

Penn ESE534 Spring DeHon 41 Fountainhead Quote Howard Roark’s Critique of the Parthenon -- Ayn Rand

Penn ESE534 Spring DeHon 42 Fountainhead Parthenon Quote “Look,” said Roark. “The famous flutings on the famous columns---what are they there for? To hide the joints in wood---when columns were made of wood, only these aren’t, they’re marble. The triglyphs, what are they? Wood. Wooden beams, the way they had to be laid when people began to build wooden shacks. Your Greeks took marble and they made copies of their wooden structures out of it, because others had done it that way. Then your masters of the Renaissance came along and made copies in plaster of copies in marble of copies in wood. Now here we are making copies in steel and concrete of copies in plaster of copies in marble of copies in wood. Why?”

Penn ESE534 Spring DeHon 43

Penn ESE534 Spring DeHon 44 Computer Architecture Parallel Are we making: –copies in submicron CMOS –of copies in early NMOS –of copies in discrete TTL –of vacuum tube computers?

Admin Your action: –Find course web page Read it, including the policies Find Syllabus –Find assignment 1 –Find lecture slides »Will try to post before lecture –Find reading assignments –Find reading for lecture 2 on blackboard Penn ESE534 Spring DeHon 45

Penn ESE534 Spring DeHon 46 Big Ideas Matter Computes Efficiency of architectures varies widely Computation design is an engineering discipline Costs change  Best solutions (architectures) change Learn to cut through hype –analyze, think, critique, synthesize