Work Files Saved Searches
   My Account                                                  Search:   Quick/Number   Boolean   Advanced   Derwent    Help   


 The Delphion Integrated View

  Buy Now:   Buy PDF- 14pp  PDF  |   File History  |   Other choices   
  Tools:  Citation Link  |  Add to Work File:    
  View:  Expand Details   |  INPADOC   |  Jump to: 
  Go to:  Derwent  
 Email this to a friend  Email this to a friend 
       
Title: US5721854: Method and apparatus for dynamic conversion of computer instructions
[ Derwent Title ]


Country: US United States of America

View Images High
Resolution

 Low
 Resolution

 
14 pages

 
Inventor: Ebcioglu, Mahmut Kemal; Somers, NY
Groves, Randall Dean; Austin, TX

Assignee: International Business Machines Corporation, Armonk, NY
other patents from INTERNATIONAL BUSINESS MACHINES CORPORATION (280070) (approx. 44,393)
 News, Profiles, Stocks and More about this company

Published / Filed: 1998-02-24 / 1996-08-27

Application Number: US1996000703804

IPC Code: Advanced: G06F 9/318; G06F 9/38;
Core: more...
IPC-7: G06F 9/45;

ECLA Code: G06F9/318T; G06F9/38T;

U.S. Class: Current: 712/203; 712/215; 712/216; 712/E09.037; 712/E09.071; 717/149;
Original: 395/379; 395/706; 395/391; 395/392;

Field of Search: 395/379,382,384,389,390,583,733,391,392,706

Priority Number:
1996-08-27  US1996000703804
1995-02-16  US1995000390267
1993-11-02  US1993000146547

Abstract: An instruction cache design which converts a sequential instruction stream into a compound format in the instruction cache. The conversion from sequential instructions to compound instructions is performed by an instruction stream interpreter unit (ISU), which is placed between the instruction cache and main memory. The conversion process is performed when an instruction cache miss occurs. Each line in the instruction cache contains a single compound instruction. The format of this compound instruction is transparent to programmers and will vary depending on the number of execution units which are to be supported.

Attorney, Agent or Firm: Bailey, Wayne P. ; McBurney, Mark E. ; Henkler, Richard A. ;

Primary / Asst. Examiners: Lall, Parshotam S.; Vu, Viet

Maintenance Status: E2 Expired  Check current status
CC Certificate of Correction issued

INPADOC Legal Status: Show legal status actions

       
Related Applications:
Application Number Filed Patent Pub. Date  Title
US1995000390267 1995-02-16       
US1993000146547 1993-11-02       


       
Parent Case:     This is a continuation of application Ser. No. 08/390,267 filed Feb. 16, 1995 now abandoned, which is a continuation of Ser. No. 08/146,547 filed Nov. 2, 1993, now abandoned.

Family: None

First Claim:
Show all 2 claims
We claim:     1. A method of executing a computer program, compiled for sequential instruction execution, on a parallel instruction processing system, the method comprising the steps of:
  • retrieving, in response to a cache miss, a group of sequential instructions having a first and second conditional branch instruction, and first and second instructions that are dependent upon the first and second conditional branch instructions, respectively;
  • creating a compound instruction for parallel execution including the steps of:
    • inserting, for each of the first and second conditional branch instructions, a branch operation, and a branch address, into the compound instruction, the branch condition indicating the condition to be tested, and the branch address indicating where to proceed if the branch is executed;
    • inserting, for each of the first and second dependent instructions, a target register, a source operand, an operation indicator, and a dependency indicator, the operation indicator indicating the type of operation to be performed, the source operand indicating the register containing the data for the operation, the target register for containing the result of the operation, and the dependency indicator for indicating whether the execution of the instruction depends upon either the first or second conditional branch instruction; and
    • storing the address of the next sequential instruction;
  • storing the compound instruction in the cache; and
  • indexing the cache according to the address of the first sequential instruction in the compound instruction;
  • detecting an exception from the execution of one of the instructions in the compound instruction; and
  • executing, in response to the exception, the instructions stored in the compound instruction sequentially.


Background / Summary: Show background / summary

Drawing Descriptions: Show drawing descriptions

Description: Show description

Forward References: Show 40 U.S. patent(s) that reference this one

       
U.S. References: Go to Result Set: All U.S. references   |  Forward references (40)   |   Backward references (19)   |   Citation Link

Buy
PDF
Patent  Pub.Date  Inventor Assignee   Title
Buy PDF- 43pp US4295193  1981-10 Pomerene  International Business Machines Corporation Machine for multiple instruction execution
Buy PDF- 43pp US4434462  1984-02 Guttag et al.  Texas Instruments Incorporated Off-chip access for psuedo-microprogramming in microprocessor
Buy PDF- 35pp US4437149  1984-03 Pomerene et al.  International Business Machines Corporation Cache memory architecture with decoding
Buy PDF- 42pp US4450519  1984-05 Guttag et al.  Texas Instruments Incorporated Psuedo-microprogramming in microprocessor in single-chip microprocessor with alternate IR loading from internal or external program memories
Buy PDF- 9pp US4774654  1988-09 Pomerene  International Business Machines Corporation Apparatus and method for prefetching subblocks from a low speed memory to a high speed memory of a memory hierarchy depending upon state of replacing bit in the low speed memory
Buy PDF- 36pp US4833599  1989-05 Colwell et al.  Multiflow Computer, Inc. Hierarchical priority branch handling for parallel execution in a parallel processor
Buy PDF- 9pp US4860199  1989-08 Langendorf et al.  Prime Computer, Inc. Hashing indexer for branch cache
Buy PDF- 23pp US4903196  1990-02 Pomerene  International Business Machines Corporation Method and apparatus for guaranteeing the logical integrity of data in the general purpose registers of a complex multi-execution unit uniprocessor
Buy PDF- 24pp US4916652  1990-04 Schwatz et al.  International Business Machines Corporation Dynamic multiple instruction stream multiple data multiple pipeline apparatus for floating-point single instruction stream single data architectures
Buy PDF- 35pp US4920477  1990-04 Colwell et al.  Multiflow Computer, Inc. Virtual address table look aside buffer miss recovery method and apparatus
Buy PDF- 26pp US4942525  1990-07 Shintami et al.  Hitachi, Ltd. Data processor for concurrent executing of instructions by plural execution units
Buy PDF- 22pp US4943908  1990-07 Emma et al.  International Business Machines Corporation Multiple branch analyzer for prefetching cache lines
Buy PDF- 10pp US5051885  1991-09 Yates, Jr. et al.  Hewlett-Packard Company Data processing system for concurrent dispatch of instructions to multiple functional units
Buy PDF- 12pp US5185868  1993-02 Tran  Advanced Micro Devices, Inc. Apparatus having hierarchically arranged decoders concurrently decoding instructions and shifting instructions not ready for execution to vacant decoders higher in the hierarchy
Buy PDF- 69pp US5248628  1993-09 Grobroski  Kabushiki Kaisha Toshiba Method of fabricating a semiconductor memory device
Buy PDF- 35pp US5295249  1994-03 Blaner et al.  International Business Machines Corporation Compounding preprocessor for cache for identifying multiple instructions which may be executed in parallel
Buy PDF- 21pp US5303356  1994-04 Vassiliadis et al.  International Business Machines Corporation System for issuing instructions for parallel execution subsequent to branch into a group of member instructions with compoundability in dictation tag
Buy PDF- 14pp US5442760  1995-08 Rustad et al.  Dolphin Interconnect Solutions AS Decoded instruction cache architecture with each instruction field in multiple-instruction cache line directly connected to specific functional unit
Buy PDF- 14pp US5450556  1995-09 Slavenburg et al.  North American Philips Corporation VLIW processor which uses path information generated by a branch control unit to inhibit operations which are not on a correct path
       
Foreign References: None

Other Abstract Info: DERABS G98-168675 DERG98-168675

Other References:
  • Johnson, "Superscalar Microprocessor Design", Prentice-Hall, 1991, pp. 203-213.
  • Johnson, "Superscalar Microprocessor Design", Prentice-Hall 1991, pp. 233-235.
  • Johnson, "Superscalar Microprocessor Design", Prentice-Hall 1991, pp. 25-26.
  • "Hardware Support for Large Atomic Units in Dynamically Scheduled Machines", Stephen W. Melvin et al, IEEE, 1988, pp. 60-63.
  • IBM TDB, "Nonredundant Instruction Format for Interpretive Programming Languages", vol. 17, No. 8, Jan. 1975, pp. 2353-2354.
  • IBM TDB, "Threaded Code Interpreter for Object Code", vol. 28, No. 10, Mar. 1986, pp. 4238-4241.
  • IEEE 1992, "An Efficient Resource-Constrained Global Scheduling Technique for Superscalar and VLIW Processor", S. Moon and K. Ebcioglu, pp. 55-71.
  • IEEE 1986, "Experiments with HPS, a Restricted Data Flow Microarchitecture for High Performance Computers", Y. Patt et al, pp. 254-258.
  • ACM 1985, "Critical Issues Regarding HPS, a High Performance Microarchitecture", Y. Patt et al, pp. 109-116.
  • Computer Society Press of the IEEE, The 14th Annual International Symposium on Computer Architecture Jun. 2-5, 1987, "Branch Folding in the CRISP Microprocessor: Reducing Branch Delay to Zero", D. R. Ditzel et al, pp. 2-9.
  • IBM Research Report, RC 16145 (#71759) Oct. 2, 1990, Computer Science, "Some Global Compiler Optimizations and Architectural Features for Improving Performance of Superscalars", K. Ebcioglu et al pp. 1-13.


  • Inquire Regarding Licensing

    Powered by Verity


    Plaques from Patent Awards      Gallery of Obscure PatentsNominate this for the Gallery...

    Thomson Reuters Copyright © 1997-2010 Thomson Reuters 
    Subscriptions  |  Web Seminars  |  Privacy  |  Terms & Conditions  |  Site Map  |  Contact Us  |  Help