Day1 - ESE534: Computer Organization Day 1: January 13,...

Info iconThis preview shows pages 1–12. Sign up to view the full content.

View Full Document Right Arrow Icon
Penn ESE534 Spring2010 -- DeHon 1 ESE534: Computer Organization Day 1: January 13, 2010 Introduction and Overview
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Penn ESE534 Spring2010 -- DeHon 2 Today Matter Computes Architecture Matters This Course (short) Unique Nature of This Course Change More on this course
Background image of page 2
Penn ESE534 Spring2010 -- DeHon 3 Review ( assert? ) : Two Universality Facts NAND gate Universality [Day 2, ESE200/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
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Penn ESE534 Spring2010 -- DeHon 4 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
Background image of page 4
LEGO TM Logic Gates http://goldfish.ikaruga.co.uk/logic.html Penn ESE534 Spring2010 -- DeHon 5
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Penn ESE534 Spring2010 -- DeHon 6 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
Background image of page 6
Penn ESE534 Spring2010 -- DeHon 7 Engineering Problem Implement a computation: with least resources (in fixed resources) with least cost in least time (in fixed time) with least energy Optimization problem how do we do it best?
Background image of page 7

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Penn ESE534 Spring2010 -- DeHon 8 Quote “An Engineer can do for a dime what everyone else can do for a dollar.”
Background image of page 8
Penn ESE534 Spring2010 -- DeHon 9 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?
Background image of page 9

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Penn ESE534 Spring2010 -- DeHon 10 Peak Computational Densities from Model Small slice of space only 2 parameters 100 × density across Large difference in peak densities large design space!
Background image of page 10
-- DeHon 11 Yielded Efficiency Large variation in yielded density large design space! FPGA (
Background image of page 11

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 12
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 44

Day1 - ESE534: Computer Organization Day 1: January 13,...

This preview shows document pages 1 - 12. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online