Efficient linking and loading for late binding and platform...

Electrical computers and digital processing systems: interprogra – Dynamic linking – late binding

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C719S332000, C717S162000, C717S163000, C717S164000

Reexamination Certificate

active

07543309

ABSTRACT:
Methods of optimizing the loading of a previously linked file into working memory in a computer for executing in a memory sharable with other executables, and converting an image which has been previously linked for executing in an unshared memory into an image optimized for use with virtual memory.

REFERENCES:
patent: 5375241 (1994-12-01), Walsh
patent: 5675796 (1997-10-01), Hodges et al.
patent: 5708811 (1998-01-01), Arendt et al.
patent: 5771383 (1998-06-01), Magee et al.
patent: 5774722 (1998-06-01), Gheith
patent: 5809563 (1998-09-01), Yamada et al.
patent: 5835749 (1998-11-01), Cobb
patent: 5916308 (1999-06-01), Duncan et al.
patent: 5978857 (1999-11-01), Graham
patent: 6128713 (2000-10-01), Eisler et al.
patent: 6141698 (2000-10-01), Krishnan et al.
patent: 6182108 (2001-01-01), Williams et al.
patent: 6219830 (2001-04-01), Eidt et al.
patent: 6363436 (2002-03-01), Hagy et al.
patent: 6460058 (2002-10-01), Koppolu et al.
patent: 6463480 (2002-10-01), Kikuchi et al.
patent: 6505229 (2003-01-01), Turner et al.
patent: 6550060 (2003-04-01), Hammond
patent: 6769126 (2004-07-01), Pekowski
U.S. Appl. No. 09/282,227, filed Mar. 31, 1999, Forin et al.
U.S. Appl. No. 09/283,818, filed Mar. 31, 1999, Forin et al.
U.S. Appl. No. 09/282,238, filed Mar. 31, 1999, Forin et al.
U.S. Appl. No. 09/282,229, filed Mar. 31, 1999, Forin et al.
U.S. Appl. No. 09/392,405, filed Sep. 9, 1999, Forin et al.
B. Bershad, et al., “Extensibility, Safety and Performance in the Spin Operating System,”15th ACM Symposium on Operating System Principles, Copper Mountain Resort, Colorado, Dec. 1995, pp. 267-284.
D. Black, et al., “Microkernel Operating System Architecture and Mach,”1st USENIX Workshop on Micro-Kernels and Other Kernel Architectures, Seattle, Apr. 1992, pp. 11-30.
D. Cheriton, et al., “A Caching Model of Operating System Kernel Functionality,”Proceedings of the First Symposium on Operating Systems Design and Implementation, Seattle, 1994, 15 pages.
D. Cheriton, “The V Distributed System”,Communications of the ACM, Mar. 1998, vol. 31, No. 3, pp. 314-333.
R. Draves, et al., “Unifying the User and Kernel Environments,”Microsoft Research Technical Report MSR-TR-97-10, Mar. 1997, 16 pages.
D. Engler, et al., “Exokernel: An Operating System Architecture for Application-Level Resource Management,”15th ACM Symposium on Operating System Principles ACM SIGOPS, Copper Mountain Resort, Colorado, Dec. 1995, pp. 251-266.
B. Ford, et al., “The Flux OSKit: A Substrate for Kernel and Language Research,”Proceedings of the 16th ACM Symposium on Operating Systems Principles, ACM SIGOPS, Saint-Malo, France, Oct. 1997, pp. 38-51.
D. Golub, et al., “UNIX as an application program,”USENIX 1990 Summer Conference, Anaheim, CA, Jun. 1990, pp. 87-95.
J. Helander, “Unix Under Mach: The Lites Server,”Master's Thesis, Helsinki University of Technology, 1994, 71 pages.
D. Hildebrand, “An Architectural Overview of QNX,”1st USENIX Workshop on Micro-kernels and Other Kernel Architectures, Seattle, Apr. 1992, pp. 113-126.
M. Jones, et al., “An Overview of the Rialto Real-Time Architecture,”Proceedings of the Seventh ACM SIGOPS European Workshop, SIGOPS, Sep. 1996, pp. 249-256.
M. Jones, et al., “CPU Reservations and Time Constraints: Efficient, Predictable Scheduling of Independent Activities,”Proceedings of the 16th ACM Symposium on Operating System Principles, ACM SIGOPS, Saint-Malo, France, Oct. 1997, pp. 198-211.
M. Jones, The Microsoft Interactive TV System: An Experience Report, Microsoft Research Technical Report MSR-TR-97-18 [online], Jul. 1997, 24 pages, Retrieved Jan. 26, 2000 from the Internet.
D. Julin, et al., “Generalized Emulation Services for Mach 3.0 Overview, Experiences and Current Status,”Proceedings of the Usenix Mach Symposium USENIX Association, 1991, pp. 13-26.
D. Lee, et al., “Execution Charcteristics of Desktop Applications on Windows NT,”Proceedings of the 25th International Symposium on Computer Architecture,, IEEE, Barcelona, Spain, Jun. 1998, pp. 27-38.
J. Liedtke, “On μ-Kernel Construction,”15th ACM Symposium on Operating System Principles, ACM, Copper Mountain Resort, Colorado, Dec. 1995, pp. 237-250.
J. Mogul, et al., “The Packet Filter: An Efficient Mechanism for User-level Network Code,”11th ACM Symposium on Operating System Principles, ACM, Nov. 1987, 34 pages.
R. Rashid, “From RIG to Accent to Mach: The Evolution of a Network Operating System,”Carnegie-Mellon University Technical Report, Aug. 1987, pp. 1128-1137.
M. Rozier, et al., “CHORUS Distributed Operating System,”Computing Systems, Fall 1998, vol. 1, No. 4, pp. 305-370.
Torborg, Jay, et al., “Talisman: Commodity Realtime 3D Graphics for the PC,”Proceeding of SIGGRAPH96, ACM, Aug. 1996, pp. 353-363.
M. Young, “Exporting a User Interface to Memory Management from a Communication-Oriented Operating System,”Ph.D. Thesis CMU-CS-89-202, Carnegie-Mellon University, Nov. 1989, 206 pages.
Richter, Jeffrey, “Advanced Windows NT,” Microsoft Press; pp. 355-364, 1994.

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

Efficient linking and loading for late binding and platform... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Efficient linking and loading for late binding and platform..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient linking and loading for late binding and platform... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-4073256

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