Optimization of n-base typed arithmetic expressions

Data processing: software development – installation – and managem – Software program development tool – Translation of code

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Reexamination Certificate

active

07316007

ABSTRACT:
A method for arithmetic expression optimization includes receiving a first instruction defined for a first processor having a first base, the first instruction including an operator and at least one operand, converting the first instruction to a second instruction optimized for a second processor having a second base when all operands do not carry potential overflow or when the operator is insensitive to overflow, the second base being smaller than the first base, and converting to a wider base a third instruction that is the source of the overflow when the at least one operand the potential for overflow and when the operator is sensitive to overflow. An apparatus for arithmetic expression optimization includes at least one memory having program instructions and at least one processor configured to use the program instructions to receive a first instruction defined for a first processor having a first base, convert the first instruction to a second instruction optimized for a second processor having a second base when every one of the at least one operand does not carry potential overflow or when the operator is insensitive to overflow, the second base being smaller than the first base, and convert to a wider base a third instruction that is the source of the overflow when the at least one operand the potential for overflow and when the operator is sensitive to overflow.

REFERENCES:
patent: 3805045 (1974-04-01), Larsen
patent: 3993891 (1976-11-01), Beck et al.
patent: 4400769 (1983-08-01), Kaneda et al.
patent: 4504924 (1985-03-01), Cook et al.
patent: 5107451 (1992-04-01), Houk
patent: 5301341 (1994-04-01), Vassiliadis et al.
patent: 5305456 (1994-04-01), Boitana
patent: 5408670 (1995-04-01), Davies
patent: 5418959 (1995-05-01), Smith et al.
patent: 5446901 (1995-08-01), Owicki et al.
patent: 5497340 (1996-03-01), Uramoto et al.
patent: 5606677 (1997-02-01), Balmer et al.
patent: 5668999 (1997-09-01), Gosling
patent: 5724279 (1998-03-01), Benaloh et al.
patent: 5732263 (1998-03-01), Havens et al.
patent: 5740441 (1998-04-01), Yellin et al.
patent: 5784553 (1998-07-01), Kolawa et al.
patent: 5794049 (1998-08-01), Lindholm
patent: 5802373 (1998-09-01), Yates et al.
patent: 5809306 (1998-09-01), Suzuki et al.
patent: 5825407 (1998-10-01), Cowe et al.
patent: 5878266 (1999-03-01), Goddard et al.
patent: 5884316 (1999-03-01), Bernstein et al.
patent: 5920720 (1999-07-01), Toutonghi et al.
patent: 5946483 (1999-08-01), Boutaud et al.
patent: 5999731 (1999-12-01), Yellin et al.
patent: 6003038 (1999-12-01), Chen
patent: 6014723 (2000-01-01), Tremblay et al.
patent: 6026237 (2000-02-01), Berry et al.
patent: 6075863 (2000-06-01), Krishnan et al.
patent: 6091897 (2000-07-01), Yates et al.
patent: 6092147 (2000-07-01), Levy et al.
patent: 6093216 (2000-07-01), Adi-Tabatabai et al.
patent: 6151618 (2000-11-01), Wahbe et al.
patent: 6182158 (2001-01-01), Kougiouris et al.
patent: 6202143 (2001-03-01), Rim
patent: 6212633 (2001-04-01), Levy et al.
patent: 6247116 (2001-06-01), Abdallah et al.
patent: 6247174 (2001-06-01), Santhanam et al.
patent: 6308317 (2001-10-01), Wilkinson et al.
patent: 6363523 (2002-03-01), Chen et al.
patent: 6477702 (2002-11-01), Yellin et al.
patent: 2002/0023954 (2002-02-01), Calder et al.
patent: 2003/0028572 (2003-02-01), Hoskote et al.
patent: 0 778 522 (1997-06-01), None
patent: WO 01/14958 (2001-03-01), None
Jags, “cs510jip Compressed Data Loader”, Jags—report, May 21, 1998, pp. 1-9, Retrieved online Dec. 16, 2005 from URL:<http://www.cs.pdx.edu/˜apt/cs510jip—1998/jags—report/report.html>.
Glossner et al., “Delft-Java Dynamic Translation”,Euromicro Conference, 1999. Proceedings, IEEE Computer Society, Los Alamitos, CA, Sep. 8, 1999, pp. 57-62. (XP010352195).
Wallach et al., “ASHs: Application-Specific Handlers for High-Performance Messaging”,IEEE/ACM Transactions on Networking, vol. 5, No. 4, IEEE/ACM, New York, NY, Aug. 1997, pp. 460-474. (XP011039087).
McDermott et al., “Smart Card: Java—Java and Smart Cards”, Aug. 27, 1999, pp. 1-2 [Online]. Retrieved on Nov. 20, 2006 from the Internet: <URL:http://web.archive.org/web/19990827234400/http://web.mit.edu/ecom/Spring1997/gr12/6JAVA.HTM>. (XP002208203).
Sun Microsystems, Inc., Java Card™ 20. Developer's Guide, Aug. 19, 1998, Revision 1.12.
Sun Microsystems, Inc., “Java Card™ 2.0 Application Programming Interfaces”, Oct. 13, 1997, Rev. 1.0.
Sun Microsystems, Inc., “Java Card™ 2.0 Language Subset and Virtual Machine Specification”, Oct. 13, 1997, Revision 1.0 Final.
Sun Microsystems, Inc., “Java Card™ 2.0 Programming Concepts”, Oct. 15, 1997, Rev. 1.0 Final.
Sun Microsystems, Inc., “Java Card™ 2.1 Application Programming Interface”, Jun. 7, 1999, Final Rev. 1.1.
Sun Microsystems, Inc., “Java Card™ 2.1 Runtime Environment (JCRE) Specification”, Jun. 7, 1999, Final Revision 1.1.
Sun Microsystems, Inc., “JavaCard™ 2.1 Virtual Machine Specification”, Jun. 7, 1999, Final Rev. 1.1.
Sun Microsystems, Inc., “Release Notes—Java Card™ 2.1 Specifications”, Jun. 7, 1999, Final Rev. 1.1.
Sun Microsystems, Inc., “Java Check™ 3.0 Frequently Asked Questions”, printed from http://java.sun.com/products/personaljava/jcheckfaq30-beta.html, on Dec. 3, 1999.
Sun Microsystems, Inc., “Java Check™ Technical Notice”, printed from http://java.sun.com/products/personaljava/JcheckTechNotice.html, on Dec. 3, 1999.
Sun Microsystems, Inc., “Using Java Check™”, Version 2.0.1, printed from www.sun.com/software/personaljava/techinfo.html, on Dec. 3, 1999.
Sun Microsystems, Inc., “Using Java Check™”, Version 3.0, printed from http://java.sun.com/cgi-bin/download2.cgi, on Dec. 3, 1999.
Sun Microsystems, Inc., “The K Virtual Machine (KVM)”, White Paper Jun. 8, 1999.
Ritchey, Tim, “Advanced Topics: The Java Virtual Machine”JAVA!, Chapter 14, pp. 25-346, Sep. 22, 1995.
Daniels, John et al., “Strategies For Sharing Objects In Distributed Systems”, JOOP, Object Designers Ltd. UK, pp. 27-36, no data find.
Michael Shuttle et al., “Exact Rounding of Certain Elementary Functions”, Jun. 29, 1993, pp. 138-145.
Ziv, Abraham, “Fast Evaluation of Elementary Mathematical Functions with Correctly Rounded Last Bit”, Sep. 1, 1991, pp. 410-423.
George E. Necula et al., “Proof Carrying Code”, Nov. 1996, pp. 1-60.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Optimization of n-base typed arithmetic expressions does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Optimization of n-base typed arithmetic expressions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Optimization of n-base typed arithmetic expressions will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3963969

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.