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

Scientific processor vector file organization

Assignee: Unisys Corp
•
Filing: 1986-07-30
•
Granted: —
•
Expires: 2006-07-30
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract An improved memory organization for a pipelined scien. tific vector processor is disclosed. It provides an efficient vectorfile organization with a data transfer capability which is adequate to support multiple program execution pipelines with the processor, It enables the multiple pipelines to simultaneously access various blocks of the overall vector file, The invention provides a novel manner of segmenting the file storage and of addressing the various elements of the segments. it also provides a unique method of granting and maintaining memory access to the vector files. The vector files themselves are programmable registers. There are sixteen (16) files of vector registers and each file has space for sixty-four 36-bit words. Each file may be formatted as single or double word elements. A preferred embodiment of the scientific processor using this vector file organization is shown. it has six independent instruction execution pipelines. They all access the vector files for either source (read) operands or destination (write) operands or both. Any combination of execution pipes can be active at any given time. They are initiated into execution in a serial manner depending on the instructions encountered in a program. The Vector Files are organized into eight independent blocks. Each block has a random access memory (RAM), an address register and a write data register. Each of the blocks can do a read or write operation each clock cycle. Each block holds certain pairs of words of each of the 16 files. The first block has words 0, 1, 16, 17, 32, 33, 48 and 49. The next block has the succeeding word pairs (each eighth pair). The pattern continues for the remaining 6 blocks. Only one copy of the vector files is usually shown, however, two are actually provided. These copies, while termed the primary and secondary vector files, are equal in capability, The purpose of the two copies is to allow reading pairs of operands, as required by most instructions. For example, during a vector multiply instruction (executed by multiply pipeline) the multiplicand is read from the primary copy and the multiplier is read from the secondary copy. The read registers are associated with a pipeline rather than with a vector file block. Writing of the corresponding multiply product element into both copies occurs nine clock cycles later. A time slot management mechanism included in the Vector File organization consists of 8 registers and performs the following functions. It allocates and reserves access to the Vector Files by the execution pipe for each individual instruction execution. It maintains the reservation and its purpose (read or write) until the instruction is completed. It forms or selects Vector File read or write address for both primary and secondary copies. The address consists of the appropriate 4-bit file number plus certain other fields. Once formed, an address is used to reference all 8 blocks, in what is termed a pass. It selectively initiates one of 5 counters used to select read data from the 8 RAMS. Finally, it selectively initiates one of 6 counters used to route write data to 1 of the 8 write data registers. The 8 time slot registers (0-7) are connected together in a serial loop. All the reservation data is advanced for register to register each clock cycle. As each reservation is in register 0 it is used to form or select a Vector File address. Typically a reservation is maintained for 4 passes or 32 clock cycles and is released by being cleared upon completion of the instruction.

Inventors

  • 👤 Archie E. Lahti

Bibliographic Details

Application Number —
Jurisdiction EP
Data Source google_patents
Last Synchronized 2026-10-29 23:18
CPC Classifications
G; G06; G06F; G06F15/00; G06F15/76; G06F15/80; G06F15/8053; G06F15/8061

Claims Analysis

Total Claims: 20
Claim 1
Independent Claim 117 words
A scientific vector processor including a plurality of independent instruction pipelines and a vector file memory organisation, characterised in that each file (1300) comprises first and second similar pluralities (1302,1304) each of n independent memory segments (1350, 1353 etc.), each of the segments comprising a plurality of memory elements (256 x 4 bit ram) and being arranged to store corresponding pairs of words in such a way that the elements of the first segment (1350) hold the first word pair, the n+l word pair, the 2n+l word pair, and so on, the elements of the second segment (1353) hold the second word pair, the n+2 word pair, the 2n+2 word pair, and similarly for the remaining segments.
Claim 2
Dependent Claim 117 words
A scientific vector processor including a plurality of independent instruction pipelines and a vector file memory organisation, characterised in that each file (1300) comprises first and second similar pluralities (1302,1304) each of n independent memory segments (1350, 1353 etc.), each of the segments comprising a plurality of memory elements (256 x 4 bit ram) and being arranged to store corresponding pairs of words in such a way that the elements of the first segment (1350) hold the first word pair, the n+l word pair, the 2n+l word pair, and so on, the elements of the second segment (1353) hold the second word pair, the n+2 word pair, the 2n+2 word pair, and similarly for the remaining segments.
Claim 3
Dependent Claim 20 words
A scientific vector processor according to claim 1 in which each of the said segments is a separate programmable register.
Claim 4
Dependent Claim 60 words
A scientific vector processor according to claim 1 or claim 2 further including a time slot management mechanism (1124) arranged to allocate memory access by the instruction pipelines (1600, 1700, 1800) to the memory in such a way that one pipeline can address one of the pluralities of memory segments while another simultaneously addresses the other plurality of memory segments.
Claim 5
Dependent Claim 219 words
4 . In a scientific vector processor having multiple independent instruction execution pipelines, a vector file memory organization, wherein each file comprises: a first plurality of n independent memory segment means; each of said first plurality of n independent memory segment means having a plurality of addressable memory elements; a second plurality of n independent memory segment means; each of said second plurality of n independent memory segment means having a plurality of addressable memory elements corresponding to the plurality of addressable memory elements of said first plurality; each of said first and each of said second plurality of n independent memory segments having a means coupled thereto for reading from and means coupled thereto for writing into each of said n memory segments; and each of said first plurality and each of said second plurality of n independent memory segments capable of storing certian corresponding pairs of words such that the first segment of each of said first and second plurality of n segments holds the first word pair, the (n + 1) word pair the 2 (n + 1) word pair, the 3 (n + 1) word pair, the 4 (n + 1) word pair etc. until all of the n segments of said and second plurality of n independent memory segments has reached its storage capacity.
Claim 6
Dependent Claim 219 words
4 . In a scientific vector processor having multiple independent instruction execution pipelines, a vector file memory organization, wherein each file comprises: a first plurality of n independent memory segment means; each of said first plurality of n independent memory segment means having a plurality of addressable memory elements; a second plurality of n independent memory segment means; each of said second plurality of n independent memory segment means having a plurality of addressable memory elements corresponding to the plurality of addressable memory elements of said first plurality; each of said first and each of said second plurality of n independent memory segments having a means coupled thereto for reading from and means coupled thereto for writing into each of said n memory segments; and each of said first plurality and each of said second plurality of n independent memory segments capable of storing certian corresponding pairs of words such that the first segment of each of said first and second plurality of n segments holds the first word pair, the (n + 1) word pair the 2 (n + 1) word pair, the 3 (n + 1) word pair, the 4 (n + 1) word pair etc. until all of the n segments of said and second plurality of n independent memory segments has reached its storage capacity.
Claim 7
Dependent Claim 48 words
5 . The invention as set forth in claim 4 wherein each of said first plurality and each of said second plurality of n independent memory segments includes a random access memory (RAM) an address register coupled thereto and a write data register coupled to said address register.
Claim 8
Dependent Claim 23 words
6 . The invention as set forth in claim4 wherein each of said plurality of addressable memory elements is a separate programmable register.
Claim 9
Dependent Claim 62 words
The inventin as set forth in claim 4 wherein said first plurality of n independent memory segment means is a primary copy and said second plurality of n independent memory segment means is a secondary copy of identical information to that stored in said primary copy, and said first and second plurality of n independent memory segment means are of equal capability.
Claim 10
Dependent Claim 241 words
In a scientific vector processor having multiple independent instruction execution pipelines, a vector file memory organization, wherein each file comprises: a first plurality of n independent memory segment means; each of said first plurality of n independent memory segment means having a plurality of addressable memory elements; a second plurality of n independent memory segment means; each of said second plurality of n independent memory segment means having a plurality of addressable memory elements corresponding to the plurality of addressable memory elements of said first plurality; each of said first and each of said second plurality of n independent memory segments having a means coupled thereto for reading from and means coupled thereto for writing into each of said n memory segments; each of said first plurality and each of said second plurality of n independent memory segments capable of storing certian corresponding pairs of words such that the first segment of each of said first and second plurality of n segments holds the first word pair, the (n + 1) word pair the 2 (n + 1) word pair, the 3 (n + 1) word pair, the 4 (n + 1) word pair etc.; and a time slot management mechanism coupled to each of said first and said second plurality of n independent memory segments to allocable and maintain memory access by said multiple independent instruction execution pipelines to said first and said second plurality of n independent memory segments.
Claim 11
Dependent Claim 241 words
In a scientific vector processor having multiple independent instruction execution pipelines, a vector file memory organization, wherein each file comprises: a first plurality of n independent memory segment means; each of said first plurality of n independent memory segment means having a plurality of addressable memory elements; a second plurality of n independent memory segment means; each of said second plurality of n independent memory segment means having a plurality of addressable memory elements corresponding to the plurality of addressable memory elements of said first plurality; each of said first and each of said second plurality of n independent memory segments having a means coupled thereto for reading from and means coupled thereto for writing into each of said n memory segments; each of said first plurality and each of said second plurality of n independent memory segments capable of storing certian corresponding pairs of words such that the first segment of each of said first and second plurality of n segments holds the first word pair, the (n + 1) word pair the 2 (n + 1) word pair, the 3 (n + 1) word pair, the 4 (n + 1) word pair etc.; and a time slot management mechanism coupled to each of said first and said second plurality of n independent memory segments to allocable and maintain memory access by said multiple independent instruction execution pipelines to said first and said second plurality of n independent memory segments.
Claim 12
Dependent Claim 45 words
The invention as set forth in claims wherein each of said first plurality and each of said second plurality of n independent memory segments includes a random access memory (RAM) an address register coupled thereto and a write data register coupled to said address register.
Claim 13
Dependent Claim 25 words
1 0 . The invention as set forth in claim 9 wherein each of said plurality of addressable memory elements is a separate programmable register.
Claim 14
Dependent Claim 61 words
The inventin as set forth in claim 10 wherein said first plurality of n independent memory segment-means is a primary copy and said second plurality of n independent memory segment means is a secondary copy of identical information to that stored in said primary copy, and said first and second plurality of n independent memory segment means are of equal capability.
Claim 15
Dependent Claim 52 words
The invention as set forth in claim 11 wherein said time slot management mechanism includes means for forming and selecting read and write addresses stored in said address register and in said write data register and for applying said addresses to said primary and said secondary copies of the contents stored therein.
Claim 16
Dependent Claim 212 words
13, In a scientific vector processor having multiple independent instruction execution pipelines, a vector file memory organization, wherein each file comprises: a first plurality of n independent memory segment means; each of said first plurality of n independent memory segment means having a plurality of addressable memory elements; a second plurality of n independent memory segment means; each of said second plurality of n independent memory segment means having a plurality of addressable memory elements corresponding to the plurality of addressable memory elements of said first plurality; each of said first and each of said second plurality of n independent memory segments having a means coupled thereto for reading from and means coupled thereto for writing into each of said n memory segments; and each of said first plurality and each of said second plurality of n independent memory segments capable of storing certian corresponding pairs of words such that the first segment of each of said first and second plurality of n segments holds the first word pair, the (n + I) word pair the 2 (n + 1) word pair, the 3 (n + 1) word pair, the 4 (n + 1) word pair etc. of said and second plurality of n independent memory segments has reached its storage capacity.
Claim 17
Dependent Claim 212 words
13, In a scientific vector processor having multiple independent instruction execution pipelines, a vector file memory organization, wherein each file comprises: a first plurality of n independent memory segment means; each of said first plurality of n independent memory segment means having a plurality of addressable memory elements; a second plurality of n independent memory segment means; each of said second plurality of n independent memory segment means having a plurality of addressable memory elements corresponding to the plurality of addressable memory elements of said first plurality; each of said first and each of said second plurality of n independent memory segments having a means coupled thereto for reading from and means coupled thereto for writing into each of said n memory segments; and each of said first plurality and each of said second plurality of n independent memory segments capable of storing certian corresponding pairs of words such that the first segment of each of said first and second plurality of n segments holds the first word pair, the (n + I) word pair the 2 (n + 1) word pair, the 3 (n + 1) word pair, the 4 (n + 1) word pair etc. of said and second plurality of n independent memory segments has reached its storage capacity.
Claim 18
Dependent Claim 48 words
14 . The invention as set forth in claim 13 wherein each of said first plurality and each of said second plurality of n independent memory segments includes a random access memory (RAM) an address register coupled thereto and a write data register coupled to said address register.
Claim 19
Dependent Claim 22 words
The invention as set forth in claim 13 wherein each of said plurality of addressable memory elements is a. separate programmable register.
Claim 20
Dependent Claim 64 words
16 . The inventin as set forth in claim 13 wherein said first plurality of n independent memory segment means is a primary copy and said second plurality of n independent memory segment means is a secondary copy of identical information to that stored in said primary copy, and said first and second plurality of n independent memory segment means are of equal capability.

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