US5197135A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Memory management for scalable compound instruction set machines with in-memory compounding
Assignee: International Business Machines Corp
•
Filing: 1990-06-26
•
Granted: 1993-03-23
•
Expires: 2010-06-26
Abstract
Abstract A digital computer system is described which is capable of processing 2 or more computer instructions in parallel and which has the capability of generating compounding tag information for those instructions, the compounding tag information being associated with instructions for the purpose of indicating groups of instructions which are to be concurrently executed. A compounding tag has a value which indicates the size of the group of instructions which are to be concurrently executed. The computer system includes a hierarchially-arranged memory which provides instructions to a CPU for execution. The instructions are compounded in the memory, and provision is made in the memory for storage of their compounding tags. In the event of modification of an instruction in memory, the invention provides for reduction of the value of the compounding tags for the modified instruction and instructions which are capable of being compounded with the modified instruction or for generation of new tag values for the modified instruction and instructions which are adjacent it in memory.
Inventors
- 👤 Richard J. Eickemeyer
- 👤 Stamatis Vassiliadis
- 👤 Bartholomew Blaner
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-05 01:02
CPC Classifications
G; G06; G06F; G06F9/00; G06F9/06; G06F9/30; G06F9/38; G06F9/3802; G06F9/3808; G06F9/30145; G06F9/30149; G06F9/30152; G06F9/3836; G06F9/3853
Claims Analysis
Total Claims: 18
Claim 1
Independent Claim
138 words
In a computer system capable of concurrently executing up to N instructions in a sequence of scalar instructions, the sequence including compounding tags associated with the scalar instructions, the compounding tags having values conditioned to indicate how many instructions are to be concurrently executed, a mechanism for managing compounding tag values of scalar instructions which are stored in a real memory of the computer system, the mechanism comprising: a merging means connected to the real memory for merging a modified instruction from the real memory with non-modified instructions in the real memory; and a tag reduction unit connected to the merging means and to the real memory for reducing the values of the compounding tags of the modified instruction and up to N-1 of the instructions in the real memory with which the modified instruction could be compounded.
Claim 2
Dependent Claim
138 words
In a computer system capable of concurrently executing up to N instructions in a sequence of scalar instructions, the sequence including compounding tags associated with the scalar instructions, the compounding tags having values conditioned to indicate how many instructions are to be concurrently executed, a mechanism for managing compounding tag values of scalar instructions which are stored in a real memory of the computer system, the mechanism comprising: a merging means connected to the real memory for merging a modified instruction from the real memory with non-modified instructions in the real memory; and a tag reduction unit connected to the merging means and to the real memory for reducing the values of the compounding tags of the modified instruction and up to N-1 of the instructions in the real memory with which the modified instruction could be compounded.
Claim 3
Dependent Claim
23 words
The mechanism of claim 1, wherein the tag reduction unit reduces the values of the compounding tags of the modified instruction to zero.
Claim 4
Dependent Claim
36 words
The mechanism of claim 2, wherein the tag reduction unit reduces the values of the compounding tags of all of the instructions in the real memory with which the modified instruction could be compounded to zero.
Claim 5
Dependent Claim
20 words
The mechanism of claim 1 wherein compounding tags are provided for every two bytes in the sequence of scalar instructions.
Claim 6
Dependent Claim
64 words
The mechanism of claim 1, wherein L is the length in bytes of the longest scalar instruction capable of being compounded with another scalar instruction, A is the number of bytes covered by a compounding tag, and wherein the tag reduction unit reduces the values of the compounding tags of up to (NL-A) bytes preceding the modified instruction in the sequence of scalar instructions.
Claim 7
Dependent Claim
24 words
The mechanism of claim 1, wherein the compounding tags are generated by an instruction compounding unit in the real memory of the computer system.
Claim 8
Dependent Claim
41 words
The mechanism of claim 6, wherein the real memory of the computer system includes a high-capacity, medium speed main memory and a small-capacity, high speed cache connected to the main memory, to the merging means and to the tag reduction unit.
Claim 9
Dependent Claim
29 words
The mechanism of claim 7, wherein the instruction compounding unit is connected to the main memory and to the cache for generating compounding tags for instructions in the cache.
Claim 10
Dependent Claim
26 words
The mechanism of claim 7, wherein the instruction compounding unit is connected to the main memory for generating compounding tags for instructions in the main memory.
Claim 11
Dependent Claim
129 words
In a computer system which receives a sequence of scalar instructions and includes compounding means for grouping instructions for concurrent execution by generating compounding tags for groups of up to N instructions, the compounding tags having values indicating the number of instructions in the groups, a method for managing the compounding tags of instructions stored in the real memory of the computer system, the method including the steps of: during operation of the computer system, modifying an instruction stored in the real memory; merging the instruction with instructions in the real memory; reducing the value of the compounding tag for the real instruction to zero; and reducing the values of the compounding tags of up to N-1 instructions in the real memory with which the instruction can be compounded.
Claim 12
Dependent Claim
129 words
In a computer system which receives a sequence of scalar instructions and includes compounding means for grouping instructions for concurrent execution by generating compounding tags for groups of up to N instructions, the compounding tags having values indicating the number of instructions in the groups, a method for managing the compounding tags of instructions stored in the real memory of the computer system, the method including the steps of: during operation of the computer system, modifying an instruction stored in the real memory; merging the instruction with instructions in the real memory; reducing the value of the compounding tag for the real instruction to zero; and reducing the values of the compounding tags of up to N-1 instructions in the real memory with which the instruction can be compounded.
Claim 13
Dependent Claim
25 words
The method of claim 10, wherein the step of reducing the values of the compounding tags of N-1 instructions includes reducing the value to zero.
Claim 14
Dependent Claim
75 words
The method of claim 10, wherein L is the length in bytes of the longest scalar instruction of the sequence which can be compounded with another scalar instruction of the sequence and A is the number of bytes associated with a compounding tag, the step of reducing the values of the compounding tags of N-1 instructions including reducing the values of the compounding tags of up to (NL-A) bytes in the sequence preceding the instruction.
Claim 15
Dependent Claim
20 words
The method of claim 12, wherein the values of the compounding tags of the (NL-A) bytes are reduced to zero.
Claim 16
Dependent Claim
123 words
In a computer system capable of concurrently executing up to N compounded instructions in a sequence of scalar instructions, the sequence including compounding tags which accompany the scalar instructions, the compounding tags having values conditioned to indicate how many instructions are compounded for concurrent execution, a mechanism for managing compounding tag values of scalar instructions which are stored in real memory of the computer system, the mechanism comprising: a merging means connected to the real memory for merging a modified instruction with non-modified instructions in the real memory; and a recompounding mechanism connected to the merging means and to the real memory for generating compounding tags for the modified instruction and at least N-1 non-modified instructions adjacent the modified instruction in real memory.
Claim 17
Dependent Claim
123 words
In a computer system capable of concurrently executing up to N compounded instructions in a sequence of scalar instructions, the sequence including compounding tags which accompany the scalar instructions, the compounding tags having values conditioned to indicate how many instructions are compounded for concurrent execution, a mechanism for managing compounding tag values of scalar instructions which are stored in real memory of the computer system, the mechanism comprising: a merging means connected to the real memory for merging a modified instruction with non-modified instructions in the real memory; and a recompounding mechanism connected to the merging means and to the real memory for generating compounding tags for the modified instruction and at least N-1 non-modified instructions adjacent the modified instruction in real memory.
Claim 18
Dependent Claim
57 words
The mechanism of claim 14, wherein L is the length in bytes of the longest instruction which can be compounded with another instruction and A is the number of bytes to which a compounding tag applies, the recompounding mechanism being for generating compounding tags for the modified instruction and at least (NL-A) bytes adjacent the modified instruction.
References Cited (Backward Citations)
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1996-03-22 | 1996-09-21 | 1997-03-23 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2000-03-22 | 2000-09-21 | 2001-03-23 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2004-03-22 | 2004-09-21 | 2005-03-23 | $7700.00 | Window Closed / Lapsed |