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


 The Delphion Integrated View

  Buy Now:   Buy PDF- 12pp  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: US5669001: Object code compatible representation of very long instruction word programs
[ Derwent Title ]


Country: US United States of America

View Images High
Resolution

 Low
 Resolution

 
12 pages

 
Inventor: Moreno, Jaime Humberto; Hartsdale, NY

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: 1997-09-16 / 1995-03-23

Application Number: US1995000410431

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

ECLA Code: G06F9/38E; G06F9/38E2; G06F9/38E6; G06F9/38T; G06F9/45E5;

U.S. Class: Current: 717/149; 712/E09.049; 712/E09.05; 712/E09.054; 712/E09.071; 717/155;
Original: 395/706;

Field of Search: 364/DIG. 1 MS File,DIG. 2 MS File 395/376,380,381,382,580,700,705,706,707,708,709,710

Priority Number:
1995-03-23  US1995000410431

Abstract:     Object code compatibility is provided among VLIW processors with different organizations. The object code can be executed by sequential processors, thus providing backward compatibility with scalar and superscalar processors. A mechanism is provided which allows representing VLIW programs in an implementation independent manner. This mechanism relies on instruction cache (I-cache) reload/access processes which incorporate implementation-dependent features into a VLIW program. In this way, programs are represented in main memory in an implementation independent manner (i.e., without reflecting the organization of the processor where they are executed), the implementation-specific aspects are introduced as part of the instruction cache reload/fetch processes, and the simplicity in instruction dispatch logic that is characteristic of VLIW processors is preserved. This allows for object code compatibility among VLIW processors with different organizations. This is done by decomposing the process into tasks performed at I-cache reload time and tasks performed at I-cache access time, requiring simpler logic to perform the translation. The resulting VLIWs can be executed starting from any operation within them (e.g., branching into them is possible), and there is a one-to-one correspondence among primitive operations in main memory and in the I-cache. Moreover, a framework is provided for generating (compiling) code which exploits the parallel execution features of a VLIW processor (parallelized code) which is also executable by a sequential processor without unduly affecting performance.

Attorney, Agent or Firm: Whitham, Curtis, Whitham & McGinn ; Sbrollini, Jay P. ;

Primary / Asst. Examiners: Harrell, Robert B.;

INPADOC Legal Status: Show legal status actions          Buy Now: Family Legal Status Report

Designated Country: DE FR GB  EP JP KR 

Family: Show 11 known family members

First Claim:
Show all 7 claims
Having thus described my invention, what I claim as new and desire to secure by Letters Patent is as follows:     1. A method of storing in computer memory and translating very long instruction words (VLIWs) for execution by VLIW processors with different organizations and providing object code compatibility with scalar and superscalar processors, said method comprising the steps of:
  • storing in a computer memory of a processor associated with the computer memory a program to be executed by the processor, the program being stored in the computer memory as a set of tree instructions composed of an unlimited number of internal nodes and an unlimited number of arcs, said internal nodes corresponding to conditional branch instructions and generating two arcs, primitive operations of said processor being associated with said arcs;
  • accessing said computer memory to fetch a memory block containing a tree instruction;
  • decomposing a fetched tree instruction into a plurality of sequential instructions as variable length VLIWs according to resources of the processor associated with the computer memory and on which the program is to be executed;
  • writing the variable length VLIWs in a line of an instruction cache (I-cache) for access by said processor associated with the computer memory; and
  • executing by said processor associated with the computer memory the variable length VLIWs written in said I-cache.


Background / Summary: Show background / summary

Drawing Descriptions: Show drawing descriptions

Description: Show description

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

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

Buy
PDF
Patent  Pub.Date  Inventor Assignee   Title
Buy PDF- 18pp US5317734  1994-05 Gupta  North American Philips Corporation Method of synchronizing parallel processors employing channels and compiling method minimizing cross-processor data dependencies
Buy PDF- 14pp US5442790  1995-08 Nosenchuck  The Trustees of Princeton University Optimizing compiler for computers
Buy PDF- 7pp US5526499  1996-06 Bernstein et al.  International Business Machines Corporation Speculative load instruction rescheduler for a compiler which moves load instructions across basic block boundaries while avoiding program exceptions
       
Foreign References: None

Other Abstract Info: DERABS G1996-443356

Other References:
  • R.P. Colwell, et al. "A VLIW architecture for a trace scheduling compliler" IEEE Transactions on Computers vol. C-37, No.8 pp. 967-979 1988. (13 pages) Cited by 31 patents
  • G.R. Beck, et al. "The Cydra 5 mini-supercomputer: architecture & implementation" The Journal of Supercomputing vol. 7, No. 1/2 pp. 143-180 1993. (38 pages) Cited by 12 patents [ISI abstract]
  • A.E. Charlesworth "An approach to scientific array processing: the architectural design of the AP-102B/FPS-164 family" IEEE Computer vol. 14, No. 9 pp. 18-27 1981. Cited by 57 patents


  • 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