PDP11 PeripheralsHbk 1972 - Trailing-Edge
PDP11 PeripheralsHbk 1972 - Trailing-Edge
PDP11 PeripheralsHbk 1972 - Trailing-Edge
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
The bus master places address, control, and data information on the UNIBUS,<br />
waits 150 ns, and then asserts MSYN. After a worst case propagation delay of 75<br />
ns, the slave recognizes MSYN and clocks the data into its register. Since the 75ns<br />
propagation delay includes the transmitter and receiver delays, the time required<br />
to turn MSYN around into SSYN is literally O. Also, since the data preceded<br />
MSYN by 150 ns (worst case skew is only 75 ns), there is ample preset time for<br />
the data input to the slave device flip-flop register.<br />
When the master sees SSYN, it clears its MSYN control (nominal time, 25 ns) and<br />
then waits 75 ns before clearing or changing address, control, and data information.<br />
Additional cycles may proceed at this time provided SSYN is cleared before<br />
MSYN is again asserted. This means that a sustained DATa transfer rate of 400<br />
ns/word may be maintained. This is equivalent to a transfer rate of 40 million<br />
bits per second.<br />
Figure 1-11 is a typical timing flow diagram for a DATI transfer. The slave device<br />
logic is shown in Figure 1-12. The procedure for a DATI transfer is essentially the<br />
same as for a DATa transfer with four exceptions:<br />
a. The master asserts only address and control information.<br />
b. The slave gates data onto the bus simultaneously with the return of SSYN.<br />
c. The master must wait 75 ns (to allow for skew between SSYN and DATA) before<br />
clearing MSYN and strobing data.<br />
d. The slave clears data when it clears SSYN.<br />
The DATI cycle allows sustained transfer rates of 450 ns-word which is equivalent<br />
to 35.2 million bits second.<br />
1.4.2 Time-Out Protection<br />
A precaution must be taken when designing peripheral devices that gain control<br />
of the bus for the purpose of transferring data to another element on the UNI<br />
BUS. Normally, such a device contains a bus address register, which is loaded by<br />
the program as one of the initialization steps. This address must then be incremented<br />
by the device upon completion of each data transfer. If the program<br />
loads an erroneous address or if the register increments beyond the available<br />
core memory in the existing system, no SSYN response is generated for the data<br />
transfer. To prevent this problem from hanging up the system, it is recommended<br />
that a 10- to 25-pS integrating one-shot be triggered each time the master device<br />
asserts MSYN. If this one-shot times out before SSYN is received, the master<br />
should stop the transfer by clearing MSYN, BBSY, and any other signals it has asserted.<br />
The master should then set an error flag in its status register.<br />
1.5 ADDRESS MAPPING<br />
A PDP-Address Map is shown in Appendix A. Observe that, in the following discussion,<br />
all addresses are numbered in octal. The letter K, which is normally used<br />
to devote 1000 (decimal), is used in this discussion to denote 1024 (decimal).<br />
The UNIBUS addresses 2'8 locations (262,144 '0 or 256K), and each location contains<br />
eight bits. On the basic PDP-ll systems only 16 bits of address information<br />
are under program control. This limits the processor to an address map of 64K locations.<br />
Since the word length and bus width are two bytes, most bus operations<br />
access two locations at once; the address supplied on the bus is that of the evennumbered<br />
location, and the next higher odd location is selected as well. Byte op-<br />
192