Patent US6128277A successfully refreshed from Google Patents.
US6128277A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Reliable array of distributed computing nodes
Assignee: California Institute of Technology
•
Filing: 1999-12-02
•
Granted: 2000-10-03
•
Expires: 2019-12-02
Abstract
Abstract A system which uses redundant storage and redundant communication to provide a robust distributed server system.
Inventors
- 👤 Joshua Bruck
- 👤 Vasken Bohossian
- 👤 Chenggong Fan
- 👤 Paul LeMahieu
- 👤 Marcus David Daniel Riedel
- 👤 Lihao Xu
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-08 03:17
CPC Classifications
G; G06; G06F; G06F11/00; G06F11/07; G06F11/08; G06F11/10; G06F11/1076; G06F2211/00; G06F2211/10; G06F2211/1002; G06F2211/1028
Claims Analysis
Total Claims: 7
Claim 1
Independent Claim
90 words
A method of using an error correcting code, comprising: storing raw information and redundant information indicating the error correcting code into a plurality of information nodes; determining a parameter indicating usability of said information nodes; reading said raw information from said plurality of nodes if said parameter indicates that said plurality of nodes are usable, and reading both said raw data and said redundant data from less than said plurality of nodes if said parameter indicates that at least a portion of said plurality of nodes are less than usable.
Claim 2
Independent Claim
90 words
A method of using an error correcting code, comprising: storing raw information and redundant information indicating the error correcting code into a plurality of information nodes; determining a parameter indicating usability of said information nodes; reading said raw information from said plurality of nodes if said parameter indicates that said plurality of nodes are usable, and reading both said raw data and said redundant data from less than said plurality of nodes if said parameter indicates that at least a portion of said plurality of nodes are less than usable.
Claim 3
Dependent Claim
73 words
A coding method for an array of nodes, comprising: forming an array of information, by forming each column of the array representing information from a node, forming a raw portion of each column including raw information indicating data, forming a redundant information indicating redundancy information, said redundancy information indicating information about other nodes besides said each node, as taken along an envelope of a specified shape that obtains information from said other node.
Claim 4
Dependent Claim
73 words
A coding method for an array of nodes, comprising: forming an array of information, by forming each column of the array representing information from a node, forming a raw portion of each column including raw information indicating data, forming a redundant information indicating redundancy information, said redundancy information indicating information about other nodes besides said each node, as taken along an envelope of a specified shape that obtains information from said other node.
Claim 5
Dependent Claim
24 words
A coding method as in claim 2, wherein said envelope is a diagonal which is extended to other nodes beyond edges of said array.
Claim 6
Independent Claim
87 words
A method of forming a redundantly-coded network formed from a plurality of nodes, comprising: mapping each node to a column of an array; forming two rows of redundant information from said columns of the array, and placing said two rows into said columns, to form a resultant array of N by N including N-2 by N information symbols, and 2 by N redundant information symbols, said parity symbols being constructed according to: ##EQU3## where I=0, 1, . . . , n-1, and (x) n =X mod n.
Claim 7
Independent Claim
87 words
A method of forming a redundantly-coded network formed from a plurality of nodes, comprising: mapping each node to a column of an array; forming two rows of redundant information from said columns of the array, and placing said two rows into said columns, to form a resultant array of N by N including N-2 by N information symbols, and 2 by N redundant information symbols, said parity symbols being constructed according to: ##EQU3## where I=0, 1, . . . , n-1, and (x) n =X mod n.
References Cited (Backward Citations)
EP0366935A2
Cited
US5475697A
Cited
US5388243A
Cited
WO1991014229A1
Cited
US5361347A
Cited
US5579475A
Cited
US5872904A
Cited
US5307351A
Cited
US5412661A
Cited
US5867640A
Cited
US5899582A
Cited
US5630007A
Cited
US5768623A
Cited
US5612897A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2003-10-03 | 2004-04-03 | 2004-10-03 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2007-10-03 | 2008-04-03 | 2008-10-03 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2011-10-03 | 2012-04-03 | 2012-10-03 | $7700.00 | Window Closed / Lapsed |