Patent US4491915A successfully refreshed from Google Patents.
US4491915A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Multiprocessor-memory data transfer network
Assignee: Lockheed Martin Corp
•
Filing: 1982-11-30
•
Granted: 1985-01-01
•
Expires: 2002-11-30
Abstract
Abstract A data transfer system for transferring words of data in either direction between a main memory and N processors includes N registers, each of N words (or multiples of N words) capacity. Each register is connected to its associated processor to transmit data words serially at a given rate therebetween and connected to the memory to transmit N words (or multiples of N words) in parallel therebetween in succession at a rate which allows the uninterrupted serial word transfer at rate X.
Inventors
- 👤 Timothy J. Forquer
- 👤 Hungwen Li
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-29 15:10
CPC Classifications
G; G06; G06F; G06F15/00; G06F15/16; G06F15/163; G06F15/167; G06F13/00; G06F13/14; G06F13/16; G06F13/1605; G06F13/1652; G06F13/1663; G06F13/20; G06F13/28
Claims Analysis
Total Claims: 17
Claim 1
Independent Claim
126 words
A system for concurrently transferring words of data between a data storage memory and a plurality N of data procesors, comprising in combination: means producing timed control signals; and N buffer means, each buffer means coupled between a different one of said processors and said memory for temporarily storing a number M of words, M being proportional to N and responsive to said control signals for transferring said words serially between itself and its associated one of said processors at a transfer rate X and for transferring, in parallel, M of said words at a time between itself and said memory, the transfer between the N buffer means and memory occurring in succession at a rate which allows uninterrupted said serial word transfer at rate X.
Claim 2
Independent Claim
126 words
A system for concurrently transferring words of data between a data storage memory and a plurality N of data procesors, comprising in combination: means producing timed control signals; and N buffer means, each buffer means coupled between a different one of said processors and said memory for temporarily storing a number M of words, M being proportional to N and responsive to said control signals for transferring said words serially between itself and its associated one of said processors at a transfer rate X and for transferring, in parallel, M of said words at a time between itself and said memory, the transfer between the N buffer means and memory occurring in succession at a rate which allows uninterrupted said serial word transfer at rate X.
Claim 3
Dependent Claim
84 words
The combination as set forth in claim 1 wherein said memory is an addressable memory and further including N address storing means, each coupled between a different one of said processors and said memory, and responsive to said control signals for receiving, from its associated processor, address information for addresses in memory where words are located and responsive to said control signal for thereafter addressing said memory using stored address information to control the transfer of said words between said buffer means and memory.
Claim 4
Dependent Claim
38 words
The combination as set forth in claim 1 wherein at least one of said buffer means includes means for accepting data words from said memory and for transferring said data words to its associated one of said processors.
Claim 5
Dependent Claim
36 words
The combination as set forth in claim 1 wherein at least one of said buffer means includes means for accepting data from its associated one of said processors and for transferring data words to said memory.
Claim 6
Dependent Claim
38 words
The combination as set forth in claim 2 wherein at least one of said buffer means includes means for accepting data words from said memory and for transferring said data words to its associated one of said processors.
Claim 7
Dependent Claim
36 words
The combination as set forth in claim 2 wherein at least one of said buffer means includes means for accepting data from its associated one of said processors and for transferring data words to said memory.
Claim 8
Dependent Claim
57 words
The combination as set forth in claim 1 wherein each word is comprised of Y bits and wherein said memory comprises Y portions each storing a different bit of each of the words stored therein and wherein each buffer means comprises Y registers, each storing a different one of the Y bits of each word stored therein.
Claim 9
Dependent Claim
23 words
The combination as set forth in claim 1 wherein said buffer means are all connected to said memory by a common multiconductor bus.
Claim 10
Dependent Claim
23 words
The combination as set forth in claim 2 wherein said buffer means are all connected to said memory by a common multiconductor bus.
Claim 11
Dependent Claim
23 words
The combination as set forth in claim 3 wherein said buffer means are all connected to said memory by a common multiconductor bus.
Claim 12
Dependent Claim
23 words
The combination as set forth in claim 4 wherein said buffer means are all connected to said memory by a common multiconductor bus.
Claim 13
Dependent Claim
23 words
The combination as set forth in claim 7 wherein said buffer means are all connected to said memory by a common multiconductor bus.
Claim 14
Dependent Claim
24 words
The combination as set forth in claim 2 wherein all said address storing means are coupled to said processors by a common multiconductor bus.
Claim 15
Dependent Claim
24 words
The combination as set forth in claim 5 wherein all said address storing means are coupled to said processors by a common multiconductor bus.
Claim 16
Dependent Claim
24 words
The combination as set forth in claim 6 wherein all said address storing means are coupled to said processors by a common multiconductor bus.
Claim 17
Dependent Claim
24 words
The combination as set forth in claim 9 wherein all said address storing means are coupled to said processors by a common multiconductor bus.
References Cited (Backward Citations)
GB773457A
Cited
US3317898A
Cited
US3771137A
Cited
US4151592A
Cited
US4171536A
Cited
US4214305A
Cited
US4209840A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1988-01-01 | 1988-07-02 | 1989-01-01 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1992-01-01 | 1992-07-02 | 1993-01-01 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1996-01-01 | 1996-07-02 | 1997-01-01 | $7700.00 | Window Closed / Lapsed |