Signals Reference
Table
Bus Signal | Agent 0 Pins | Agent 1 Pins | Agent 2 Pins | Agent 3 Pins |
|
|
|
|
|
BREQ[0]# | BR[0]# | BR[3]# | BR[2]# | BR[1]# |
|
|
|
|
|
BREQ[1]# | BR[1]# | BR[0]# | BR[3]# | BR[2]# |
|
|
|
|
|
BREQ[2]# | BR[2]# | BR[1]# | BR[0]# | BR[3]# |
|
|
|
|
|
BREQ[3]# | BR[3]# | BR[2]# | BR[1]# | BR[0]# |
|
|
|
|
|
Table
Bus Signal | Agent 0 Pins | Agent 3 Pins |
|
|
|
BREQ[0]# | BR[0]# | BR[1]# |
|
|
|
BREQ[1]# | BR[1]# | BR[0]# |
|
|
|
BREQ[2]# | Not Used | Not Used |
|
|
|
BREQ[3]# | Not Used | Not Used |
|
|
|
During
Table A-6. BR[3:0]# Signals and Agent IDs
Pin Sampled |
|
|
Asserted on | Arbitration ID | Agent ID Reported |
RESET# |
|
|
|
|
|
BR[0]# | 0 | 0 |
|
|
|
BR[3]# | 1 | 2 |
|
|
|
BR[2]# | 2 | 4 |
|
|
|
BR[1]# | 3 | 6 |
|
|
|
A.1.15 BREQ[3:0]# (I/O)
The BREQ[3:0]# signals are the symmetric agent arbitration bus signals (called bus request). A symmetric agent n arbitrates for the bus by asserting its BREQn# signal. Agent n drives BREQn# as an output and receives the remaining BREQ[3:0]# signals as inputs.
The symmetric agents support distributed arbitration based on a
A new arbitration event occurs either when a symmetric agent asserts its BREQn# on an Idle bus (all BREQ[3:0]# previously deasserted), or the current symmetric owner deasserts BREQn# to release the bus ownership to a new bus owner n. On a new arbitration event, all symmetric agents simultaneously determine the new symmetric owner using BREQ[3:0]# and the rotating ID. The symmetric owner can park on the bus (hold the bus) provided that no other symmetric agent is requesting its use. The symmetric owner parks by keeping its BREQn# signal asserted. On
Datasheet | 95 |