DOC PREVIEW
Berkeley COMPSCI 152 - Lecture 24 Buses Disk IO Queueing Theory

This preview shows page 1-2-3-4 out of 11 pages.

Save
View full document
View full document
Premium Document
Do you want full access? Go Premium and unlock all 11 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 11 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 11 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 11 pages.
Access to all documents
Download any document
Ad free experience
Premium Document
Do you want full access? Go Premium and unlock all 11 pages.
Access to all documents
Download any document
Ad free experience

Unformatted text preview:

4/30/03 ©UCB Spring 2003CS152 / Kubiatowicz Lec24.1CS152Computer Architecture and EngineeringLecture 24Buses (continued)Disk IO Queueing TheoryApril 30, 2003John Kubiatowicz (www.cs.berkeley.edu/~kubitron)lecture slides: http://inst.eecs.berkeley.edu/~cs152/4/30/03 ©UCB Spring 2003CS152 / Kubiatowicz Lec24.2Recap: Making address translation practical: TLB° Virtual memory => memory acts like a cache for the disk° Page table maps virtual page numbers to physical frames° Translation Look-aside Buffer (TLB) is a cache translationsPhysicalMemory SpaceVirtualAddress SpaceTLBPage Table2013virtual addresspageoff2frame page250physical addresspageoff4/30/03 ©UCB Spring 2003CS152 / Kubiatowicz Lec24.3TLB4K Cache10 2004 bytesindex1 Kpage # disp20assoclookup32Hit/MissFNDataHit/Miss=FNWhat if cache size is increased to 8KB?° If we do this in parallel, we have to be careful, however:Recap: Overlapped TLB & Cache Access4/30/03 ©UCB Spring 2003CS152 / Kubiatowicz Lec24.4Recap: A Three-Bus System (+ backside cache)° A small number of backplane buses tap into the processor-memory bus• Processor-memory bus is only used for processor-memory traffic• I/O buses are connected to the backplane bus° Advantage: loading on the processor bus is greatly reducedProcessor MemoryProcessor Memory BusBusAdaptorBusAdaptorBusAdaptorI/O BusBacksideCache busI/O BusL2 Cache4/30/03 ©UCB Spring 2003CS152 / Kubiatowicz Lec24.5Recap: Main components of Intel Chipset: Pentium II/III° Northbridge:• Handles memory• Graphics° Southbridge: I/O• PCI bus• Disk controllers• USB controlers• Audio• Serial I/O• Interrupt controller• Timers4/30/03 ©UCB Spring 2003CS152 / Kubiatowicz Lec24.6° Synchronous Bus:• Includes a clock in the control lines• A fixed protocol relative to the clock• Advantage: little logic and very fast• Disadvantages:- Every device on the bus must run at the same clock rate- To avoid clock skew, they cannot be long if they are fast° Asynchronous Bus:• It is not clocked• It can accommodate a wide range of devices• It can be lengthened without worrying about clock skew• It requires a handshaking protocolSynchronous and Asynchronous Bus4/30/03 ©UCB Spring 2003CS152 / Kubiatowicz Lec24.7° Even memory busses are more complex than this• memory (slave) may take time to respond• it may need to control data rateBReqBGCmd+AddrR/WAddressData1 Data2DataSimple Synchronous Protocol4/30/03 ©UCB Spring 2003CS152 / Kubiatowicz Lec24.8° Slave indicates when it is prepared for data xfer° Actual transfer goes at bus rateBReqBGCmd+AddrR/WAddressData1 Data2DataData1WaitTypical Synchronous Protocol4/30/03 ©UCB Spring 2003CS152 / Kubiatowicz Lec24.9AddressDataReadReqAckMaster Asserts AddressMaster Asserts DataNext AddressWrite Transactiont0 t1 t2 t3 t4 t5t0 : Master has obtained control and asserts address, direction, dataWaits a specified amount of time for slaves to decode target.t1: Master asserts request linet2: Slave asserts ack, indicating data receivedt3: Master releases reqt4: Slave releases ackAsynchronous Write Transaction4/30/03 ©UCB Spring 2003CS152 / Kubiatowicz Lec24.10AddressDataReadReqAckMaster Asserts Address Next Addresst0 t1 t2 t3 t4 t5t0 : Master has obtained control and asserts address, direction, dataWaits a specified amount of time for slaves to decode target.t1: Master asserts request linet2: Slave asserts ack, indicating ready to transmit datat3: Master releases req, data receivedt4: Slave releases ackAsynchronous Read TransactionSlave Data4/30/03 ©UCB Spring 2003CS152 / Kubiatowicz Lec24.11Multiple Potential Bus Masters: the Need for Arbitration° Bus arbitration scheme:• A bus master wanting to use the bus asserts the bus request• A bus master cannot use the bus until its request is granted• A bus master must signal to the arbiter after finish using the bus° Bus arbitration schemes usually try to balance two factors:• Bus priority: the highest priority device should be serviced first• Fairness: Even the lowest priority device should neverbe completely locked out from the bus° Bus arbitration schemes can be divided into four broad classes:• Daisy chain arbitration• Centralized, parallel arbitration• Distributed arbitration by self-selection: each device wanting the bus places a code indicating its identity on the bus.• Distributed arbitration by collision detection: Each device just “goes for it”. Problems found after the fact.4/30/03 ©UCB Spring 2003CS152 / Kubiatowicz Lec24.12° One of the most important issues in bus design:• How is the bus reserved by a device that wishes to use it?° Chaos is avoided by a master-slave arrangement:• Only the bus master can control access to the bus:It initiates and controls all bus requests• A slave responds to read and write requests° The simplest system:• Processor is the only bus master• All bus requests must be controlled by the processor• Major drawback: the processor is involved in every transactionBusMasterBusSlaveControl: Master initiates requestsData can go either wayArbitration: Obtaining Access to the Bus4/30/03 ©UCB Spring 2003CS152 / Kubiatowicz Lec24.13The Daisy Chain Bus Arbitrations Scheme° Advantage: simple° Disadvantages:• Cannot assure fairness:A low-priority device may be locked out indefinitely• The use of the daisy chain grant signal also limits the bus speedBusArbiterDevice 1HighestPriorityDevice NLowestPriorityDevice 2Grant Grant GrantReleaseRequestwired-OR4/30/03 ©UCB Spring 2003CS152 / Kubiatowicz Lec24.14° Used in essentially all processor-memory busses and in high-speed I/O bussesBusArbiterDevice 1Device NDevice 2GrantReqCentralized Parallel Arbitration4/30/03 ©UCB Spring 2003CS152 / Kubiatowicz Lec24.15° Separate versus multiplexed address and data lines:• Address and data can be transmitted in one bus cycleif separate address and data lines are available• Cost: (a) more bus lines, (b) increased complexity° Data bus width:• By increasing the width of the data bus, transfers of multiple words require fewer bus cycles• Example: SPARCstation 20’s memory bus is 128 bit wide• Cost: more bus lines° Block transfers:• Allow the bus to transfer multiple words in back-to-back bus cycles• Only one address needs to be sent at the beginning• The bus is not released until the last word is


View Full Document

Berkeley COMPSCI 152 - Lecture 24 Buses Disk IO Queueing Theory

Documents in this Course
Quiz 5

Quiz 5

9 pages

Memory

Memory

29 pages

Quiz 5

Quiz 5

15 pages

Memory

Memory

29 pages

Memory

Memory

35 pages

Memory

Memory

15 pages

Quiz

Quiz

6 pages

Midterm 1

Midterm 1

20 pages

Quiz

Quiz

12 pages

Memory

Memory

33 pages

Quiz

Quiz

6 pages

Homework

Homework

19 pages

Quiz

Quiz

5 pages

Memory

Memory

15 pages

Load more
Download Lecture 24 Buses Disk IO Queueing Theory
Our administrator received your request to download this document. We will send you the file to your email shortly.
Loading Unlocking...
Login

Join to view Lecture 24 Buses Disk IO Queueing Theory and access 3M+ class-specific study document.

or
We will never post anything without your permission.
Don't have an account?
Sign Up

Join to view Lecture 24 Buses Disk IO Queueing Theory 2 2 and access 3M+ class-specific study document.

or

By creating an account you agree to our Privacy Policy and Terms Of Use

Already a member?