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

Hybrid redundancy interface

Assignee: International Business Machines Corp
•
Filing: 1972-06-20
•
Granted: 1973-12-18
•
Expires: 1992-06-20
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract The interface disclosed herein is capable of operating in the TMR/S (triple modular redundancy with sparing), the comparison, and the simplex modes. The interface controls the interconnection between m1 , . . . , mn identical sending modules and M1 , . . . , Mn identical receiving modules. To this end, there are provided 1, . . . , n control registers which comprise 1, . . . , n bits and an (n+1)th control register which comprises a single bit RS. The register bits are employed to provide n2 forcing functions for the outputs d1, . . . , dn of the sending modules which are represented by the following logical equation: WHEREIN J IS THE BIT NUMBER, 1, . . . , N, I IS THE REGISTER NUMBER 1,..., N, THE SYMBOL N SIGNIFIES MODULO N AND V represents the OR function. The n2 forcing functions are respectively applied in sets of n viz., f1i, f2i, . . . , fni i 1,2, . . . , n to (1, . . . , n)th threshold function circuits, each of the latter circuits producing a ''''1'''' output when > OR = 2 of the inputs thereto are ''''1'''', the outputs of the (1, . . . , n)th threshold function circuits being applied to the M1, . . . , Mn)th receiving modules, respectively. From the register settings and the sending module outputs, there are generated pairs represented by the logical equation Cij (di V Rij V Rji V RS, djRijRji V Rs) for j i+1 (i 1, 3, 5, . . . , n-1) Cij (di V Rij V Rji, djRijRji) for j NOT = i+i WHEREIN THE IJ PAIR IN THE FIRST EQUATION CAN TAKE THE VALUES OF 13, 14, . . . , 1N, 24N, . . . , (N-2)N. From the pairs, (ij), there are generated register triggers having the following equations: A1 +/C12 Lambda M C13 M C14 Lambda M . . . Lambda M C1n A2 +/C21 Lambda M C23 Lambda M C24 Lambda M . . . Lambda M C2n An +/C1n Lambda M C2n Lambda M C3n Lambda M . . . Lambda M C(n 1)n WHEREIN THE SYMBOL Lambda M represents the morphic AND function called the RCCO in U.S. Pat. No. 3,559,167, the symbol + signifies the exclusive OR function on the pair of lines that are outputs of the morphic AND. The (A1, . . . ,An)th triggers are applied to the (1, . . . , n)th bits of the registers respectively, to switch the bits to the opposites of their initial binary states whereby, upon the generation of a register trigger Aj and the consequent switching of register bits R1j, . . . , Rnj to their opposite binary states, sending module mj is disconnected from operation. To operate the interface in the TMR/S mode, initially all of the bits of the (1, . . . , n)th registers are initially set to the 1 state and the bit of the (n+ 1)th register is set to the 0 state. To operate the interface in thE comparison mode, all the bits bearing the same numerical designation as the sending module which are to be compared in the registers bearing the same numerical designations as the sending modules which are to be compared are initially set to the 1 state with all of the other bits set to the 0 state. To operate in the simplex mode, all of the bits in the (1, . . . ,n)th registers except those bearing the same numerical designation as that borne by the register in which they are contained are set to the 0 state, the excepted bits being set to the 1 state. Also, in the simplex mode of operation, the bit of the n+1th register is set to the 1 state.

Inventors

  • 👤 W Carter
  • 👤 A Wadia

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-26 22:23
CPC Classifications
G; G06; G06F; G06F11/00; G06F11/07; G06F11/16; G06F11/18; G06F11/181; G06F11/183

Claims Analysis

Total Claims: 10
Claim 1
Independent Claim 94 words
An interface for controlling the interconnections between m1 , . . . , mn identical sending modules and M1 , . . . , Mn identical receiving modules comprising: 1 , . . . , n control registers, each of said registers comprising n bits, wherein Rij is a register bit; means for setting each of said bits to initial binary states; d1 , . . . , dn outputs from said sending modules, respectively; means for providing n2 forcing functions, each of said functions being a circuit represented by the following logical equation:
Claim 2
Dependent Claim 94 words
An interface for controlling the interconnections between m1 , . . . , mn identical sending modules and M1 , . . . , Mn identical receiving modules comprising: 1 , . . . , n control registers, each of said registers comprising n bits, wherein Rij is a register bit; means for setting each of said bits to initial binary states; d1 , . . . , dn outputs from said sending modules, respectively; means for providing n2 forcing functions, each of said functions being a circuit represented by the following logical equation:
Claim 3
Dependent Claim 94 words
An interface for controlling the interconneCtions between m1 , . . . , mn identical sending modules and M1 , . . . , Mn identical receiving modules comprising: 1 , . . . , n control registers, each of said registers comprising n bits, wherein Rin is a register bit; means for setting each of said bits to initial binary states; d1 , . . . , dn outputs from said sending modules, respectively; means for providing n2 forcing functions, each of said functions being a circuit represented by the following logical equation:
Claim 4
Dependent Claim 94 words
An interface for controlling the interconneCtions between m1 , . . . , mn identical sending modules and M1 , . . . , Mn identical receiving modules comprising: 1 , . . . , n control registers, each of said registers comprising n bits, wherein Rin is a register bit; means for setting each of said bits to initial binary states; d1 , . . . , dn outputs from said sending modules, respectively; means for providing n2 forcing functions, each of said functions being a circuit represented by the following logical equation:
Claim 5
Dependent Claim 105 words
An interface for controlling the interconnections between m1 , . . . , mn identical sending modules and M1 , . . . , Mn identical receiving modules comprising: 1 , . . . , n control registers, each of said registers comprising n bits, wherein Rij is a register bit; an (n+1)th control register comprising a single bit RS, means for initially setting each of said bits to initial binary states; d1 , . . . , dn outputs from said sending modules, respectively; means for providing n2 forcing functions, each of said forcing functions being a circuit represented by the following logical equation:
Claim 6
Dependent Claim 105 words
An interface for controlling the interconnections between m1 , . . . , mn identical sending modules and M1 , . . . , Mn identical receiving modules comprising: 1 , . . . , n control registers, each of said registers comprising n bits, wherein Rij is a register bit; an (n+1)th control register comprising a single bit RS, means for initially setting each of said bits to initial binary states; d1 , . . . , dn outputs from said sending modules, respectively; means for providing n2 forcing functions, each of said forcing functions being a circuit represented by the following logical equation:
Claim 7
Dependent Claim 82 words
An interface as defined in claim 3 wherein said interface is rendered operative in the TMR/S (triple modular redundancy with sparing) mode of operation in response to the setting, by said initial states setting means of all of the bits in said n registers to said 1 state and the setting of the bit of said (n+1)th register to said 0 state, the occurrence of (n-2) failures in said sending modules causing said interface to operate in the comparison mode of operation.
Claim 8
Dependent Claim 102 words
An interface as defined in claim 3 wherein said interface is rendered operative in the comparison mode of operation, i.e., the comparing of sending modules mh and mk of said 1 , . . . , n sending modules connected to Mh and Mk in response to the setting by said initial states setting means of bits h and k of said registers Rh and Rks to said 1 state and the remaining bits of said (1 , . . . , n)th registers to said 0 state, and the setting of the bit in said (n+1)th register to the 0 state.
Claim 9
Dependent Claim 81 words
An interface as defined in claim 3 wherein said interface is rendered operative in the simplex mode of operation by the setting to the 1 state of the respective bit in each of (1 , . . . , n)th registers having the number of its register, the setting of all of the other bits of said (1 , . . . , n)th registers to the 0 state, and by the setting of said (n+1)th register to the 1 state.
Claim 10
Dependent Claim 67 words
An interface as defined in claim 3 wherein said interface is operative in the mixed mode of operation, wherein said mixed mode takes the following form: said n sending modules are partitioned into sets of pg groups of q modules wherein pg is an arbitrarily chosen integer denoting the quantity of groups with q modules operative, said value of pg being chosen to satisfy the following equation:

References Cited (Backward Citations)

US3517171A Cited
US3665173A Cited
US3654603A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1976-12-17 1977-06-18 1977-12-18 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1980-12-17 1981-06-18 1981-12-18 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 1984-12-17 1985-06-18 1985-12-18 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag