← Back to Patent Explorer
US4633472A Expired / Lapsed US ⏱️ 0.0 years remaining

Multiprocessor computer system comprising n parallel operating computer modules, and computer module for use in such a multiprocessor computer system

Assignee: US Philips Corp
•
Filing: 1983-10-17
•
Granted: 1986-12-30
•
Expires: 2003-10-17
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A multiprocessor computer system having n parallel-operating computer modules which each include a processor module, a memory module and a data word reconstruction module, wherein each module of said system processes the same piece of data simultaneously and in parallel. The data words are applied to a reducing encoder so that code symbols stored in the relevant computer modules form a code word. The relevant error-correction code has a simultaneous correction capability in at least two code symbols. Each data word reconstruction module receives the entire code word in order to reconstruct the data word therefrom. Each computer module also has an input/output memory module. This module receives a coded data word which is decoded when it is presented again. Decoding is performed so that each bit in the input/output memory is mapped on at the most one bit of the associated memory module.

Inventors

  • 👤 Thijs Krol

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-26 06:29
CPC Classifications
G; G06; G06F; G06F11/00; G06F11/07; G06F11/08; G06F11/10; H; H03; H03M; H03M13/00; H03M13/03; H03M13/05; H03M13/13

Claims Analysis

Total Claims: 7
Claim 1
Independent Claim 460 words
A multiprocessor computer system, comprising n synchronously controlled parallel operating computer modules, each of which is localized in its own fault isolation area, each computer module comprising: a processor module; a data channel which is connected to a data connection of the processor module; a reducing encoder which is connected to the data channel in order to form a code symbol from a data word received from said data channel so that said encoders of the modules processing said data word form, on the basis of a data word comprising k data symbols, a code word consisting of k+1≦n<3k code symbols of a code incorporating a simultaneous correction capability in at least two code symbols; a memory module comprising a first data input which is connected to a first data output of the associated reducing encoder, and to a relevant second data output of each memory module of the respective computer modules; and a data word reconstruction module which is connected via an interconnection network, to the relevant second data outputs of the memory modules of the various computer modules in order to receive a relevant code symbol of a code word from each computer module in order to construct a data word therefrom, the data word reconstruction module comprising a third data output which is connected to said data connection and to said data channel, said data channel also comprising a second data connection for external data input/output, wherein each computer module further comprises: a second data channel which is connected in series with said second data connection and which comprises a third data connection; an input/output memory module which is connected, at least when a generator matrix (G i ) of the associated reducing encoder maps a data bit on more than one code bit to the second data channel by way of a second nonreducing encoder and a third data input and a decoder which is associated with the second encoder, the following relations existing between the generator matrix (G i ) of a reducing encoder, at least in so far as this encoder maps a data bit on more than one code bit, the generator matrix (G i *) of the second encoder, and the generator matrix (G i * -1 ) of the decoder: [G.sub.i *]·[G.sub.i *.sup.-1 ]=[I], the identity matrix; [F]=[G.sub.i ]·[G.sub.i *.sup.-1 ], in which each column of [F] written as consisting of bits, comprises at the most one "1" and for the remainder exclusively "zeroes", each row of [F] containing at least one "1", so that in the relevant computer module a bit of a data word encoded in the input/output memory is mapped on at the most one bit of the code symbol which can be formed from that data word.
Claim 2
Dependent Claim 460 words
A multiprocessor computer system, comprising n synchronously controlled parallel operating computer modules, each of which is localized in its own fault isolation area, each computer module comprising: a processor module; a data channel which is connected to a data connection of the processor module; a reducing encoder which is connected to the data channel in order to form a code symbol from a data word received from said data channel so that said encoders of the modules processing said data word form, on the basis of a data word comprising k data symbols, a code word consisting of k+1≦n<3k code symbols of a code incorporating a simultaneous correction capability in at least two code symbols; a memory module comprising a first data input which is connected to a first data output of the associated reducing encoder, and to a relevant second data output of each memory module of the respective computer modules; and a data word reconstruction module which is connected via an interconnection network, to the relevant second data outputs of the memory modules of the various computer modules in order to receive a relevant code symbol of a code word from each computer module in order to construct a data word therefrom, the data word reconstruction module comprising a third data output which is connected to said data connection and to said data channel, said data channel also comprising a second data connection for external data input/output, wherein each computer module further comprises: a second data channel which is connected in series with said second data connection and which comprises a third data connection; an input/output memory module which is connected, at least when a generator matrix (G i ) of the associated reducing encoder maps a data bit on more than one code bit to the second data channel by way of a second nonreducing encoder and a third data input and a decoder which is associated with the second encoder, the following relations existing between the generator matrix (G i ) of a reducing encoder, at least in so far as this encoder maps a data bit on more than one code bit, the generator matrix (G i *) of the second encoder, and the generator matrix (G i * -1 ) of the decoder: [G.sub.i *]·[G.sub.i *.sup.-1 ]=[I], the identity matrix; [F]=[G.sub.i ]·[G.sub.i *.sup.-1 ], in which each column of [F] written as consisting of bits, comprises at the most one "1" and for the remainder exclusively "zeroes", each row of [F] containing at least one "1", so that in the relevant computer module a bit of a data word encoded in the input/output memory is mapped on at the most one bit of the code symbol which can be formed from that data word.
Claim 3
Dependent Claim 32 words
A multiprocessor computer system as claimed in claim 1, characterized in that the error correction capability of the code comprises at least one arbitrary error vector in at least one code symbol.
Claim 4
Dependent Claim 36 words
A multiprocessor computer system as claimed in claim 1 or 2, wherein a data word reconstruction has at least two modes of operation with different correction capabilities and said system includes means to select a mode.
Claim 5
Dependent Claim 24 words
A multiprocessor computer system as claimed in claim 1 or 2, characterized in that each row of the matrix [F] contains exactly one "1".
Claim 6
Dependent Claim 24 words
A multiprocessor computer system as claimed in claim 1 or 2, characterized in that each column of the matrix [F] contains exactly one "1".
Claim 7
Dependent Claim 54 words
A multiprocessor computer system as claimed in claim 1 or 2, wherein the reducing encoder maps at least one data bit on at least two code bits, the combination formed by the decoder and the reducing encoder mapping each bit from the input/output memory on at the most one bit in the memory module.

References Cited (Backward Citations)

US4395768A Cited
US4402045A Cited
US4438494A Cited
US4512020A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1989-12-29 1990-06-30 1990-12-30 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1993-12-29 1994-06-30 1994-12-30 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 1997-12-29 1998-06-30 1998-12-30 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag