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

Method of reducing wasted bus bandwidth in a computer system

Assignee: HP Inc
•
Filing: 1992-05-28
•
Granted: —
•
Expires: 2012-05-28
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract In a multiprocessor computer system (10), wasted bus bandwidth resulting from slow responding slaves (S) is reduced by relinquishing the master (M) that was busied by the slow responding slave, and then causing the slave to effectively arbitrate for bus (12) control on the relinquished master's behalf when the slow responding slave is either available to service the master or has the requested data. In accordance with the disclosed embodiment, the slave effectively arbitrates (36) for bus control on the relinquished master's behalf by placing a unique arbitration code associated with the relinquished master on the bus. The relinquished master detects (42) the presence of its arbitration code and then again arbitrates (22) for bus control so that it may communicate with the slow responding slave.

Inventors

  • 👤 Russell C. Brockmann
  • 👤 William S. Jaffe
  • 👤 Leith L. Johnson

Bibliographic Details

Application Number —
Jurisdiction EP
Data Source google_patents
Last Synchronized 2026-11-03 08:54
CPC Classifications
G; G06; G06F; G06F15/00; G06F15/16; G06F13/00; G06F13/14; G06F13/36; G06F13/368

Claims Analysis

Total Claims: 10
Claim 1
Independent Claim 297 words
In a computer system (10) having a plurality of master devices (masters) (M0, M1, M2, M(N)) that communicate with a plurality of slave devices (slaves) (S1, S2, S3, S(N)) over a shared bus (12), and wherein masters having operations to be conducted by slaves arbitrate to win bus control to permit a winning master to communicate with a selected one of the slaves, a method of reducing wasted bus bandwidth resulting from slow responding slaves comprising the steps of: a) issuing (24) from the winning master to the selected slave a request for service to be performed by the selected slave; b) signalling (BUSY - FIG. 2) the winning master from the selected slave, when the selected slave is either unavailable to service the request or unable to complete the requested service within a first predetermined time period, that the winning master should relinquish control of the bus; c) relinquishing (20, 44) control of the bus from the winning master in response to the signalling from step (b), the winning master becoming a relinquished master; d) arbitrating (36) for bus control at the selected slave, on the relinquished master's behalf, when the selected slave either becomes available to service the request issued in step (a) or has completed the requested service in step (a); and, e) detecting (42) at the relinquished master that the selected slave has arbitrated for bus control on the relinquished master's behalf, and, in response, arbitrating (22) for bus control at the relinquished master, the relinquished master, upon obtaining bus control, reissuing (24) to the selected slave the request previously issued in step (a); the bus thereby being available for communications between other masters and slaves during times that selected slaves are busy or cannot service requests within the first predetermined time period.
Claim 2
Dependent Claim 55 words
Method according to claim 1 wherein each master is assigned a unique arbitration code and step (b) further comprises storing (34) the arbitration code of the winning master at the selected slave when the selected slave is either unavailable to service the request or unable to complete requested service within the first predetermined time period.
Claim 3
Dependent Claim 25 words
Method according to claim 2 wherein step (d) comprises issuing (36), from the selected slave, the arbitration code of the relinquished master on the bus.
Claim 4
Dependent Claim 28 words
Method according to claim 1 wherein the selected slave reserves resources for servicing the request issued by the winning master in step (a) prior to performing step (d).
Claim 5
Dependent Claim 35 words
Method according to claim 1 wherein the request issued in step (a) is a data request, the selected slave having the requested data available for sending to the relinquished master prior to performing step (d).
Claim 6
Dependent Claim 28 words
Method according to claim 1 wherein step (c) further comprises inhibiting (44) the relinquished master from arbitrating for bus control until the selected slave has performed step (d).
Claim 7
Dependent Claim 45 words
Method according to claim 6 wherein the relinquished master is permitted to arbitrate for bus control irrespective of the status of the selected slave only when the selected slave has not arbitrated for bus control on the master's behalf within a second predetermined time period.
Claim 8
Dependent Claim 77 words
Method according to claim 2 wherein, when a selected slave is busy servicing a request issued by a winning master, the following steps are performed when another winning master subsequently issues a request to the busy selected slave: (i) maintaining at the selected slave a record of the identity of each other winning master issuing a request; (ii) performing steps (b) through (e) for each other winning master according to the record maintained at the busy slave.
Claim 9
Dependent Claim 26 words
Method according to claim 1 wherein the computer system is a multiprocessor system and each master is a processor and each slave Is an input/output device.
Claim 10
Dependent Claim 12 words
Method according to claim 1 wherein the bus is a synchronous bus.

References Cited (Backward Citations)

No citation records indexed.

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