US5794073A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Arbitration system for a shared DMA logic on a network adapter with a large number of competing priority requests having predicted latency field
Assignee: Hewlett Packard Development Co LP
•
Filing: 1997-01-29
•
Granted: 1998-08-11
•
Expires: 2017-01-29
Abstract
Abstract In accordance with principles of the invention, there is provided an arbitration system for multiple requesters of a shared data transfer resource, such as a system bus or a peripheral bus. The disclosed system arbitrates among multiple classes of requesters which are divided into multiple levels of a request hierarchy. In the example embodiment, the multiple requesters include logic for processing received data from the network, logic for processing data to be transmitted onto the network, logic for moving transmit and receive descriptors between the host memory and the adapter, logic for reporting status from the adapter to the host, and logic for generating an error and maintenance status update from the adapter to the host. The new system ensures fairness between transmit and receive processes, that FIFOs associated with transmit queues are not underrun, and further that notification of non-error and maintenance status changes are processed with minimal latency.
Inventors
- 👤 Kadangode K. Ramakrishnan
- 👤 Michael Ben-Nun
- 👤 Peter John Roman
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-02 17:29
CPC Classifications
G; G06; G06F; G06F13/00; G06F13/14; G06F13/36; G06F13/362; G06F13/364
Claims Analysis
Total Claims: 5
Claim 1
Independent Claim
353 words
A system for arbitrating between multiple requests for a shared resource, wherein said shared resource is a Direct Memory Access logic within a network adapter, and said Direct Memory Access logic is coupled with a data bus in a host computer system, comprising: first determining means for determining a priority of each request in a first request class, said first request class consisting of transmit data requests to use said Direct Memory Access logic to read transmit data from a host memory in said host computer system, said transmit data to be transmitted onto a network coupled with said network adapter; second determining means for determining a high or a low priority of each request in a second request class, said second request class consisting of receive data requests to use said Direct Memory Access logic to write receive data from said network adapter into said host memory; first selecting means, responsive to said first determining means, for selecting a first selected request equal to one of said requests in said first request class having a highest priority; second selecting means, responsive to said second determining means, for selecting a second selected request equal to one of said requests in said second request class having a high priority; weighted arbitration means, for choosing between said first selected request and said second selected request based on a 1 of N round robin arbitration, said second selected request selected once every N times said shared resource is available, and N is a predetermined integer; means for generating a priority vector associated with each transmit data request, higher values of said priority vector indicating higher priority, said priority vector including a predicted latency field; means for calculating a value `CL` for each transmit data request, where CL is equal to an estimated time period since the last transmission on the virtual circuit for each specific transmit data request estimated to have elapsed at the time said transmit data is actually read from said host memory into said network adapter; and means for writing said value CL into the priority vector for each said transmit data request.
Claim 2
Independent Claim
353 words
A system for arbitrating between multiple requests for a shared resource, wherein said shared resource is a Direct Memory Access logic within a network adapter, and said Direct Memory Access logic is coupled with a data bus in a host computer system, comprising: first determining means for determining a priority of each request in a first request class, said first request class consisting of transmit data requests to use said Direct Memory Access logic to read transmit data from a host memory in said host computer system, said transmit data to be transmitted onto a network coupled with said network adapter; second determining means for determining a high or a low priority of each request in a second request class, said second request class consisting of receive data requests to use said Direct Memory Access logic to write receive data from said network adapter into said host memory; first selecting means, responsive to said first determining means, for selecting a first selected request equal to one of said requests in said first request class having a highest priority; second selecting means, responsive to said second determining means, for selecting a second selected request equal to one of said requests in said second request class having a high priority; weighted arbitration means, for choosing between said first selected request and said second selected request based on a 1 of N round robin arbitration, said second selected request selected once every N times said shared resource is available, and N is a predetermined integer; means for generating a priority vector associated with each transmit data request, higher values of said priority vector indicating higher priority, said priority vector including a predicted latency field; means for calculating a value `CL` for each transmit data request, where CL is equal to an estimated time period since the last transmission on the virtual circuit for each specific transmit data request estimated to have elapsed at the time said transmit data is actually read from said host memory into said network adapter; and means for writing said value CL into the priority vector for each said transmit data request.
Claim 3
Dependent Claim
74 words
The system as in claim 1, further comprising: one or more Receive Queues for indicating reassembled packets received into said network adapter from said network and stored in a Reassembly Memory; each said receive data request is associated with one of said Receive Queues; and wherein said second determining means determines that a given receive data request is high priority if the occupancy level of said Reassembly Memory is greater than a predetermined amount.
Claim 4
Independent Claim
258 words
A method for arbitrating between multiple requests for a shared resource, comprising the steps of: determining a priority of each request in a first request class, said first request class consisting of transmit data requests to use said shared resource, by generating a priority vector associated with each transmit data request, higher values of said priority vector indicating higher priority, said priority vector including a predicted latency field a contents of said predicted latency field equal to a time period estimated to have elapsed since a last previous transmission on a virtual circuit associated with said each transmit data request at a subsequent time when transmit data for said data request is read from a host memory into a network adapter, and by comparing said priority vector of each said request in said first request class; determining a high or a low priority of each request in a second request class, said second request class consisting of receive data requests to use said shared resource; selecting, responsive to said first determining means, a first selected request equal to one of said requests in said first request class having a highest priority; selecting, responsive to said second determining means, a second selected request equal to one of said requests in said second request class having a high priority; and choosing between said first selected request and said second selected request based on a 1 of N round robin arbitration, said second selected request selected once every N times said shared resource is available, and N is a predetermined integer.
Claim 5
Independent Claim
258 words
A method for arbitrating between multiple requests for a shared resource, comprising the steps of: determining a priority of each request in a first request class, said first request class consisting of transmit data requests to use said shared resource, by generating a priority vector associated with each transmit data request, higher values of said priority vector indicating higher priority, said priority vector including a predicted latency field a contents of said predicted latency field equal to a time period estimated to have elapsed since a last previous transmission on a virtual circuit associated with said each transmit data request at a subsequent time when transmit data for said data request is read from a host memory into a network adapter, and by comparing said priority vector of each said request in said first request class; determining a high or a low priority of each request in a second request class, said second request class consisting of receive data requests to use said shared resource; selecting, responsive to said first determining means, a first selected request equal to one of said requests in said first request class having a highest priority; selecting, responsive to said second determining means, a second selected request equal to one of said requests in said second request class having a high priority; and choosing between said first selected request and said second selected request based on a 1 of N round robin arbitration, said second selected request selected once every N times said shared resource is available, and N is a predetermined integer.
References Cited (Backward Citations)
US5245603A
Cited
US5301333A
Cited
US5136584A
Cited
US5231633A
Cited
US5166930A
Cited
US5396490A
Cited
US5515363A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2001-08-10 | 2002-02-09 | 2002-08-11 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2005-08-10 | 2006-02-09 | 2006-08-11 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2009-08-10 | 2010-02-09 | 2010-08-11 | $7700.00 | Window Closed / Lapsed |