Other Approaches.

Slides:



Advertisements
Similar presentations
CSET 4650 Field Programmable Logic Devices
Advertisements

Reading1: An Introduction to Asynchronous Circuit Design Al Davis Steve Nowick University of Utah Columbia University.
ELEC 256 / Saif Zahir UBC / 2000 Timing Methodology Overview Set of rules for interconnecting components and clocks When followed, guarantee proper operation.
ELEC 6200, Fall 07, Oct 24 Jiang: Async. Processor 1 Asynchronous Processor Design for ELEC 6200 by Wei Jiang.
Lecture 11 MOUSETRAP: Ultra-High-Speed Transition-Signaling Asynchronous Pipelines.
More Basics of CPU Design Lecture for CPSC 5155 Edward Bosworth, Ph.D. Computer Science Department Columbus State University.
Chapter 3 Digital Logic Structures. 3-2 Transistor: Building Block of Computers Microprocessors contain millions of transistors Intel Pentium 4 (2000):
CS 210.  How do we represent data in a computer? ◦ Easy to recognize two conditions:  1. Presence of a voltage – we’ll call this state “1”  2. Absence.
1 CHAPTER 4: PART I ARITHMETIC FOR COMPUTERS. 2 The MIPS ALU We’ll be working with the MIPS instruction set architecture –similar to other architectures.
Digital Logic. 4 Why is 32-bit or 64-bit significant in terms of speed, efficiency? 4 Difference between OR and XOR 4 What is a mux for? PLA 4 Two kinds.
CSIS 3510 Dr. Hoganson Bus Construction CSIS 3510 Computer Organization and Architecture Bus construction alternatives Bus control issues Bus arbitration.
Parallel architecture Technique. Pipelining Processor Pipelining is a technique of decomposing a sequential process into sub-processes, with each sub-process.
Reading1: An Introduction to Asynchronous Circuit Design Al Davis Steve Nowick University of Utah Columbia University.
12004 MAPLD: 153Brej Early output logic and Anti-Tokens Charlie Brej APT Group Manchester University.
Chapter 3 Digital Logic Structures. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 3-2 Transistor: Building.
Lecture No. 2 Computer Logic Design. Binary Digits The two state number system is called binary. Its two digits are 0 and 1 A binary digit is called a.
Appendix C Basics of Logic Design. Appendix C — Logic Basic — 2 Logic Design Basics §4.2 Logic Design Conventions Objective: To understand how to build.
COMP541 Transistors and all that… a brief overview
Computer Science 210 Computer Organization
Instructor:Po-Yu Kuo 教師:郭柏佑
Interconnection Structures
System-on-Chip Design Homework Solutions
Basic Computer Organization and Design
Welcome To Seminar Presentation Seminar Report On Clockless Chips
COMP541 Transistors and all that… a brief overview
Computer Organization
Transistors and Logic Circuits
Computer Organization
Computer Architecture & Operations I
Stateless Combinational Logic and State Circuits
Transistors and Logic Circuits
Instructor:Po-Yu Kuo 教師:郭柏佑
Circuits Logic in Hardware.
Recap: Lecture 1 What is asynchronous design? Why do we want to study it? What is pipelining? How can it be used to design really fast hardware?
CS231: Computer Architecture I
Morgan Kaufmann Publishers The Processor
Morgan Kaufmann Publishers
Chapter 3 Top Level View of Computer Function and Interconnection
Computer Science 210 Computer Organization
Instructor: Alexander Stoytchev
Digital Circuits ECGR2181 Chapter 3 Notes Data A-data B-data A B here
Fundamentals of Computer Science Part i2
We will be studying the architecture of XC3000.
Computer Science 210 Computer Organization
Subject Name: Fundamentals Of CMOS VLSI Subject Code: 10EC56
CSET 4650 Field Programmable Logic Devices
Instructor:Po-Yu Kuo 教師:郭柏佑
Levels in Processor Design
Switching Techniques.
Topics Clocking disciplines. Flip-flops. Latches..
EENG447 Digital IC Design Dr. Gürtaç Yemişcioğlu.
High Performance Asynchronous Circuit Design and Application
Levels in Processor Design
CS231: Computer Architecture I
Clockless Logic: Asynchronous Pipelines
Levels in Processor Design
ECE 352 Digital System Fundamentals
CS231: Computer Architecture I
COMP541 Transistors and all that… a brief overview
Levels in Processor Design
Digital Circuits and Logic
ECE 352 Digital System Fundamentals
Wagging Logic: Moore's Law will eventually fix it
A Quasi-Delay-Insensitive Method to Overcome Transistor Variation
Early output logic and Anti-Tokens
Instructor: Michael Greenbaum
Clockless Computing Lecture 3
Introduction to Silicon Programming in the Tangram/Haste language
William Stallings Computer Organization and Architecture
Multiprocessors and Multi-computers
Presentation transcript:

Other Approaches

The Way Transistors Are Really Used Transistor gates presented before uses power whenever voltage is connected to ground!

NOT Gate One transistor V (high voltage) Out In = high, switch is closed so current flows to ground Out is low. In In = low, switch is open so current flows to Out Out is high.

NOR Gate Two transistors V (high voltage) Out In 1 In 2

CMOS transistors Complementary Metal Oxide Semiconductor Replaces single transistors with a pair, one p-type (like we used), one n-type (current passes when control is low) Set up so that in steady state, no current flows to ground Only uses power when switching

CMOS circuits use far less power – the current main constraint on the development of faster cpus. Since 1976 the better power saving technology Most processors today use this technology

Do We Really Need A Clock? Standard computer architecture, virtually all computers use a clock Problems: Clock skew – as the clock signal propagates through the circuit, it hits elements distant from the source later than one close. Can cause problems. Length of clock cycle depends on longest latency in a phase of circuit. Some phases might be able to execute faster, balancing is hard In a phase, some operations might be able to execute faster than others (for example, AND vs ADD in an ALU) Alternative ?

Asynchronous circuits No clock Signals move from one component to another by a signaling system Component with information to pass “forward” in the system send a request signal to the component to receive, setting up the data to send at the same time. Component receiving replies with an acknowledgement when it has received the data, letting the sender know it can remove the data from the channel Receiving Component will process the data, then communicate with next component in a similar manner. A chain of such elements will comprise an asynchronous circuit. The request/acknowledge combination is called a “handshake”

Handshake Req Ack Sender sets up data on Data channel Sender sends request on Req wire Receiver reads data into latch Receiver sends acknowledge on Ack wire. Sender Receiver Data Ack Req

2-Phase protocol each level change is a req/ack Req1 Req2 Req3 Data1 Data2 Data3 Ready Ready Ready Sender Receiver Ack1 Ack2 Ack3 Data1 received Data2 received Data3 received

4-Phase protocol return to zero before next handshake Req1 Req1 down Req2 Req2 down Data1 Data2 Ready Ready Sender Receiver Ack1 Ack1 down Ack2 Ack2 down Data1 received ready for more Data2 received ready for more

When can we pass data forward? Bundled Data Fixed delay Needs to be as long as longest possible processing time Sensitive to conditions that may change signal times (like temperature) QDI (Quasi-Delay Insensitive) Determine when computation is complete Time only needed for this computation Needs more logic

QDI -- how to detect completion Each bit has two signal wires: Bottom wire is actual bit value Top wire is negation of top When both are zero, no data established When both are one, invalid data Value = 0 Value = 1 Completion for one bit detected D0 = 1 D0 = 0 when D0 XOR D1 = 1 D1 = 0 D1 = 1 Completion for several bits when all one bit XOR’s are 1 – use AND gates

MiniMIPS An Asynchronous implementation of MIPS R3000 architecture Cal Tech, 1998 Used small QDI components Multiple execution units Performance 2 ½ to 4 times better than equivalent clocked technology