← Back to Patent Explorer
US5115500A Expired / Lapsed US ⏱️ 0.0 years remaining

Plural incompatible instruction format decode method and apparatus

Assignee: International Business Machines Corp
•
Filing: 1988-01-11
•
Granted: 1992-05-19
•
Expires: 2008-01-11
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract Architectural design of processor apparatus and its method of operation permit normally incompatible plural format process instructions for dissimilar processors to be placed intermixed in the instruction storage of a single machine but to be accurately decoded and executed properly regardless. Instructions in different formats which are normally incompatible which may have been written for different machine types are placed in predefined or segregated areas of the instruction store. Instructions are fetched and decoded by the processor for execution in a manner which uses portions of both the fetched-from address in the instruction store and the instruction itself. Decoding is thus determined in part by where in the instruction store the instruction resided when fetched, and the specific instruction itself. This approach is compatible with both ordinary processor architecture and with pipelined processor architectures.

Inventors

  • 👤 Larry D. Larsen

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-29 23:27
CPC Classifications
G; G06; G06F; G06F9/00; G06F9/06; G06F9/30; G06F9/38; G06F9/3818; G06F9/3822; G06F9/30145; G06F9/3016; G06F9/30167; G06F9/3017; G06F9/30174; G06F9/30181; G06F9/30185; G06F9/30196

Claims Analysis

Total Claims: 10
Claim 1
Independent Claim 106 words
A method of decoding for execution normally incompatible plural format process instructions into compatible single format execution codes in a processor, comprising steps of: fetching sequentially for decoding and execution said process instructions from a first addressable storage means; and decoding sequentially said fetched process instructions for execution in said processor by accessing execution codes stored in a second addressable storage means by utilizing at least a portion of said address in said first addressable storage means from which each said process instruction was fetched together with at least a portion of said fetched process instruction itself as an address for said second addressable storage means.
Claim 2
Independent Claim 106 words
A method of decoding for execution normally incompatible plural format process instructions into compatible single format execution codes in a processor, comprising steps of: fetching sequentially for decoding and execution said process instructions from a first addressable storage means; and decoding sequentially said fetched process instructions for execution in said processor by accessing execution codes stored in a second addressable storage means by utilizing at least a portion of said address in said first addressable storage means from which each said process instruction was fetched together with at least a portion of said fetched process instruction itself as an address for said second addressable storage means.
Claim 3
Dependent Claim 30 words
The method as described in claim 1, further comprising the step of: segregating by format said process instructions into separately identifiable groups of locations in said first addressable storage means.
Claim 4
Dependent Claim 29 words
The method as described in claim 1, further comprising the step of: retaining sequentially the addresses in said first addressable storage means from which said process instructions are fetched.
Claim 5
Independent Claim 73 words
The method as described in claims 1 or 2 or 3, further comprising a step of: arranging for access the execution codes for each said process instruction in said second addressable storage means, said arranging being done at locations therein that are determined by at least a portion of each said process instruction together with at least a portion of the address in said first addressable storage means wherein said process instruction resides.
Claim 6
Dependent Claim 101 words
A data processor having plural and compatible format instruction and decoding execution capability, comprising: a first addressable storage means acting as an instruction store, said instruction store containing instructions in two or more incompatible formats for execution in said processor; and a second addressable storage means acting as an execution code store, the contents of said execution code store being arranged to be addressed for each said instruction in said instruction store by an address utilizing at least a portion of said instruction together with at least a portion of the address in said instruction store at which said instruction resides.
Claim 7
Dependent Claim 101 words
A data processor having plural and compatible format instruction and decoding execution capability, comprising: a first addressable storage means acting as an instruction store, said instruction store containing instructions in two or more incompatible formats for execution in said processor; and a second addressable storage means acting as an execution code store, the contents of said execution code store being arranged to be addressed for each said instruction in said instruction store by an address utilizing at least a portion of said instruction together with at least a portion of the address in said instruction store at which said instruction resides.
Claim 8
Dependent Claim 103 words
A data processor having execution capability for plural and compatible format instructions, comprising: means for fetching sequentially for decoding and execution process instructions from a first addressable storage means; and means for decoding sequentially said fetched process instructions for execution in said processor, said means for decoding including decoding logic means, and decoding said fetched process instructions in said logic means by utilizing at least a portion of the address in said first addressable storage from which each said instruction was fetched together with at least a portion of said fetched process instruction itself as the logic input for said decoding logic means.
Claim 9
Dependent Claim 103 words
A data processor having execution capability for plural and compatible format instructions, comprising: means for fetching sequentially for decoding and execution process instructions from a first addressable storage means; and means for decoding sequentially said fetched process instructions for execution in said processor, said means for decoding including decoding logic means, and decoding said fetched process instructions in said logic means by utilizing at least a portion of the address in said first addressable storage from which each said instruction was fetched together with at least a portion of said fetched process instruction itself as the logic input for said decoding logic means.
Claim 10
Dependent Claim 29 words
Apparatus as described in claims 5 or 6 further comprising: means for retrieving sequentially the addresses in said first addressable storage means from which said process instructions are fetched.

References Cited (Backward Citations)

US4455602A Cited
US4499535A Cited
US4499604A Cited
US4514800A Cited
US4517642A Cited
US4782461A Cited
US4800523A Cited
US4791557A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1995-05-19 1995-11-18 1996-05-19 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1999-05-19 1999-11-18 2000-05-19 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2003-05-19 2003-11-18 2004-05-19 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag