Patent US5202988A successfully refreshed from Google Patents.
US5202988A
Expired / Lapsed
US
⏱️ 0.0 years remaining
System for communicating among processors having different speeds
Assignee: Silicon Graphics International Corp
•
Filing: 1990-08-23
•
Granted: 1993-04-13
•
Expires: 2010-08-23
Abstract
Abstract Communication among processors having differing operating speeds by providing wake queues in which slower processors can queue entries, access to which by multiple concurrent producers and multiple concurrent consumers is synchronized or controlled using global registers. When a faster processor executes a kernel process for handling a wake queue, an entry is fetched from the wake queue and information stored in the entry is used to process the entry.
Inventors
- 👤 George A. Spix
- 👤 Gregory G. Gaertner
- 👤 Diane M. Wengelski
- 👤 Keith J. Thompson
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-04 15:25
CPC Classifications
G; G06; G06F; G06F8/00; G06F8/40; G06F8/41; G06F12/00; G06F12/02; G06F12/0223; G06F12/023; G06F12/08; G06F12/12; G06F8/43; G06F8/433; G06F8/44; G06F8/445; G06F8/45; G06F9/00; G06F9/06; G06F9/46; G06F9/52
Claims Analysis
Total Claims: 7
Claim 1
Independent Claim
169 words
In a computing system having a plurality of shared data storage resources, a plurality of sources of service requests and a plurality of processors, each capable of performing tasks required by said service requests, apparatus for queuing service requests and processes for performing the required tasks comprising: wake queue means in at least one of said shared data storage resources for storing service requests, queue entry means coupled between the wake queue and the plurality of sources of service requests for entering in said wake queue means service requests and context used to respond to associated entered service requests, access means controlled by one of said plurality of processors for processing wake queue entries, consume entry means coupled to said wake queue means for retrieving a process identified by the said access means, and run queue means coupled to said consume entry means for storing a retrieved process to be run when a processor becomes available to run the process identified by context entered in said wake queue means.
Claim 2
Dependent Claim
169 words
In a computing system having a plurality of shared data storage resources, a plurality of sources of service requests and a plurality of processors, each capable of performing tasks required by said service requests, apparatus for queuing service requests and processes for performing the required tasks comprising: wake queue means in at least one of said shared data storage resources for storing service requests, queue entry means coupled between the wake queue and the plurality of sources of service requests for entering in said wake queue means service requests and context used to respond to associated entered service requests, access means controlled by one of said plurality of processors for processing wake queue entries, consume entry means coupled to said wake queue means for retrieving a process identified by the said access means, and run queue means coupled to said consume entry means for storing a retrieved process to be run when a processor becomes available to run the process identified by context entered in said wake queue means.
Claim 3
Dependent Claim
43 words
The apparatus of claim 1 wherein: said wake queue means includes a plurality of data storage areas within said plurality of shared data storage resources, and said queue entry means enters the context in said data storage areas in response to service requests.
Claim 4
Dependent Claim
26 words
The apparatus of claim 2 wherein at least one of said plurality of processors scans said wake queue for determining whether a service request requires handling.
Claim 5
Dependent Claim
40 words
The apparatus of claim 2 wherein said shared storage resources each comprise global register means shared by more than one of said plurality of processors and wherein said queue entry means sequentially enters said context in said global register means.
Claim 6
Dependent Claim
38 words
The apparatus of claim 4 wherein said queue entry means enter semaphore address entries in said global register means, and said consume entry means reads each semaphore address entry and retrieves a process waiting for each semaphore address.
Claim 7
Dependent Claim
109 words
The apparatus of claim 4 wherein said queue entry means enters command blocks in at least one of said global register means of said wake queue means, further including work queue means in at least one of said plurality of shared data storage resources for storing command blocks, and wherein said consume entry means includes means for reading a command block from said wake queue means, means for queuing a read out command block in said work queue means, means for retrieving a command block process to process the command block in said work queue means, and means for queuing said command block process in said run queue means.
References Cited (Backward Citations)
US4177513A
Cited
US4644461A
Cited
US4646231A
Cited
US4615001A
Cited
US4805107A
Cited
US4943913A
Cited
US5031089A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1996-04-12 | 1996-10-12 | 1997-04-13 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2000-04-12 | 2000-10-12 | 2001-04-13 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2004-04-12 | 2004-10-12 | 2005-04-13 | $7700.00 | Window Closed / Lapsed |