System amd method for distributed object resource management

Claim 2

In a computer system having a memory storing a plurality of objects, a method of determining when to delete ones of said objects, the steps of the method comprising: storing in said memory strong object references to a plurality of said objects; generating a weak object reference corresponding to a specified one of said objects; in response to predefined commands, deleting specified ones of said strong object references; enabling deletion of said one of said objects when less than a predefined threshold number of strong object references to said one of said objects exist in said computer system, without regard to how many weak object references to said one of said objects may exist; setting aside in said memory a primary linker cache and a secondary linker image cache; and storing linker images, generated while loading programs for execution, in said primary and secondary linker caches, each linker image in said primary linker cache including strong object references to objects included in corresponding ones of said loaded programs, each linker image in said secondary linker cache including weak object references to objects included in corresponding ones of said loaded programs, said linker image storing step including: moving a linker image from said primary linker cache to said secondary linker cache when said primary linker cache is full and space for another linker image is to stored in said primary linker cache; moving a linker image from said secondary linker cache to said primary linker cache when said linker image is to be used to initiate execution of a corresponding program; when moving a linker image from said primary linker cache to said secondary linker cache, replacing said strong object references in said moved linker image with corresponding weak object references; and when moving a linker image from said secondary linker cache to said primary linker cache, replacing said weak object references in said moved linker image with corresponding strong object references.

Claim 3

The method of claim 1, replacing a specified strong object reference to said one of said objects with a weak object reference by: creating a companion object that includes a pointer to said one of said objects; generating an object reference to said companion object; and destroying said specified strong object reference; wherein said object reference to said companion object comprises a weak object reference to said one of said objects.

Claim 4

The method of claim 1, for a plurality of objects stored in said memory, storing reference count data representing said strong object references to said objects; decrementing said reference count data for one of said objects whenever a strong object reference to said one of said objects is destroyed; and initiating deletion of said one of said objects when said reference count data for said one of said objects is decremented to a predefined threshold value.

Claim 5

In a computer system having a memory storing a plurality of objects, a method of determining when to delete ones of said objects, the steps of the method comprising: storing in said memory strong object references to a plurality of said objects; generating a weak object reference corresponding to a specified one of said objects; in response to predefined commands, deleting specified ones of said strong object references; enabling deletion of said one of said objects when less than a predefined threshold number of strong object references to said one of said objects exist in said computer system, without regard to how many weak object references to said one of said objects may exist; and replacing a specified strong object reference to said one of said objects with a weak object reference by: creating a companion object that includes a pointer to said one of said objects; wherein said pointer is not a strong object reference to said one of said objects; generating an object reference to said companion object; and destroying said specified strong object reference; wherein said object reference to said companion object comprises a weak object reference to said one of said objects.

Claim 6

In a computer system having a memory storing a plurality of objects, a method of determining when to delete ones of said objects, the steps of the method comprising: storing in said memory strong object references to a plurality of said objects; generating a weak object reference corresponding to a specified one of said objects; in response to predefined commands, deleting specified ones of said strong object references; enabling deletion of said one of said objects when less than a predefined threshold number of strong object references to said one of said objects exist in said computer system, without regard to how many weak object references to said one of said objects may exist; and replacing a specified strong object reference to said one of said objects with a weak object reference by: creating a companion object that includes a pointer to said one of said objects; wherein said pointer is not a strong object reference to said one of said objects; generating an object reference to said companion object; and destroying said specified strong object reference; wherein said object reference to said companion object comprises a weak object reference to said one of said objects.

Claim 7

In a computer system having a memory storing a plurality of objects, a method of determining when to delete ones of said objects, the steps of the method comprising: storing in said memory strong object references to a plurality of said objects; for a plurality of said objects stored in said memory, storing reference count data representing said strong object references to said objects; decrementing said reference count data for one of said objects whenever a strong object reference to said one of said objects is destroyed; replacing a strong object reference to said one of said objects with a weak object reference, including decrementing said reference count data for one of said objects; initiating deletion of said one of said objects when said reference count data for said one of said objects is decremented to a predefined threshold value, without regard to how many weak object references to said one of said objects may exist; setting aside in said memory a primary linker cache and a secondary linker image cache; and storing linker images, generated while loading programs for execution, in said primary and secondary linker caches, each linker image in said primary linker cache including strong object references to objects included in corresponding ones of said loaded programs, each linker image in said secondary linker cache including weak object references to objects included in corresponding ones of said loaded programs, said linker image storing step including: moving a linker image from said primary linker cache to said secondary linker cache when said primary linker cache is full and space for another linker image is to be stored in said primary linker cache; moving a linker image from said secondary linker cache to said primary linker cache when said linker image is to be used to initiate execution of a corresponding program; when moving a linker image from said primary linker cache to said secondary linker cache, replacing said strong object references in said moved linker image with corresponding weak object references; and when moving a linker image from said secondary linker cache to said primary linker cache, replacing said weak object references in said moved linker image with corresponding strong object references.

Claim 8

In a computer system having a memory storing a plurality of objects, a method of determining when to delete ones of said objects, the steps of the method comprising: storing in said memory strong object references to a plurality of said objects; for a plurality of said objects stored in said memory, storing reference count data representing said strong object references to said objects; decrementing said reference count data for one of said objects whenever a strong object reference to said one of said objects is destroyed; replacing a strong object reference to said one of said objects with a weak object reference, including decrementing said reference count data for one of said objects; initiating deletion of said one of said objects when said reference count data for said one of said objects is decremented to a predefined threshold value, without regard to how many weak object references to said one of said objects may exist; setting aside in said memory a primary linker cache and a secondary linker image cache; and storing linker images, generated while loading programs for execution, in said primary and secondary linker caches, each linker image in said primary linker cache including strong object references to objects included in corresponding ones of said loaded programs, each linker image in said secondary linker cache including weak object references to objects included in corresponding ones of said loaded programs, said linker image storing step including: moving a linker image from said primary linker cache to said secondary linker cache when said primary linker cache is full and space for another linker image is to be stored in said primary linker cache; moving a linker image from said secondary linker cache to said primary linker cache when said linker image is to be used to initiate execution of a corresponding program; when moving a linker image from said primary linker cache to said secondary linker cache, replacing said strong object references in said moved linker image with corresponding weak object references; and when moving a linker image from said secondary linker cache to said primary linker cache, replacing said weak object references in said moved linker image with corresponding strong object references.

Claim 9

The method of claim 5, replacing a specified strong object reference to said one of said objects with a weak object reference by: creating a companion object that includes a pointer to said one of said objects; generating an object reference to said companion object; and destroying said specified strong object reference; wherein said object reference to said companion object comprises a weak object reference to said one of said objects.

Claim 10

In a computer system having a memory storing a plurality of objects, a method of determining when to delete ones of said objects, the steps of the method comprising: storing in said memory strong object references to a plurality of said objects; for a plurality of said objects stored in said memory, storing reference count data representing said strong object references to said objects; decrementing said reference count data for one of said objects whenever a strong object reference to said one of said objects is destroyed; replacing a strong object reference to said one of said objects with a weak object reference, including decrementing said reference count data for one of said objects; initiating deletion of said one of said objects when said reference count data for said one of said objects is decremented to a predefined threshold value, without regard to how many weak object references to said one of said objects may exist; and replacing a specified strong object reference to said one of said objects with a weak object reference by: creating a companion object that includes a pointer to said one of said objects; wherein said pointer is not a strong object reference to said one of said objects; generating an object reference to said companion object; and destroying said specified strong object reference; wherein said object reference to said companion object comprises a weak object reference to said one of said objects.

Claim 11

In a computer system having a memory storing a plurality of objects, a method of determining when to delete ones of said objects, the steps of the method comprising: storing in said memory strong object references to a plurality of said objects; for a plurality of said objects stored in said memory, storing reference count data representing said strong object references to said objects; decrementing said reference count data for one of said objects whenever a strong object reference to said one of said objects is destroyed; replacing a strong object reference to said one of said objects with a weak object reference, including decrementing said reference count data for one of said objects; initiating deletion of said one of said objects when said reference count data for said one of said objects is decremented to a predefined threshold value, without regard to how many weak object references to said one of said objects may exist; and replacing a specified strong object reference to said one of said objects with a weak object reference by: creating a companion object that includes a pointer to said one of said objects; wherein said pointer is not a strong object reference to said one of said objects; generating an object reference to said companion object; and destroying said specified strong object reference; wherein said object reference to said companion object comprises a weak object reference to said one of said objects.

Claim 12

A computer system, comprising: a memory storing a plurality of objects, and strong object references to a plurality of said objects; a makeweak module configured to generate weak object references corresponding to specified ones of said strong object references; a reference deleting module configured to delete specified ones of said strong object references; and an object management module configured to enable deletion of said one of said objects when less than a predefined threshold number of strong object references to said one of said objects exist in said computer system, without regard to how many weak object references to said one of said objects may exist; and a program linking module, including a primary linker cache and a secondary linker image cache, configured to generate linker images while loading programs for execution and for storing said linker images in said primary and secondary linker caches, each linker image in said primary linker cache including strong object references to objects included in corresponding ones of said loaded programs, each linker image in said secondary linker cache including weak object references to objects included in corresponding ones of said loaded programs, said program linking module further configured to: move a linker image from said primary linker cache to said secondary linker cache when said primary linker cache is full and space for another linker image is to stored in said primary linker cache; move a linker image from said secondary linker cache to said primary linker cache when said linker image is to be used to initiate execution of a corresponding program; when moving a linker image from said primary linker cache to said secondary linker cache, replace said strong object references in said moved linker image with corresponding weak object references; and when moving a linker image from said secondary linker cache to said primary linker cache, replace said weak object references in said moved linker image with corresponding strong object references.

Claim 13

A computer system, comprising: a memory storing a plurality of objects, and strong object references to a plurality of said objects; a makeweak module configured to generate weak object references corresponding to specified ones of said strong object references; a reference deleting module configured to delete specified ones of said strong object references; and an object management module configured to enable deletion of said one of said objects when less than a predefined threshold number of strong object references to said one of said objects exist in said computer system, without regard to how many weak object references to said one of said objects may exist; and a program linking module, including a primary linker cache and a secondary linker image cache, configured to generate linker images while loading programs for execution and for storing said linker images in said primary and secondary linker caches, each linker image in said primary linker cache including strong object references to objects included in corresponding ones of said loaded programs, each linker image in said secondary linker cache including weak object references to objects included in corresponding ones of said loaded programs, said program linking module further configured to: move a linker image from said primary linker cache to said secondary linker cache when said primary linker cache is full and space for another linker image is to stored in said primary linker cache; move a linker image from said secondary linker cache to said primary linker cache when said linker image is to be used to initiate execution of a corresponding program; when moving a linker image from said primary linker cache to said secondary linker cache, replace said strong object references in said moved linker image with corresponding weak object references; and when moving a linker image from said secondary linker cache to said primary linker cache, replace said weak object references in said moved linker image with corresponding strong object references.

Claim 14

The computer system of claim 8, said makeweak module further configured to create a companion object that includes a pointer to said one of said objects and to generate an object reference to said companion object; wherein said object reference to said companion object comprises a weak object reference to said one of said objects.

Claim 15

The computer system of claim 8, including: a nucleus module configured to store reference count data representing said strong object references to a plurality of said objects, to decrement said reference count data for one of said objects whenever a strong object reference to said one of said objects is destroyed, and to initiate deletion of said one of said objects when said reference count data for said one of said objects is decremented to a predefined threshold value.

Claim 16

A computer system, comprising: a memory storing a plurality of objects, and strong object references to a plurality of said objects; a makeweak module configured to generate weak object references corresponding to specified ones of said strong object references; a reference deleting module configured to delete specified ones of said strong object references; and an object management module configured to enable deletion of said one of said objects when less than a predefined threshold number of strong object references to said one of said objects exist in said computer system, without regard to how many weak object references to said one of said objects may exist; said makeweak module further configured to create a companion object that includes a pointer to said one of said objects, and to generate an object reference to said companion object; wherein said pointer is not a strong object reference to said one of said objects; wherein said object reference to said companion object comprises a weak object reference to said one of said objects.

Claim 17

A computer system, comprising: a memory storing a plurality of objects, and strong object references to a plurality of said objects; a makeweak module configured to generate weak object references corresponding to specified ones of said strong object references; a reference deleting module configured to delete specified ones of said strong object references; and an object management module configured to enable deletion of said one of said objects when less than a predefined threshold number of strong object references to said one of said objects exist in said computer system, without regard to how many weak object references to said one of said objects may exist; said makeweak module further configured to create a companion object that includes a pointer to said one of said objects, and to generate an object reference to said companion object; wherein said pointer is not a strong object reference to said one of said objects; wherein said object reference to said companion object comprises a weak object reference to said one of said objects.

Claim 18

A computer program product for use in conjunction with a computer system, the computer program product comprising a computer readable storage medium and a computer program mechanism embedded therein, the computer program mechanism comprising: a plurality of objects stored in said memory; strong object references stored in said memory, each of said strong object references referencing one of said objects; an executable makeweak procedure for generating weak object references corresponding to specified ones of said objects; an executable reference deleting procedure for deleting specified ones of said strong object references; and an object deleting enablement procedure for enabling deletion of said one of said objects when less than a predefined threshold number of strong object references to said one of said objects exist in said computer system, without regard to how many weak object references to said one of said objects may exist; further including: an executable program linking procedure, including a primary linker cache and a secondary linker image cache, for generating linker images while loading programs for execution and for storing said linker images in said primary and secondary linker caches, each linker image in said primary linker cache including strong object references to objects included in corresponding ones of said loaded programs, each linker image in said secondary linker cache including weak object references to objects included in corresponding ones of said loaded programs, said program linking procedure including instructions for: moving a linker image from said primary linker cache to said secondary linker cache when said primary linker cache is full and space for another linker image is to stored in said primary linker cache; moving a linker image from said secondary linker cache to said primary linker cache when said linker image is to be used to initiate execution of a corresponding program; when moving a linker image from said primary linker cache to said secondary linker cache, replacing said strong object references in said moved linker image with corresponding weak object references; and when moving a linker image from said secondary linker cache to said primary linker cache, replacing said weak object references in said moved linker image with corresponding strong object references.

Claim 19

A computer program product for use in conjunction with a computer system, the computer program product comprising a computer readable storage medium and a computer program mechanism embedded therein, the computer program mechanism comprising: a plurality of objects stored in said memory; strong object references stored in said memory, each of said strong object references referencing one of said objects; an executable makeweak procedure for generating weak object references corresponding to specified ones of said objects; an executable reference deleting procedure for deleting specified ones of said strong object references; and an object deleting enablement procedure for enabling deletion of said one of said objects when less than a predefined threshold number of strong object references to said one of said objects exist in said computer system, without regard to how many weak object references to said one of said objects may exist; further including: an executable program linking procedure, including a primary linker cache and a secondary linker image cache, for generating linker images while loading programs for execution and for storing said linker images in said primary and secondary linker caches, each linker image in said primary linker cache including strong object references to objects included in corresponding ones of said loaded programs, each linker image in said secondary linker cache including weak object references to objects included in corresponding ones of said loaded programs, said program linking procedure including instructions for: moving a linker image from said primary linker cache to said secondary linker cache when said primary linker cache is full and space for another linker image is to stored in said primary linker cache; moving a linker image from said secondary linker cache to said primary linker cache when said linker image is to be used to initiate execution of a corresponding program; when moving a linker image from said primary linker cache to said secondary linker cache, replacing said strong object references in said moved linker image with corresponding weak object references; and when moving a linker image from said secondary linker cache to said primary linker cache, replacing said weak object references in said moved linker image with corresponding strong object references.

Claim 20

The computer program product of claim 12, further including: said makeweak procedure including instructions for creating a companion object that includes a pointer to said one of said objects, and generating an object reference to said companion object; wherein said object reference to said companion object comprises a weak object reference to said one of said objects.

Claim 21

The computer program product of claim 12 further including: a set of nucleus procedures, including procedures for storing reference count data representing said strong object references to said objects, for decrementing said reference count data for one of said objects whenever a strong object reference to said one of said objects is destroyed, and for initiating deletion of said one of said objects when said reference count data for said one of said objects is decremented to a predefined threshold value.

Claim 22

The computer program product of claim 12, further including: said makeweak procedure including instructions for creating a companion object that includes a pointer to said one of said objects, and generating an object reference to said companion object; wherein said object reference to said companion object comprises a weak object reference to said one of said objects.