Fall 2006 1 EE 333 Lillevik 333f06-l22 University of Portland School of Engineering Computer Organization Lecture 22 Project 6 Hard disk drive Bus arbitration.

Slides:



Advertisements
Similar presentations
IT253: Computer Organization
Advertisements

Computer Architecture
Computer Organization, Bus Structure
I/O Organization popo.
1  1998 Morgan Kaufmann Publishers Interfacing Processors and Peripherals.
Fall EE 333 Lillevik 333f06-s3 University of Portland School of Engineering Computer Organization Final Exam Study Final Exam Tuesday, December.
FIU Chapter 7: Input/Output Jerome Crooks Panyawat Chiamprasert
Interfacing Processors and Peripherals Andreas Klappenecker CPSC321 Computer Architecture.
11/18/2004Comp 120 Fall November 3 classes to go No class on Tuesday 23 November Last 2 classes will be survey and exam review Interconnect and.
TECH CH03 System Buses Computer Components Computer Function
I/O Subsystem Organization and Interfacing Cs 147 Peter Nguyen
COMP381 by M. Hamdi 1 Input/Output Systems. COMP381 by M. Hamdi 2 Motivation: Who Cares About I/O? CPU Performance: 60% per year I/O system performance.
Introduction to Database Systems 1 The Storage Hierarchy and Magnetic Disks Storage Technology: Topic 1.
Silberschatz, Galvin and Gagne ©2009 Operating System Concepts – 8 th Edition, Chapter 12: Mass-Storage Systems.
Silberschatz, Galvin and Gagne ©2009 Operating System Concepts – 8 th Edition, Chapter 12: Mass-Storage Systems.
Lecture 12 Today’s topics –CPU basics Registers ALU Control Unit –The bus –Clocks –Input/output subsystem 1.
Computer Architecture Lecture 08 Fasih ur Rehman.
Storage & Peripherals Disks, Networks, and Other Devices.
Spring EE 437 Lillevik 437s06-l2 University of Portland School of Engineering Advanced Computer Architecture Lecture 2 NSD with MUX and ROM Class.
CPU BASICS, THE BUS, CLOCKS, I/O SUBSYSTEM Philip Chan.
Spring EE 437 Lillevik 437s06-l8 University of Portland School of Engineering Advanced Computer Architecture Lecture 8 Project 3: memory agent Programmed.
ECE 456 Computer Architecture
CHAPTER 3 TOP LEVEL VIEW OF COMPUTER FUNCTION AND INTERCONNECTION
I/O Example: Disk Drives To access data: — seek: position head over the proper track (8 to 20 ms. avg.) — rotational latency: wait for desired sector (.5.
1 Week 9: Computing Components: PART II READING: Chapter 5.
Top Level View of Computer Function and Interconnection.
Computer Architecture Lecture10: Input/output devices Piotr Bilski.
DMA Versus Polling or Interrupt Driven I/O
Fall EE 333 Lillevik 333f06-l7 University of Portland School of Engineering Computer Organization Lecture 7 ALU design MIPS data path.
2009 Sep 10SYSC Dept. Systems and Computer Engineering, Carleton University F09. SYSC2001-Ch7.ppt 1 Chapter 7 Input/Output 7.1 External Devices 7.2.
2.1 Operating System Concepts Chapter 2: Computer-System Structures Computer System Operation Storage Structure Storage Hierarchy Hardware Protection General.
Input/Output Computer component : Input/Output I/O Modules External Devices I/O Modules Function and Structure I/O Operation Techniques I/O Channels and.
August 1, 2001Systems Architecture II1 Systems Architecture II (CS ) Lecture 9: I/O Devices and Communication Buses * Jeremy R. Johnson Wednesday,
© 2005 Pearson Addison-Wesley. All rights reserved Figure 2.1 This chapter focuses on key hardware layer components.
EEE440 Computer Architecture
Fall EE 333 Lillevik 333f06-l21 University of Portland School of Engineering Computer Organization Lecture 21 Subroutines, stack Interrupts, service.
Spring EE 437 Lillevik 437s06-l9 University of Portland School of Engineering Advanced Computer Architecture Lecture 9 DMA controller design.
ECEG-3202 Computer Architecture and Organization Chapter 3 Top Level View of Computer Function and Interconnection.
Fall EE 333 Lillevik 333f06-l23 University of Portland School of Engineering Computer Organization Lecture 23 RAID Input/output design RS232 serial.
7. Peripherals 7.1 Introduction of peripheral devices Computer Studies (AL)
Fall EE 333 Lillevik 333f06-l14 University of Portland School of Engineering Computer Organization Lecture 14 Memory hierarchy, locality Memory.
Computer Organization. This module surveys the physical resources of a computer system.  Basic components  CPU  Memory  Bus  I/O devices  CPU structure.
Computer Hardware A computer is made of internal components Central Processor Unit Internal External and external components.
Processor Memory Processor-memory bus I/O Device Bus Adapter I/O Device I/O Device Bus Adapter I/O Device I/O Device Expansion bus I/O Bus.
Spring EE 437 Lillevik 437s06-l5 University of Portland School of Engineering Advanced Computer Architecture Lecture 5 Slave bus agent ROM example.
Device Management Mark Stanovich Operating Systems COP 4610.
Chapter 3 System Buses.  Hardwired systems are inflexible  General purpose hardware can do different tasks, given correct control signals  Instead.
Device Management Andy Wang Operating Systems COP 4610 / CGS 5765.
10/15: Lecture Topics Input/Output –Types of I/O Devices –How devices communicate with the rest of the system communicating with the processor communicating.
1 Components of the Virtual Memory System  Arrows indicate what happens on a lw virtual address data physical address TLB page table memory cache disk.
Spring EE 437 Lillevik 437s06-l4 University of Portland School of Engineering Advanced Computer Architecture Lecture 4 Project 1 reviews CPU controller.
Networked Embedded Systems Pengyu Zhang & Sachin Katti EE107 Spring 2016 Lecture 11 Direct Memory Access.
1 Computer Architecture & Assembly Language Spring 2001 Dr. Richard Spillman Lecture 19 – IO II.
Interconnection Structures
Department of Computer Science and Engineering
Chapter 6 Input/Output Organization
Sarah Diesburg Operating Systems CS 3430
Computer Architecture
Input-output I/O is very much architecture/system dependent
Overview of Computer Architecture and Organization
The Von Neumann Architecture Odds and Ends
Overview of Computer Architecture and Organization
Advanced Computer Architecture Lecture 11
Advanced Computer Architecture Lecture 10
William Stallings Computer Organization and Architecture
Advanced Computer Architecture Lecture 3
Presentation transcript:

Fall EE 333 Lillevik 333f06-l22 University of Portland School of Engineering Computer Organization Lecture 22 Project 6 Hard disk drive Bus arbitration

Fall EE 333 Lillevik 333f06-l22 University of Portland School of Engineering Project 6 Due: Friday, December 1 Microprogram the instruction set Complete MDP16 design Execute a simple program Extra credit for additional instructions

Fall EE 333 Lillevik 333f06-l22 University of Portland School of Engineering MDP16 execution Program stores 0x25, 0x35, and 0x45 at 0x100, 0x101, 0x102 and reads the numbers back

Fall EE 333 Lillevik 333f06-l22 University of Portland School of Engineering MicroROM contents

Fall EE 333 Lillevik 333f06-l22 University of Portland School of Engineering Example trace $0 = 0x100 for address of sw

Fall EE 333 Lillevik 333f06-l22 University of Portland School of Engineering Example trace, continued. Mem[100] = 0x25, Mem[101] = 0x35, Mem[102] = 0x45

Fall EE 333 Lillevik 333f06-l22 University of Portland School of Engineering Example trace, continued. Now load 0x100, 0x101, 0x102 into $1

Fall EE 333 Lillevik 333f06-l22 University of Portland School of Engineering Computer components Input: receives information from external world Output: transmits information to external world Memory: holds programs and data Data path: physical route that carries info Control: coordinates overall flow of info

Fall EE 333 Lillevik 333f06-l22 University of Portland School of Engineering System Bus The bus interconnects system agents

Fall EE 333 Lillevik 333f06-l22 University of Portland School of Engineering System view of a computer One Agent at-a-time owns the bus ··· Signal 0 Signal n Agent 0 Agent n ··· Bus Signal 1

Fall EE 333 Lillevik 333f06-l22 University of Portland School of Engineering Agents Goal: perform some function (memory, I/O, etc.) Types –Master: can own the bus, assert signals –Slave: only responds when requested by master Operations –Memory or I/O space –Read or write –Interrupt

Fall EE 333 Lillevik 333f06-l22 University of Portland School of Engineering What type of agent? AgentMasterSlave CPUYN Memory Disk Display Keyboard Printer

Fall EE 333 Lillevik 333f06-l22 University of Portland School of Engineering Moving-head disk Disk buses include EIDA, SATA, SCSI Performance = seek time + latency time + transfer time NOTE: Unique location denoted CHS  cylinder, head, sector

Fall EE 333 Lillevik 333f06-l22 University of Portland School of Engineering Disk features Platter: magnetically coated disk Side: one of two platter surfaces Arm: lever arm that swings across platter Head: sensor that reads/writes data on platter Track: circular region on platter Cylinder: collection of tracks with same radius Sector: region of a track, basic unit of data (B)

Fall EE 333 Lillevik 333f06-l22 University of Portland School of Engineering Disk performance Seek: time to move arm Latency (rotational): time for platter to rotate to requested sector Transfer: time to move data across bus

Fall EE 333 Lillevik 333f06-l22 University of Portland School of Engineering High-end disk example Buffer = disk cache Host = PC disk controller

Fall EE 333 Lillevik 333f06-l22 University of Portland School of Engineering Find disk bandwidth, transfer time? CLK = 100 ns, 32-bit data bus, 5 clocks/bus cycle, 512B sector

Fall EE 333 Lillevik 333f06-l22 University of Portland School of Engineering Find the disk average latency? Twelve 5 cm platters, 7200 rpm, 120 GB

Fall EE 333 Lillevik 333f06-l22 University of Portland School of Engineering System view of a computer One Agent at-a-time owns the bus ··· Signal 0 Signal n Agent 0 Agent n ··· Bus Signal 1

Fall EE 333 Lillevik 333f06-l22 University of Portland School of Engineering Example bus control signals?

Fall EE 333 Lillevik 333f06-l22 University of Portland School of Engineering Bus cycle (phases) 1.Arbitration: owner defined 2.Address: ID of memory or I/O provided 3.Data: information transferred 4.Response: indicates completion of cycle Bus phases similar to instruction steps

Fall EE 333 Lillevik 333f06-l22 University of Portland School of Engineering Bus timing Clk Breq Bgnt Ack Data Bus Driven ARB ADRDATARESP Address Bus Driven

Fall EE 333 Lillevik 333f06-l22 University of Portland School of Engineering Bus timing example Shared signals driven by different agents Disk Mem Disk Disk-Adr Mem-data Mem Bus Cycle A little more complex

Fall EE 333 Lillevik 333f06-l22 University of Portland School of Engineering Bus arbitration Serial: priority in-out, Request-Grant, sent from agent-to-agent (daisy-chain) Parallel: each agent asserts unique request (centralized), one grant asserted Distributed –Self-selection: agent codes combined to identify owner –Collision detection: request repeated after a delay

Fall EE 333 Lillevik 333f06-l22 University of Portland School of Engineering Serial arbiter Each priority circuit ripples to next in line

Fall EE 333 Lillevik 333f06-l22 University of Portland School of Engineering Design the priority circuit? ReqPinGntPout Gnt = Pout =

Fall EE 333 Lillevik 333f06-l22 University of Portland School of Engineering Centralized arbitration More & fast logic, flexible algorithm Device 1Device 2Device n Central Arbiter Req 1 Gnt 1 Req 2 Gnt 2 Req n Gnt n Fixed, round-robin, multi-level, etc.

Fall EE 333 Lillevik 333f06-l22 University of Portland School of Engineering Fixed centralize arbiter

Fall EE 333 Lillevik 333f06-l22 University of Portland School of Engineering Simple RR arbiter Req2 Req1 Req3 Req0 Gntn = Staten  Reqn

Fall EE 333 Lillevik 333f06-l22 University of Portland School of Engineering

Fall EE 333 Lillevik 333f06-l22 University of Portland School of Engineering What type of agent? AgentMasterSlave CPUYN MemoryNY DiskYY DisplayYY KeyboardNY PrinterNY High-performance agents are often Masters

Fall EE 333 Lillevik 333f06-l22 University of Portland School of Engineering Find disk bandwidth, transfer time? CLK = 100 ns, 32-bit data bus, 5 clocks/bus cycle, 512B sector

Fall EE 333 Lillevik 333f06-l22 University of Portland School of Engineering Find the disk average latency? Twelve 5 cm platters, 7200 rpm, 120 GB

Fall EE 333 Lillevik 333f06-l22 University of Portland School of Engineering Example bus control signals Bus request, bus grant Read, write Memory space, I/O space Address valid, data valid Wait Interrupt request, interrupt acknowledge

Fall EE 333 Lillevik 333f06-l22 University of Portland School of Engineering Design the priority circuit? ReqPinGntPout Gnt = Req · Pin Pout = Req · Pin