US5504913A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Queue memory with self-handling addressing and underflow
Assignee: Apple Inc
•
Filing: 1992-05-14
•
Granted: 1996-04-02
•
Expires: 2012-05-14
Abstract
Abstract The present invention reduces the overhead commonly associated with computer queues by not requiring direct addressing of each location in the queue and by not requiring specialized underflow logic. Furthermore, reads and writes to the computer queue of the present invention can be asynchronous. Lastly, the computer queue of the present invention requires less circuitry and is thus physically smaller, requires less power to operate and can operate more quickly than can queues of the prior art.
Inventors
- 👤 Eric A. Baden
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-02 18:14
CPC Classifications
G; G06; G06F; G06F5/00; G06F5/06; G06F5/10
Claims Analysis
Total Claims: 17
Claim 1
Independent Claim
205 words
An improved computer queue memory comprising: a) a register file, said register file comprising a matrix of rows and columns of transparent latches wherein each said column of transparent latches comprises a word of said queue memory and wherein each said row of transparent latches comprises a bit of each said word of said queue memory; b) a write addressing shift register, said write addressing shift register comprising a series of flip-flops, each said write addressing flip-flop coupled to address one column of said columns of transparent latches of said register file; c) a read addressing shift register and a read addressing shift register cycle indicator, said read addressing shift register comprising a series of flip-flops, each said read addressing series flip-flop coupled to select the output of one transparent latch of a first predetermined set of outputs of each said row of transparent latches of said register file and also coupled to select the output of one transparent latch of a second predetermined set of outputs of each said row of transparent latches of said register file, said read addressing shift register cycle indicator coupled to select between said predetermined sets of outputs of each said row of transparent latches of said register file.
Claim 2
Dependent Claim
205 words
An improved computer queue memory comprising: a) a register file, said register file comprising a matrix of rows and columns of transparent latches wherein each said column of transparent latches comprises a word of said queue memory and wherein each said row of transparent latches comprises a bit of each said word of said queue memory; b) a write addressing shift register, said write addressing shift register comprising a series of flip-flops, each said write addressing flip-flop coupled to address one column of said columns of transparent latches of said register file; c) a read addressing shift register and a read addressing shift register cycle indicator, said read addressing shift register comprising a series of flip-flops, each said read addressing series flip-flop coupled to select the output of one transparent latch of a first predetermined set of outputs of each said row of transparent latches of said register file and also coupled to select the output of one transparent latch of a second predetermined set of outputs of each said row of transparent latches of said register file, said read addressing shift register cycle indicator coupled to select between said predetermined sets of outputs of each said row of transparent latches of said register file.
Claim 3
Dependent Claim
44 words
The improved computer queue memory of claim 1 further comprising a queue memory full shift register, said queue memory full shift register comprising a series of flip-flops, each said queue memory full flip-flop coupled to indicate a degree of fullness of said register file.
Claim 4
Dependent Claim
37 words
The improved computer queue memory of claim 2 further comprising a read/write synchronizer, said read/write synchronizer comprising a set of shift registers, each said shift register of said set of shift registers comprising a series of flip-flops.
Claim 5
Dependent Claim
24 words
The improved computer queue memory of claim 3 wherein said register file comprises ten columns of transparent latches and thirty-eight rows of transparent latches.
Claim 6
Dependent Claim
17 words
The improved computer queue memory of claim 4 wherein said write addressing shift register comprises ten flip-flops.
Claim 7
Dependent Claim
17 words
The improved computer queue memory of claim 5 wherein said read addressing shift register comprises five flip-flops.
Claim 8
Dependent Claim
19 words
The improved computer queue memory of claim 6 wherein said read addressing shift register cycle indicator comprises one flip-flop.
Claim 9
Dependent Claim
18 words
The improved computer queue memory of claim 7 wherein said queue memory full shift register comprises eleven flip-flops.
Claim 10
Dependent Claim
25 words
The improved computer queue memory of claim 8 wherein said read/write synchronizer comprises four shift registers wherein each read/write synchronizer shift register comprises three flip-flops.
Claim 11
Dependent Claim
17 words
The improved computer queue memory of claim 9 wherein said computer queue memory is a first-in-first-out queue.
Claim 12
Dependent Claim
274 words
An improved computer queue memory comprising: a) a register file, said register file comprising a matrix of thirty-eight rows and ten columns of transparent latches wherein each said column of transparent latches comprises a word of said queue memory and wherein each said row of transparent latches comprises a bit of each said word of said queue memory; b) a write addressing shift register, said write addressing shift register comprising a series of ten flip-flops, each said write addressing series flip-flop coupled to address one column of said columns of transparent latches of said register file; c) a read addressing shift register and a read addressing shift register cycle indicator, said read addressing shift register comprising a series of five flip-flops, each said read addressing series flip-flop coupled to select the output of one transparent latch of a first predetermined set of outputs of each said row of transparent latches of said register file and also coupled to select the output of one transparent latch of a second predetermined set of outputs of each said row of transparent latches of said register file, said read addressing shift register cycle indicator coupled to select between said predetermined sets of outputs of each said row of transparent latches of said register file; d) a queue memory full shift register, said queue memory full shift register comprising a series of flip-flops, each said queue memory full flip-flop coupled to indicate a degree of fullness of said register file; and, e) a read/write synchronizer, said read/write synchronizer comprising a set of shift registers, each said shift register of said set of shift registers comprising a series of flip-flops.
Claim 13
Dependent Claim
274 words
An improved computer queue memory comprising: a) a register file, said register file comprising a matrix of thirty-eight rows and ten columns of transparent latches wherein each said column of transparent latches comprises a word of said queue memory and wherein each said row of transparent latches comprises a bit of each said word of said queue memory; b) a write addressing shift register, said write addressing shift register comprising a series of ten flip-flops, each said write addressing series flip-flop coupled to address one column of said columns of transparent latches of said register file; c) a read addressing shift register and a read addressing shift register cycle indicator, said read addressing shift register comprising a series of five flip-flops, each said read addressing series flip-flop coupled to select the output of one transparent latch of a first predetermined set of outputs of each said row of transparent latches of said register file and also coupled to select the output of one transparent latch of a second predetermined set of outputs of each said row of transparent latches of said register file, said read addressing shift register cycle indicator coupled to select between said predetermined sets of outputs of each said row of transparent latches of said register file; d) a queue memory full shift register, said queue memory full shift register comprising a series of flip-flops, each said queue memory full flip-flop coupled to indicate a degree of fullness of said register file; and, e) a read/write synchronizer, said read/write synchronizer comprising a set of shift registers, each said shift register of said set of shift registers comprising a series of flip-flops.
Claim 14
Dependent Claim
19 words
The improved computer queue memory of claim 11 wherein said read addressing shift register cycle indicator comprises one flip-flop.
Claim 15
Dependent Claim
18 words
The improved computer queue memory of claim 12 wherein said queue memory full shift register comprises eleven flip-flops.
Claim 16
Dependent Claim
25 words
The improved computer queue memory of claim 13 wherein said read/write synchronizer comprises four shift registers wherein each read/write synchronizer shift register comprises three flip-flops.
Claim 17
Dependent Claim
20 words
The improved computer queue memory of claim 14 wherein said computer queue memory functions as a first-in-first-out computer queue memory.
References Cited (Backward Citations)
US3629857A
Cited
US3699535A
Cited
GB1525045A
Cited
US4423482A
Cited
US4507760A
Cited
US4616338A
Cited
US4819201A
Cited
US4622631A
Cited
US4622631B1
Cited
US4682284A
Cited
US4829475A
Cited
US5027330A
Cited
US5016221A
Cited
US5220529A
Cited
US5224093A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1999-04-02 | 1999-10-02 | 2000-04-02 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2003-04-02 | 2003-10-02 | 2004-04-02 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2007-04-02 | 2007-10-02 | 2008-04-02 | $7700.00 | Window Closed / Lapsed |