Patent US4251864A successfully refreshed from Google Patents.
US4251864A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Apparatus and method in a data processing system for manipulation of signal groups having boundaries not coinciding with boundaries of signal group storage space
Assignee: Bull HN Information Systems Inc
•
Filing: 1979-01-02
•
Granted: 1981-02-17
•
Expires: 1999-01-02
Abstract
Abstract In a data processing system wherein memory space in a memory unit is divided into addressable locations capable of storing a group of signals of predetermined number called signal words, and wherein an entire word or groups of entire words are exchanged between the memory unit and a central processing unit, more efficient operation of the data processing unit can be obtained if groups of related signals called operands can be stored consecutively in the addressable locations without regard to the word boundaries. Thus, operand boundaries can have arbitrary positions in boundary words. When a word containing an operand boundary is transferred to the central processing unit, non-operand data is also transferred with the word. The non-operand data occurring in the boundary words is removed from the operand signal group and stored in the central processing unit. After manipulation of the operand by the central processing unit, the non-operand data is re-inserted in the boundary words in the signal positions previously occupied and the word group containing the manipulation or resulting operand is stored in the memory location from which it was originally removed.
Inventors
- 👤 Jerry L. Kindell
- 👤 Richard T. Flynn
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-26 05:08
CPC Classifications
G; G06; G06F; G06F12/00; G06F12/02; G06F12/04
Claims Analysis
Total Claims: 9
Claim 1
Independent Claim
255 words
In a data processing unit including a memory unit and a central processing unit, wherein related groups of data signals called operands are stored in said memory unit and transferred in said data processing unit in groups of data signals of predetermined size called words, wherein operand boundary words which can include non-operand data constitutes portions of said words, wherein a group of words containing at least one of said operand boundary words are transferred from said memory unit to said central processing unit for manipulation determined by an instruction, said instruction identifying an address of words containing said operand boundary words and identifying non-operand data in words included in said operand boundary words, wherein an operand resulting from said at least one manipulation is to replace said manipulated operand in a word in said memory unit, apparatus for preserving said non-operand data comprising: first means for selecting and storing non-operand data of a first word of said word group; second means for selecting and storing and non-operand data of a last word of said word group; third means for temporarily storing words including said resulting operand; and means for combining said first non-operand data in said first storage means with a first word of said resulting operand word group when said resulting first word is in said third storage means; said combining means combining said second non-operand data in said second storage means with a last word of said resulting operand word group when said resulting last word is in said third storage means.
Claim 2
Dependent Claim
255 words
In a data processing unit including a memory unit and a central processing unit, wherein related groups of data signals called operands are stored in said memory unit and transferred in said data processing unit in groups of data signals of predetermined size called words, wherein operand boundary words which can include non-operand data constitutes portions of said words, wherein a group of words containing at least one of said operand boundary words are transferred from said memory unit to said central processing unit for manipulation determined by an instruction, said instruction identifying an address of words containing said operand boundary words and identifying non-operand data in words included in said operand boundary words, wherein an operand resulting from said at least one manipulation is to replace said manipulated operand in a word in said memory unit, apparatus for preserving said non-operand data comprising: first means for selecting and storing non-operand data of a first word of said word group; second means for selecting and storing and non-operand data of a last word of said word group; third means for temporarily storing words including said resulting operand; and means for combining said first non-operand data in said first storage means with a first word of said resulting operand word group when said resulting first word is in said third storage means; said combining means combining said second non-operand data in said second storage means with a last word of said resulting operand word group when said resulting last word is in said third storage means.
Claim 3
Dependent Claim
54 words
The apparatus of claim 1, wherein after storage of said non-operand data of said first word in said first means, each additional word of said word group is stored in said second storage means, said non-operand data of said last word remaining in said second storage means until combined with said last resulting word.
Claim 4
Dependent Claim
26 words
The apparatus of claim 1, wherein each of said first and second storage means includes a switch for selectively activating data signals of said storage means.
Claim 5
Dependent Claim
180 words
In a data processing unit including a memory unit and a central processing unit, wherein an instruction identifies a location in said memory unit storing a first operand utilized in an instruction for manipulation by said central processing unit, and wherein a group of data signals of predetermined size called words includes said first operand and also non-operand data in a first word and in a last word of said word group, a method for preserving said non-operand data when an operand resulting from said manipulation is to be stored in said memory unit location comprising the steps of: storing in a first storage means said first word of said word group; storing in a second storage means said last word of said word group; after obtaining a resultant operand as a result of execution of said instruction; combining said non-operand data of said first word with a first word of a word group which includes said resultant operand; and combining said non-operand data of said last word with a last word of said word group includes said resultant operand.
Claim 6
Dependent Claim
180 words
In a data processing unit including a memory unit and a central processing unit, wherein an instruction identifies a location in said memory unit storing a first operand utilized in an instruction for manipulation by said central processing unit, and wherein a group of data signals of predetermined size called words includes said first operand and also non-operand data in a first word and in a last word of said word group, a method for preserving said non-operand data when an operand resulting from said manipulation is to be stored in said memory unit location comprising the steps of: storing in a first storage means said first word of said word group; storing in a second storage means said last word of said word group; after obtaining a resultant operand as a result of execution of said instruction; combining said non-operand data of said first word with a first word of a word group which includes said resultant operand; and combining said non-operand data of said last word with a last word of said word group includes said resultant operand.
Claim 7
Dependent Claim
155 words
In a data processing system wherein a first operand is stored in a memory subsystem in a group of data words, said data words comprising a predetermined number of signals wherein first operand boundary words of said data words can include non-operand data, and wherein a second operand resulting from execution of an instruction utilizing said first operand is to replace said first operand in said memory subsystem, apparatus for preserving said non-operand data after execution of said instruction, comprising: means for storing said boundary words including non-operand data; means for temporarily storing each word of a group of words including said second operand; and means for combining said stored non-operand data of said first boundary words with said second operand, said combined data words having resulting operand data in the same bit positions in said combined boundary words as the bit positions of said first operand boundary words in said group of data words.
Claim 8
Dependent Claim
155 words
In a data processing system wherein a first operand is stored in a memory subsystem in a group of data words, said data words comprising a predetermined number of signals wherein first operand boundary words of said data words can include non-operand data, and wherein a second operand resulting from execution of an instruction utilizing said first operand is to replace said first operand in said memory subsystem, apparatus for preserving said non-operand data after execution of said instruction, comprising: means for storing said boundary words including non-operand data; means for temporarily storing each word of a group of words including said second operand; and means for combining said stored non-operand data of said first boundary words with said second operand, said combined data words having resulting operand data in the same bit positions in said combined boundary words as the bit positions of said first operand boundary words in said group of data words.
Claim 9
Dependent Claim
37 words
The apparatus of claim 5 wherein said boundary word storage means includes means for storing a first word of said first operand word group, and means for storing a last word of said first operand word group.
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) | 1984-02-17 | 1984-08-18 | 1985-02-17 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1988-02-17 | 1988-08-18 | 1989-02-17 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1992-02-17 | 1992-08-18 | 1993-02-17 | $7700.00 | Window Closed / Lapsed |