Cross-module optimization for dynamically-shared programs and li

Patent

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

395707, 395708, G06F 945

Patent

active

059238828

ABSTRACT:
A system and method of eliminating some of the indirect addressing associated with Position Independent Code (PIC). The invention applies cross-module optimization to dynamic linking of shared libraries. A definition table is built that defines where each symbol within an application program and associated shared library is defined. Also stored in the definitions table is an associated attribute. The definition table is utilized to eliminate indirect addressing wherever possible. As a result, overall system performance is increased.

REFERENCES:
patent: 5193191 (1993-03-01), McKeeman et al.
patent: 5291601 (1994-03-01), Sands
patent: 5359721 (1994-10-01), Kempf et al.
patent: 5375241 (1994-12-01), Walsh
patent: 5375242 (1994-12-01), Kumar et al.
patent: 5408665 (1995-04-01), Fitzgerald
patent: 5535391 (1996-07-01), Hejlsberg et al.
patent: 5583988 (1996-12-01), Crank et al.
patent: 5590331 (1996-12-01), Lewis et al.
Ho et al., "Optimizing the Performance of Dynamically-Linked Programs," 1995 USENIX Technical Conference on UNIX and Advanced Computing Systems, New Orleans, LA, Jan. 16-20, 1995, pp. 225-233.

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

Cross-module optimization for dynamically-shared programs and li does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Cross-module optimization for dynamically-shared programs and li, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Cross-module optimization for dynamically-shared programs and li will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-2285930

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