Scribd Logo
Upload

Welcome to Scribd!

  • 167 views

    Introduction To Computing Systems:: From Bits and Gates To C and Beyond

    Uploaded by

    Nirmal Gupta
    This document introduces a course on computing systems from bits and gates to C programming. The course will build understanding from the bottom up, starting with how information is represented using bits, then digital logic, processor architecture and instruction sets, assembly language, and finally C programming. It discusses key concepts like abstraction, the universal computing capability of machines, and the layers of transformations needed to solve problems using computers. The goal is for students to understand how software maps to hardware and write programs in C while knowing what is happening at lower levels.

    Copyright:

    © All Rights Reserved
    Download as PPT, PDF, TXT or read online from Scribd

    Introduction To Computing Systems:: From Bits and Gates To C and Beyond

    Uploaded by

    Nirmal Gupta
    167 views15 pages
    This document introduces a course on computing systems from bits and gates to C programming. The course will build understanding from the bottom up, starting with how information is represented using bits, then digital logic, processor architecture and instruction sets, assembly language, and finally C programming. It discusses key concepts like abstraction, the universal computing capability of machines, and the layers of transformations needed to solve problems using computers. The goal is for students to understand how software maps to hardware and write programs in C while knowing what is happening at lower levels.

    Original Description:

    This is Patt and Patel Book Chapter 1 Slides.

    Original Title

    PattPatelCh01

    Copyright

    © © All Rights Reserved

    Available Formats

    PPT, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document introduces a course on computing systems from bits and gates to C programming. The course will build understanding from the bottom up, starting with how information is represented using bits, then digital logic, processor architecture and instruction sets, assembly language, and finally C programming. It discusses key concepts like abstraction, the universal computing capability of machines, and the layers of transformations needed to solve problems using computers. The goal is for students to understand how software maps to hardware and write programs in C while knowing what is happening at lower levels.

    Copyright:

    © All Rights Reserved
    Download as PPT, PDF, TXT or read online from Scribd
    Download as ppt, pdf, or txt
    167 views15 pages

    Introduction To Computing Systems:: From Bits and Gates To C and Beyond

    Uploaded by

    Nirmal Gupta
    This document introduces a course on computing systems from bits and gates to C programming. The course will build understanding from the bottom up, starting with how information is represented using bits, then digital logic, processor architecture and instruction sets, assembly language, and finally C programming. It discusses key concepts like abstraction, the universal computing capability of machines, and the layers of transformations needed to solve problems using computers. The goal is for students to understand how software maps to hardware and write programs in C while knowing what is happening at lower levels.

    Copyright:

    © All Rights Reserved
    Download as PPT, PDF, TXT or read online from Scribd
    Download as ppt, pdf, or txt
    of 15

    Introduction to Computing Systems:

    From Bits and Gates to C and Beyond


    2nd Edition

    Yale N. Patt
    Sanjay J. Patel

    1-1
    Chapter 1
    Welcome Aboard
    Introduction to the World of Computing
    Computer: electronic genius?
    • NO! Electronic idiot!
    • Does exactly what we tell it to, nothing more.

    Goal of the course:


    You will be able to write programs in C
    and understand what’s going on underneath.

    Approach:
    Build understanding from the bottom up.
    Bits  Gates  Processor  Instructions  C Programming

    1-3
    Two Recurring Themes
    Abstraction
    • Productivity enhancer – don’t need to worry about details…
    Can drive a car without knowing how
    the internal combustion engine works.
    • …until something goes wrong!
    Where’s the dipstick? What’s a spark plug?
    • Important to understand the components and
    how they work together.

    Hardware vs. Software


    • It’s not either/or – both are components of a computer system.
    • Even if you specialize in one,
    you should understand capabilities and limitations of both.

    1-4
    Big Idea #1: Universal Computing Device
    All computers, given enough time and memory,
    are capable of computing exactly the same things.

    = =
    PDA
    Workstation
    Supercomputer

    1-5
    Turing Machine
    Mathematical model of a device that can perform
    any computation – Alan Turing (1937)
    • ability to read/write symbols on an infinite “tape”
    • state transitions, based on current state and symbol

    Every computation can be performed by some


    Turing machine. (Turing’s thesis)

    a,b Tadd a+b a,b Tmul ab

    Turing machine that adds Turing machine that multiplies


    For more info about Turing machines, see For more about Alan Turing, see
    http://www.wikipedia.org/wiki/Turing_machine/ http://www.turing.org.uk/turing/
    1-6
    Universal Turing Machine
    A machine that can implement all Turing machines
    -- this is also a Turing machine!
    • inputs: data, plus a description of computation (other TMs)

    Tadd, Tmul
    U
    a,b,c c(a+b)

    Universal Turing Machine

    U is programmable – so is a computer!
    • instructions are part of the input data
    • a computer can emulate a Universal Turing Machine

    A computer is a universal computing device.


    1-7
    From Theory to Practice
    In theory, computer can compute anything
    that’s possible to compute
    • given enough memory and time

    In practice, solving problems involves


    computing under constraints.
    • time
     weather forecast, next frame of animation, ...
    • cost
     cell phone, automotive engine controller, ...
    • power
     cell phone, handheld video game, ...

    1-8
    Big Idea #2: Transformations Between Layers

    Problems

    Algorithms

    Language

    Instruction Set Architecture

    Microarchitecture

    Circuits

    Devices

    1-9
    How do we solve a problem using a computer?
    A systematic sequence of transformations between
    layers of abstraction.

    Problem
    Problem
    Software Design:
    choose algorithms and data structures
    Algorithm
    Algorithm
    Programming:
    use language to express design
    Program
    Program
    Compiling/Interpreting:
    convert language to
    Instr
    Instr Set
    Set machine instructions
    Architecture
    Architecture
    1-10
    Deeper and Deeper…

    Instr
    InstrSet
    Set
    Architecture
    Architecture
    Processor Design:
    choose structures to implement ISA
    Microarch
    Microarch
    Logic/Circuit Design:
    gates and low-level circuits to
    Circuits implement components
    Circuits
    Process Engineering & Fabrication:
    develop and manufacture
    Devices
    Devices lowest-level components

    1-11
    Descriptions of Each Level

    Problem Statement
    • stated using "natural language"
    • may be ambiguous, imprecise
    Algorithm
    • step-by-step procedure, guaranteed to finish
    • definiteness, effective computability, finiteness
    Program
    • express the algorithm using a computer language
    • high-level language, low-level language
    Instruction Set Architecture (ISA)
    • specifies the set of instructions the computer can perform
    • data types, addressing mode
    1-12
    Descriptions of Each Level (cont.)

    Microarchitecture
    • detailed organization of a processor implementation
    • different implementations of a single ISA
    Logic Circuits
    • combine basic operations to realize microarchitecture
    • many different ways to implement a single function
    (e.g., addition)
    Devices
    • properties of materials, manufacturability

    1-13
    Many Choices at Each Level
    Solve a system of equations

    Gaussian Jacobi
    Red-black SOR Multigrid
    elimination iteration

    FORTRAN C C++ Java Tradeoffs:


    cost
    PowerPC Intel x86 Atmel AVR performance
    power
    Centrino Pentium 4 Xeon (etc.)

    Ripple-carry adder Carry-lookahead adder

    CMOS Bipolar GaAs


    1-14
    Course Outline
    Bits and Bytes
    • How do we represent information using electrical signals?
    Digital Logic
    • How do we build circuits to process information?
    Processor and Instruction Set
    • How do we build a processor out of logic elements?
    • What operations (instructions) will we implement?
    Assembly Language Programming
    • How do we use processor instructions to implement algorithms?
    • How do we write modular, reusable code? (subroutines)
    I/O, Traps, and Interrupts
    • How does processor communicate with outside world?
    C Programming
    • How do we write programs in C?
    • How do we implement high-level programming constructs?
    1-15

    You might also like