Address phase - computer architecture, Computer Engineering

Assignment Help:

Address phase:

A PCI bus transaction starts having an address phase. The initiator,  after seeing that it has GNT# and the bus is inactive, drives the target address onto the AD[31:0] lines, the associated command (for example: I/O write or memory read,) on the C/BE[3:0]# lines, and pulls FRAME# low.

Each other device inspect the address and command & decides whether to respond as the target by asserting DEVSEL#. Device has to respond by asserting DEVSEL# within 3 cycles. Devices which promise to respond within one or two cycles are said to have "fast DEVSEL" or "medium DEVSEL", respectively. (In fact, the time to respond is 2.5 cycles, since PCI devices have to transmit all signals half a cycle early so that they can be retaining3 cycles later.)Note that a device have to latch the address on the first cycle; the initiator is needed to remove the address and command from the bus on the following cycle, even before retaining a DEVSEL# response. The extra time is available only for interpreting the address and command after it is captured. On the fifth cycle of the address phase (or earlier if all other devices have medium DEVSEL or faster), a catch-all "subtractive decoding" is permitted for some address ranges. It is generally used by an ISA bus bridge for addresses within its particular range (16 bits for I/O and 24 bits for memory).

On the sixth cycle, if there has been no response, the initiator can abort the transaction by deserting FRAME#. It is known as master abort termination and it is customary for PCI bus bridges to return all- ones data (0xFFFFFFFF) in this particular case. PCI devices therefore are generally designed to ignore by using the all-ones value in essential status registers, so that such type of error may be easily detected by software.

 


Related Discussions:- Address phase - computer architecture

Define dynamic loading, Define dynamic loading. To get better memory-sp...

Define dynamic loading. To get better memory-space utilization dynamic loading is used. With dynamic loading, a routine is not loaded unless it is called. All routines are kept

The six various application of stack, The six several application of stack ...

The six several application of stack in computer application is: 1.  Conversion of infix to postfix notation and vice versa. 2.  Evaluation of arithmetic expression. 3.

Explain about the viruses in detail, Explain about the viruses in detail ...

Explain about the viruses in detail Note 1: Viruses don't just infect computers, they may also affect mobile phones, MP3 players etc. - any device that can download files fro

Define deadlock, Define deadlock. A process requests resources; if the ...

Define deadlock. A process requests resources; if the resources are not available at that time, the method enters a wait state. Waiting processes might never again change state

What is priority interrupt, What is Priority interrupt. It is a system ...

What is Priority interrupt. It is a system that establishes a priority over the several resources to determined which condition are to be serviced first when two or more reques

What are the differences between struts and units, What are the differences...

What are the differences between struts and units?  A warm up question. Units are static objects that exist from the start of the simulation right up to its end, whereas struts

State the benefits of encapsulation, State The Benefits of Encapsulation ...

State The Benefits of Encapsulation To hide the details of a class, you can declare that data or implementation in the private part of class so that other class clients will n

Illustrate the advantages of encapsulation, Advantages of Encapsulation ...

Advantages of Encapsulation You can also delay the resolution of the details until after the design.  You can keep your code modular.

State and prove demorgan’s first theorems, State and prove Demorgan’s First...

State and prove Demorgan’s First theorems: Ans. Statement of First Theorem of De Morgan: = A‾. B‾   Proof: The two sides of the equation i.e. = is represented with logic

What is analysis iteration, Analysis Iteration   To understand any prob...

Analysis Iteration   To understand any problem completely you have to repeat task which implies that analysis requires repetition. First, just get overview of problem, make a r

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd