← Back to Patent Explorer
EP0118731A1 Expired / Lapsed EP ⏱️ 0.0 years remaining

Distributed-structure circuit for arbitrating the access requests to the bus of a multiprocessor system

Assignee: Telecom Italia SpA
•
Filing: 1984-02-02
•
Granted: —
•
Expires: 2004-02-02
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract The arbitrating circuit presents a distributed structure and a binary-tree connection of the priority bus to all the parts forming the distributed structure. Said circuit effects an initialization procedure of the dynamic and distributed type, which does not require an external controller and assigns, as initial priority vector of each element, the vector present on the priority bus, emitted by the upstream arbiter and reduced by a binary unit: in addition, at each bus cycle, it cylically reassigns the priority to all the elements, by stopping the re-assignment procedure when an element which has acquired the bus, requests it for more cycles (Fig.2).

Inventors

  • 👤 Giuseppe Nicolo Capizzi
  • 👤 Marcello Melgara

Bibliographic Details

Application Number —
Jurisdiction EP
Data Source google_patents
Last Synchronized 2026-11-04 19:18
CPC Classifications
G; G06; G06F; G06F13/00; G06F13/14; G06F13/36; G06F13/368; G06F13/374

Claims Analysis

Total Claims: 5
Claim 1
Independent Claim 594 words
Circuit for arbitrating the access requests to a bus (B) by elements (MP1, MP2, ...) of a multiprocessor system, said circuit having a distributed structure composed of equal arbitrating devices (ARB1, ARB2, ...), each connected to the corresponding element and interconnected via a priority bus (P) having a binary-tree structure, and for the initialization procedures connected in series, the available time for accessing the bus being subdivided into successive cycles, characterized in that each of said arbitrating devices (ARBl) comprises: - a comparator (COMP) which receives at the inputs said priority bus (P), on which there is present a binary-number forming a priority vector p, and a first internal bus (R) carrying a binary number forming a present priority vector r, and which emits an equality signal (EQ) of data present on said input buses; - a computing circuit (NP) of the future priority which receives at the inputs said priority bus (P) and first internal bus (R) and emits on a second internal bus (D) a binary number, which forms a future priority vector d, computed starting from the most significant position according to the following Boolean equations: where equation (1) is valid for the bits of the moat significant position of the vectors, the equation (2) is valid for the bits of all the other positions, symbols d (j), p (j), r (j) indicate the bit having j -th weight of the respective vectors d, p, r, while the symbols XOR and * indicate EX-OR and AND logic operations; - a first transmission circuit (DR1) for sending on a fourth internal bus (Dl) said future priority vector d present on said second internal bus (D) only when it receives a first enabling signal (AB1); - a decrement logic (LD) subtracting a fixed binary number from said priority vector p present on the priority bus (P) and obtaining and sending on a third internal bus (U) an initial-priority vector i; - a second transmission circuit (DR2) sending on said fourth internal bus (Dl) said initial-priority vector i present on said third internal bus (U) only when it receives a second enabling signal (AB2); - an internal register (RGI) memorizing and supplying on said first internal bus (R) the priority vector present on said fourth internal bus (Dl); - a third transmission circuit (DR3), sending on said priority bus (P) the priority vector present on said first internal bus (R), only when it receives a third enabling signal (AB3); - a control logic (UCl) carrying out in sequence the following operations: when it receives a reset signal (RS), it emits an inhibition signal (LK) of the arbitrating procedures of all the arbitrating devices for the subsequent cycles, and, if an initialization signal (IN1) emitted by the upstream arbitrating device is active, it emits said second (AB2) and then said third (AB3) enabling signal and then an initialization signal (IH2), towards the downstream arbitrating device; when said inhibition signal (LK) is deactivated it emits said first enabling signal (ABl), and, if a signal of access request to the bus (B) coming from the respective element (MP1) is present, it emits said third enabling signal (AB3); if it receives said equality signal (EQ) from said comparator (COMP) it emits towards the respective element (MP 1) a signal (AK1) indicating the occurred bus acquisition; then if the element (MP1) has sent a signal (CN1) of request of the bus (B) for a plurality of cycles, it emits said inhibition signal (LK) up to the last but one cycle requested, else it emits said first enabling signal (AB1).
Claim 2
Dependent Claim 594 words
Circuit for arbitrating the access requests to a bus (B) by elements (MP1, MP2, ...) of a multiprocessor system, said circuit having a distributed structure composed of equal arbitrating devices (ARB1, ARB2, ...), each connected to the corresponding element and interconnected via a priority bus (P) having a binary-tree structure, and for the initialization procedures connected in series, the available time for accessing the bus being subdivided into successive cycles, characterized in that each of said arbitrating devices (ARBl) comprises: - a comparator (COMP) which receives at the inputs said priority bus (P), on which there is present a binary-number forming a priority vector p, and a first internal bus (R) carrying a binary number forming a present priority vector r, and which emits an equality signal (EQ) of data present on said input buses; - a computing circuit (NP) of the future priority which receives at the inputs said priority bus (P) and first internal bus (R) and emits on a second internal bus (D) a binary number, which forms a future priority vector d, computed starting from the most significant position according to the following Boolean equations: where equation (1) is valid for the bits of the moat significant position of the vectors, the equation (2) is valid for the bits of all the other positions, symbols d (j), p (j), r (j) indicate the bit having j -th weight of the respective vectors d, p, r, while the symbols XOR and * indicate EX-OR and AND logic operations; - a first transmission circuit (DR1) for sending on a fourth internal bus (Dl) said future priority vector d present on said second internal bus (D) only when it receives a first enabling signal (AB1); - a decrement logic (LD) subtracting a fixed binary number from said priority vector p present on the priority bus (P) and obtaining and sending on a third internal bus (U) an initial-priority vector i; - a second transmission circuit (DR2) sending on said fourth internal bus (Dl) said initial-priority vector i present on said third internal bus (U) only when it receives a second enabling signal (AB2); - an internal register (RGI) memorizing and supplying on said first internal bus (R) the priority vector present on said fourth internal bus (Dl); - a third transmission circuit (DR3), sending on said priority bus (P) the priority vector present on said first internal bus (R), only when it receives a third enabling signal (AB3); - a control logic (UCl) carrying out in sequence the following operations: when it receives a reset signal (RS), it emits an inhibition signal (LK) of the arbitrating procedures of all the arbitrating devices for the subsequent cycles, and, if an initialization signal (IN1) emitted by the upstream arbitrating device is active, it emits said second (AB2) and then said third (AB3) enabling signal and then an initialization signal (IH2), towards the downstream arbitrating device; when said inhibition signal (LK) is deactivated it emits said first enabling signal (ABl), and, if a signal of access request to the bus (B) coming from the respective element (MP1) is present, it emits said third enabling signal (AB3); if it receives said equality signal (EQ) from said comparator (COMP) it emits towards the respective element (MP 1) a signal (AK1) indicating the occurred bus acquisition; then if the element (MP1) has sent a signal (CN1) of request of the bus (B) for a plurality of cycles, it emits said inhibition signal (LK) up to the last but one cycle requested, else it emits said first enabling signal (AB1).
Claim 3
Dependent Claim 38 words
Circuit for arbitrating according to claim 1, in which on said priority bus (P) logic level 1 is prevailing, characterized in that said decrement logic (LD) subtracts binary value 1 from the binary number present at its input.
Claim 4
Dependent Claim 56 words
Circuit for arbitrating as in claim 1 or 2, characterized in that said comparator (COMP) and said computing circuit of the future priority (NP) form a logic circuit subdivided into two levels (CON1, CON2), the first level receiving and processing the most significant bits of the input bus, and the second level the least significant bits.
Claim 5
Dependent Claim 56 words
Circuit for arbitrating as in claim 3, characterized in that, in case said vectors are composed of five bits, the first level (CON1) of said logic circuit receives at the input the bits of the three most significant positions of vectors r, p, and the second level (CON2) the bits of the two least significant positions.

References Cited (Backward Citations)

US4326250A Cited
EP0035731A2 Cited

USPTO Annuity & Maintenance Windows

Maintenance schedule is calculated for granted US utility patents.

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag