02.07.2013 Views

PDP11 PeripheralsHbk 1972 - Trailing-Edge

PDP11 PeripheralsHbk 1972 - Trailing-Edge

PDP11 PeripheralsHbk 1972 - Trailing-Edge

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

f. When the selected slave sees its address and MSYN, and it is ready to accept<br />

the data present on the D lines (slave may be busy completing a previous in·<br />

ternal operation), it strobes in the data and asserts SSYN.<br />

NOTE<br />

Data on the D lines is guaranteed valid for 75ns minimum<br />

after SSYN is asserted. Data is not guaranteed<br />

valid when the slave receives negated MSYN. The pro·<br />

cessor times out and removes MSYN if no SSYN reo<br />

sponse is made within 25fLsec.<br />

g. The master receives SSYN and negates MSYN.<br />

h. After 75 ns minimum wait, the master removes or alters the A, C, and D lines.<br />

If another DATO or DATOB follows, then the master repeats the above se· F<br />

quence starting at step b. If this is last bus cycle of the master operation and<br />

when A, C, and D lines are all clear, then the master clears BBSY and relin·<br />

quishes bus control. If an input operation follows, the next cycle starts at step<br />

a of the DATI or DATIP operation.<br />

i. The slave sees the negation of MSYN and negates SSYN.<br />

1.3 PRIORITY TRANSFER TRANSACTIONS<br />

Transfer of bus control from one device to another is determined by priority arbitration<br />

logic, which is part of the processor. Requests for the bus can be made at<br />

any time (asynchronously) on the bus request (BR) and non-processor request<br />

(NPR) lines. During each bus cycle, the arbitration logic first checks for an NPR<br />

request (since these requests take precedence over processor use of the bus). If<br />

an NPR is present, the logic issues an NPG Signal and receives a selection ack·<br />

nowledge (SACK) signal in return. This procedure occurs simultaneously with the<br />

current data transfer. When the device scheduled to become the new bus master<br />

is selected, it waits for the present master to clear bus busy (BBSY); then, the<br />

newly selected device becomes bus master and asserts BBSY.<br />

A similar procedure occurs at the end of each instruction when the priority arbitration<br />

logic checks the bus request lines against the processor priority (as determined<br />

by bits of the processor status register) and the priority logic issues<br />

a grant on the corresponding line. Thus, one of the four levels of BR<br />

requests is granted by the processor between instructions unless the instruction<br />

currently being executed causes an internal trap (either an error or trap instruction).<br />

In this case, BR requests are not granted until completion of the first instruction<br />

following the trap sequence. The highest request is always granted first<br />

(if the processor priority level is lower than the request level). The grant signals always<br />

pass serially through each device connected to the corresponding level in<br />

the system. If a device makes a request, it blocks the signal transmission to the<br />

next device on the line; otherwise, it passes the signal on.<br />

This causes the device closest to the processor to be the highest subpriority on<br />

each request level.<br />

1.3.1 Priority Transfer (PTR) Transaction (See Figure 1-6)<br />

The signal sequence by which a device becomes selected as next bus master is the<br />

priority transfer (PTR) bus operation. This operation does not actually transfer<br />

bus control; it only selects a device as next bus master. The sequence of events is<br />

as follows:<br />

187

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!