← Back to Patent Explorer
EP0229932A2 Expired / Lapsed EP ⏱️ 0.0 years remaining

High-capacity memory for multiprocessor systems

Assignee: Leonardo SpA
•
Filing: 1986-11-27
•
Granted: —
•
Expires: 2006-11-27
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A high-capacity memory (22) accessible by at least two external agents (12,13) and comprising means (168, 168', 171, 171', 182, 161) for addressing the aforementioned memory (22, 150) independently of the addresses of each of the aforementioned agents (12,13).

Inventors

  • 👤 Giuseppe Barbagelata
  • 👤 Bruno Conterno
  • 👤 Fernando Pesce

Bibliographic Details

Application Number —
Jurisdiction EP
Data Source google_patents
Last Synchronized 2026-10-24 12:48
CPC Classifications
G; G06; G06F; G06F12/00; G06F12/14; G06F12/1458; G06F12/1483; G06F12/02; G06F12/0223; G06F12/0284; G06F12/0292

Claims Analysis

Total Claims: 13
Claim 1
Independent Claim 52 words
1) - A high-capacity memory (22), characterised by the fact that it is accessible by at least two external agents (17, 18), and that it comprises means (168, 168', 171, 171', 161, 182) for addressing the said memory (22) independently of the addresses emitted by each of the said agents (17, 18).
Claim 2
Dependent Claim 52 words
1) - A high-capacity memory (22), characterised by the fact that it is accessible by at least two external agents (17, 18), and that it comprises means (168, 168', 171, 171', 161, 182) for addressing the said memory (22) independently of the addresses emitted by each of the said agents (17, 18).
Claim 3
Dependent Claim 99 words
2) - A memory as claimed in Claim 1, characterised by the fact that, for each group of address data from the said agents (17, 18), the said means comprise match coding means (168, 168') for a first part (165, 165') of the said group of address data; the remaining second part (173, 173') of the said group of address data being reunited with the said part obtained from the said match coding means (168, 168'); and the complete said group of address data being selected by selecting means (161, 182) for supply to a main memory block (150).
Claim 4
Dependent Claim 41 words
3) - A memory as claimed in Claim 2, characterised by the fact that the said first part (165, 165') of the said group of address data sent to the said match coding means (168, 168') is the most significant part.
Claim 5
Dependent Claim 130 words
4) - A memory as claimed in Claim 3, characterised by the fact that the said main memory block (150) comprises a memory of 2 N words divided conceptually into 2N-K segments of 2 K words each, so that the physical address of any one word consists of N bits, of which N-K indicate the said segment, and K the word within the said segment; the said second part (173, 173') of the said address data supplying the said K bits, and the said first part (165, 165') of the said address data consisting of (M-K) bits, where the said group of address data supplied by the said agent (17, 18) is of M bits; the said match coding means (168, 168') supplying (N-K) address bits for the said segment.
Claim 6
Dependent Claim 63 words
5) - A memory as claimed in Claim 4, characterised by the fact that the said match coding means (168, 168') comprise a number of words equal to that (2 ) addressable by the agent (17, 18) divided by the size (2 K ) of the said segments; the said words having (N-K) bits, to which are added additional coding and/or control bits.
Claim 7
Dependent Claim 34 words
6) - A memory as claimed in one of the foregoing Claims from 2 to 5, characterised by the fact that the said match coding means (168, 168') comprise read and write memory means.
Claim 8
Dependent Claim 51 words
7) - A memory as claimed in one of the foregoing Claims from 2 to 6, characterised by the fact that the said selecting means (182, 161) are controlled by signals from the said agents (17, 18) and/or by coding and control signals from the said match coding means (168, 168').
Claim 9
Dependent Claim 48 words
8) - A memory as claimed in one of the foregoing Claims from 2 to 7, characterised by the fact that the read or write data from the said main memory block (150) is exchanged with the said agents (17, 18) via registers (154, 156; 155 , 157).
Claim 10
Dependent Claim 34 words
9) - A memory as claimed in one of the foregoing Claims, characterised by the fact that the capacity of the said memory (22) exceeds the addressing capacity of the said agents (17, 18).
Claim 11
Dependent Claim 24 words
10) - A memory as claimed in one of the foregoing Claims, characterised by the fact that the said agents (17, 18) comprise processors.
Claim 12
Dependent Claim 37 words
11) - A multiprocessor system comprising at least one group of common communication lines (12, 13), characterised by the fact that it comprises at least one high-capacity memory (22) as claimed in one of the foregoing Claims.
Claim 13
Dependent Claim 34 words
12) - A system as claimed in Claim 11, characterised by the fact that the said memory (22) is connected to at least two of the said groups of common communication lines (12, 13).

References Cited (Backward Citations)

No citation records indexed.

USPTO Annuity & Maintenance Windows

Maintenance schedule is calculated for granted US utility patents.

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag