Patent US6343350B1 successfully refreshed from Google Patents.
US6343350B1
Expired / Lapsed
US
⏱️ 0.0 years remaining
Conserving storage space by means of low resolution objects
Assignee: International Business Machines Corp
•
Filing: 1998-02-13
•
Granted: 2002-01-29
•
Expires: 2018-02-13
Abstract
Abstract The memory space (often in the form of cache) in a system (e.g., an Internet proxy or web browser) is conserved by saving low resolution versions of data objects when the full resolution version is removed (e.g., due to age, using a least recently used (LRU) replacement policy) in order to create space for new objects. This provides for efficient use of the memory space. In many situations, the low resolution version of the data object is of adequate quality for usage. Further, even when this is not the case, it can be useful to quickly obtain a low resolution version and then with some delay, obtain the full resolution version at the user or application's request. Particular advantageous embodiments of methods, apparatus and article of manufacture implementing the invention are presented.
Inventors
- 👤 Richard Orville LaMaire
- 👤 John Timothy Robinson
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-09 02:09
CPC Classifications
G; G06; G06F; G06F16/00; G06F16/90; G06F16/95; G06F16/957; G06F16/9574
Claims Analysis
Total Claims: 57
Claim 1
Independent Claim
80 words
A method for conserving an amount of storage space in a unit that stores a plurality of objects in a memory, the method comprising: having a first resolution version of one of the objects in the memory; generating at least one lower resolution version of said one of the objects, the lower resolution version using less memory space than the first resolution version; saving the lower resolution version in the memory; and discarding the first resolution version from the memory.
Claim 2
Independent Claim
80 words
A method for conserving an amount of storage space in a unit that stores a plurality of objects in a memory, the method comprising: having a first resolution version of one of the objects in the memory; generating at least one lower resolution version of said one of the objects, the lower resolution version using less memory space than the first resolution version; saving the lower resolution version in the memory; and discarding the first resolution version from the memory.
Claim 3
Independent Claim
63 words
A method for managing a plurality of objects in a cache, the method comprising: creating a cache directory having cache directory entries for any non-multiresolution objects that may exist and for the at least one multiresolution object, each cache directory entry of a multiresolution object having pointers to all existing resolution versions of that object; and forming an ordered list of the entries.
Claim 4
Independent Claim
63 words
A method for managing a plurality of objects in a cache, the method comprising: creating a cache directory having cache directory entries for any non-multiresolution objects that may exist and for the at least one multiresolution object, each cache directory entry of a multiresolution object having pointers to all existing resolution versions of that object; and forming an ordered list of the entries.
Claim 5
Dependent Claim
27 words
A method as recited in claim 2 , wherein the step of forming is based on a last usage time at which a particular object was used.
Claim 6
Dependent Claim
21 words
A method as recited in claim 2 , wherein the ordered-list is formed according to a frequency of object usage criterion.
Claim 7
Dependent Claim
161 words
A method as recited in claim 2 , further comprising: storing each object in a current resolution version, ascertaining if a cache directory entry corresponding to a lowest priority object y in the ordered list is a multiresolution object, and if object y is a multiresolution object, generating and storing a reduced resolution version of object y, removing the current resolution version of object y to create an amount of free space in the cache, setting the cache directory entry for object y to be a highest priority object, and determining if the amount of free space is sufficient for storing an object x, if the amount of free space is not sufficient for storing object x, repeating the steps of ascertaining, generating, removing, setting and determining for a next lowest priority object in the ordered list of cache directory entries, until the amount of free space is sufficient for storing object x, and storing object x within the free space.
Claim 8
Dependent Claim
101 words
A method as recited in claim 5 , further comprising: if y is not a multiresolution object, removing object y from the cache to increase the amount of free space, and determining if the amount of free space is sufficient for storing object x, if the amount of free space is not sufficient for storing object x, repeating the steps of ascertaining, generating, removing, setting and determining for a next lowest priority object in the ordered list of cache directory entries until the amount of free space is sufficient for storing object x, and storing object x within the free space.
Claim 9
Dependent Claim
166 words
A method as recited in claim 2 , further comprising: storing each object in a current resolution version, ascertaining if a first cache directory entry corresponding to a least-recently-used object y at an end of the ordered list is a multiresolution object, and if object y is a multiresolution object, generating and storing a reduced resolution version of object y, removing a current high resolution version of object y, so as to create an amount of free space, setting the first cache directory entry for object y to be a most-recently-used object by placing the first cache directory entry at a beginning of the ordered list, and determining if the amount of free space is sufficient for storing an object x, if not, repeating the steps of ascertaining, generating, removing, setting and determining for a next least-recently-used object in the ordered list of cache directory entries, until the amount of free space is sufficient for storing object x, and storing object x within the free space.
Claim 10
Dependent Claim
94 words
A method as recited in claim 7 , further comprising: if y is not a multiresolution object, removing object y from the cache to increase the amount of free space, and determining if the free space is sufficient for storing object x, if the amount of free space is not sufficient, repeating the steps of ascertaining, generating, removing, setting and determining for a next least-recently-used object in the ordered list of cache directory entries until the amount of free space is sufficient for storing object x, and storing object x within the free space.
Claim 11
Dependent Claim
24 words
A method as recited in claim 2 , wherein said managing includes reducing an object resolution of at least one of the multiresolution objects.
Claim 12
Independent Claim
90 words
A method for managing objects in an object cache, the method comprising: creating an amount of space to store a new object that is not currently in the cache, selecting a particular object in the cache for replacement by locating a multiresolution object, and discarding a highest resolution version of the multiresolution object, retaining a next lowest resolution version of the object if it exists, increasing a priority of a next lowest resolution version of the multiresolution object, and preventing the multiresolution object from becoming immediately eligible for subsequent replacement.
Claim 13
Independent Claim
90 words
A method for managing objects in an object cache, the method comprising: creating an amount of space to store a new object that is not currently in the cache, selecting a particular object in the cache for replacement by locating a multiresolution object, and discarding a highest resolution version of the multiresolution object, retaining a next lowest resolution version of the object if it exists, increasing a priority of a next lowest resolution version of the multiresolution object, and preventing the multiresolution object from becoming immediately eligible for subsequent replacement.
Claim 14
Dependent Claim
31 words
A method as recited in claim 10 , wherein the step of increasing includes forming an ordered list based on a last usage time at which a particular object was used.
Claim 15
Dependent Claim
124 words
In a system that stores a plurality of objects in a cache, a method for determining whether an object is of a multiresolution type, the method comprising: creating a table listing the currently understood multiresolution types in the system and the procedures for generating a reduced resolution version for each object type, searching for a match between the type of an object and one of a plurality of types listed in the table, and if a match is not found, indicating that the object is not a multiresolution object, if a match is found, indicating both that the object is a multiresolution object, and that a resolution reduction procedure listed in the table is useful to generate a lower resolution version of the object.
Claim 16
Dependent Claim
124 words
In a system that stores a plurality of objects in a cache, a method for determining whether an object is of a multiresolution type, the method comprising: creating a table listing the currently understood multiresolution types in the system and the procedures for generating a reduced resolution version for each object type, searching for a match between the type of an object and one of a plurality of types listed in the table, and if a match is not found, indicating that the object is not a multiresolution object, if a match is found, indicating both that the object is a multiresolution object, and that a resolution reduction procedure listed in the table is useful to generate a lower resolution version of the object.
Claim 17
Independent Claim
488 words
A method for managing objects in an object cache in order to create an amount of free space to store a new object x that is not currently in the cache, the method comprising: storing each multiresolution object in a plurality of resolution versions, wherein an amount of cache space taken up by a low resolution version is less than the amount of space taken up by a higher resolution version, creating a cache directory having entries for any non-multiresolution objects that may exist and for the at least one multiresolution object, each cache directory entry having pointers to all existing resolution versions of the at least one multiresolution object; and forming an ordered-list of the entries, wherein the ordering criterion is based on a last usage time at which a particular object was used, determining if the cache directory entry corresponding to a least-recently-used object y at the end of the ordered list is a multiresolution object, and if y is not a multiresolution object, removing object y and ascertaining if an amount of newly increased free space is sufficient for storing object x, if the amount of newly increased free space is not sufficient for storing object x, repeating the steps of determining and ascertaining for a next least-recently-used object in the ordered list of cache directory entries, until the amount of free space is sufficient for storing object x, and storing object x within the free space, if y is a multiresolution object, determining if more than one resolution version of the object is currently stored, and if only one resolution version is currently stored, generating and storing a reduced resolution version of object y, removing the current high resolution version of object y, setting the cache directory entry for object y to be a most-recently-used object by placing the cache directory entry at the beginning of the ordered list, and ascertaining if the newly increased free space is sufficient for storing said object x, if the amount of newly increased free space is not sufficient for storing object x, repeating the steps of determining and ascertaining for the next least-recently-used object in the ordered list of cache directory entries, until the amount of free space is sufficient for storing object x, and storing object x within the free space, if more than one resolution version is currently stored, removing the current high resolution version of object y, setting the cache directory entry for object y to be the most-recently-used object by placing the cache directory entry at the beginning of the ordered list, and ascertaining if the newly increased free space is sufficient for storing object x, if not, repeating the steps of removing, setting and ascertaining for the next highest resolution version of object y in the ordered list of cache directory entries, until the amount of free space is sufficient for storing object x, and storing object x within the free space.
Claim 18
Independent Claim
488 words
A method for managing objects in an object cache in order to create an amount of free space to store a new object x that is not currently in the cache, the method comprising: storing each multiresolution object in a plurality of resolution versions, wherein an amount of cache space taken up by a low resolution version is less than the amount of space taken up by a higher resolution version, creating a cache directory having entries for any non-multiresolution objects that may exist and for the at least one multiresolution object, each cache directory entry having pointers to all existing resolution versions of the at least one multiresolution object; and forming an ordered-list of the entries, wherein the ordering criterion is based on a last usage time at which a particular object was used, determining if the cache directory entry corresponding to a least-recently-used object y at the end of the ordered list is a multiresolution object, and if y is not a multiresolution object, removing object y and ascertaining if an amount of newly increased free space is sufficient for storing object x, if the amount of newly increased free space is not sufficient for storing object x, repeating the steps of determining and ascertaining for a next least-recently-used object in the ordered list of cache directory entries, until the amount of free space is sufficient for storing object x, and storing object x within the free space, if y is a multiresolution object, determining if more than one resolution version of the object is currently stored, and if only one resolution version is currently stored, generating and storing a reduced resolution version of object y, removing the current high resolution version of object y, setting the cache directory entry for object y to be a most-recently-used object by placing the cache directory entry at the beginning of the ordered list, and ascertaining if the newly increased free space is sufficient for storing said object x, if the amount of newly increased free space is not sufficient for storing object x, repeating the steps of determining and ascertaining for the next least-recently-used object in the ordered list of cache directory entries, until the amount of free space is sufficient for storing object x, and storing object x within the free space, if more than one resolution version is currently stored, removing the current high resolution version of object y, setting the cache directory entry for object y to be the most-recently-used object by placing the cache directory entry at the beginning of the ordered list, and ascertaining if the newly increased free space is sufficient for storing object x, if not, repeating the steps of removing, setting and ascertaining for the next highest resolution version of object y in the ordered list of cache directory entries, until the amount of free space is sufficient for storing object x, and storing object x within the free space.
Claim 19
Independent Claim
83 words
A method for determining whether an object is a multiresolution type in a system that stores a plurality of objects in a cache, comprising: creating a table that lists the currently understood multiresolution types in the system, searching for a match between the type of an object and the types listed in the table, and if a match is not found, indicating that the object is not a multiresolution object, if a match is found, indicating that the object is a multiresolution object.
Claim 20
Independent Claim
83 words
A method for determining whether an object is a multiresolution type in a system that stores a plurality of objects in a cache, comprising: creating a table that lists the currently understood multiresolution types in the system, searching for a match between the type of an object and the types listed in the table, and if a match is not found, indicating that the object is not a multiresolution object, if a match is found, indicating that the object is a multiresolution object.
Claim 21
Dependent Claim
57 words
A method as in claim 14 , wherein the table lists the procedures for generating a reduced resolution version for each object type, the method further comprising: if said match is found, indicating, from information in said table, that a particular resolution reduction procedure is to be used to generate a lower resolution version of the object.
Claim 22
Independent Claim
104 words
A method for modifying objects in a network object cache, said method comprising: determining the cache size ‘Sx’ bytes of storage required by an object ‘x’ not currently in the cache; determining if an amount of current free space ‘S_FREE’ in the cache is greater than or equal to ‘Sx’; and if ‘S_FREE’ is greater than ‘Sx’, said method further comprising: allocating Sx’ bytes of cache memory to ‘x’ and storing ‘x’ in the allocated cache; creating a CDE for ‘x’ and ordering the CDE in a hash chain; setting the CDE to be a present most-recently-used object; and in setting ‘S_FREE’ to ‘S_FREE’−‘Sx’.
Claim 23
Independent Claim
104 words
A method for modifying objects in a network object cache, said method comprising: determining the cache size ‘Sx’ bytes of storage required by an object ‘x’ not currently in the cache; determining if an amount of current free space ‘S_FREE’ in the cache is greater than or equal to ‘Sx’; and if ‘S_FREE’ is greater than ‘Sx’, said method further comprising: allocating Sx’ bytes of cache memory to ‘x’ and storing ‘x’ in the allocated cache; creating a CDE for ‘x’ and ordering the CDE in a hash chain; setting the CDE to be a present most-recently-used object; and in setting ‘S_FREE’ to ‘S_FREE’−‘Sx’.
Claim 24
Dependent Claim
87 words
A method as recited in claim 16 , when ‘Sx’ is greater than ‘S_FREE’, said method further comprising; finding a previous least-recently-used object ‘y’; ascertaining if object ‘y’ is a multiresolution object, if object ‘y’ is not a multiresolution object: removing an ‘y’ CDE and freeing an amount of cache space allocated to object ‘y’ consisting of ‘Sy’ bytes to form ‘S_FREE_NEW’=‘S_FREE’+‘Sy’, and determining if ‘S_FREE_NEW’ is greater than ‘Sx’, if yes, storing ‘x’, if not, repeating said step of ascertaining for a next least-recently-used object ‘y’.
Claim 25
Dependent Claim
70 words
A method as recited in claim 17 , wherein object ‘y’ is a multiresolution object, said method further comprising: determining if object ‘y’ exists in a resolution ‘level-0’ version in the cache, if it does exist, nulling the resolution ‘level-0’ location field and forming ‘S_FREE_NEW’=‘S_FREE’+‘Sy’, and determining if ‘S_FREE_NEW’ is greater than ‘Sx’, if yes, storing ‘x’, if not, repeating said step of ascertaining for a next least-recently-used object ‘y’.
Claim 26
Dependent Claim
103 words
A method as recited in claim 17 , wherein object ‘y’ is a particular multiresolution object, said method further comprising: determining if a resolution ‘level-1’ version of object ‘y’ exists in the cache, if it does exist, freeing a level-1 space for the resolution ‘level-0’ version, nulling the CDE for object ‘y’ for the resolution ‘level-0’ version, increasing ‘S_FREE’ to ‘S_FREE’_NEW 2 =‘S_FREE’+‘Sy’_SIZE_ 0 ; setting a CDE for object ‘y’ to be a most-recently-used object, and determining if ‘S_FREE_NEW 2 ’ is greater than ‘Sx’, if yes, storing ‘x’, if not, repeating said step of ascertaining for a next least-recently-used object ‘y’.
Claim 27
Dependent Claim
123 words
A method as recited in claim 19 , wherein a resolution 1 version was not found, said method further comprising: applying a resolution reducing procedure associated with a ‘type’ associated with object ‘y’ to the resolution ‘level-0’ version of object ‘y’, thereby generating a resolution ‘level-1’ version of object ‘y’; freeing an amount of space equal to ‘y’_RES_ 0 in the cache, and nulling the resolution ‘level-0’ location; storing object ‘y’ in a resolution level version ‘y’_RES_ 1 in the cache; setting a resolution 1 location field in the CDE to point to said level-0 location; increasing ‘S_FREE’ to ‘S_FREE’ plus ‘Sy’_SIZE_ 0 ; decreasing ‘S_FREE’ to ‘S_FREE’ minus ‘Sy’_SIZE_ 1 ; and setting a ‘y’_CDE for object ‘y’ to be the most-recently-used.
Claim 28
Dependent Claim
99 words
An article of manufacture comprising: a computer usable medium having computer readable program code means embodied therein for conserving an amount of cache space in a system that stores a plurality of objects in a cache, the computer readable program code means in said article of manufacture comprising: computer readable program code means for causing a computer to effect: generating at least one small size lower resolution version of at least one of the objects; saving the lower resolution version in the cache; and discarding a large size higher resolution version of said at least one of the objects.
Claim 29
Dependent Claim
99 words
An article of manufacture comprising: a computer usable medium having computer readable program code means embodied therein for conserving an amount of cache space in a system that stores a plurality of objects in a cache, the computer readable program code means in said article of manufacture comprising: computer readable program code means for causing a computer to effect: generating at least one small size lower resolution version of at least one of the objects; saving the lower resolution version in the cache; and discarding a large size higher resolution version of said at least one of the objects.
Claim 30
Dependent Claim
47 words
An article as recited in claim 21 , wherein each of the objects has a first resolution of data, further causing the computer to effect, determining when the first resolution of data of one of the objects is deleted in accordance with a first resolution deletion policy.
Claim 31
Dependent Claim
50 words
An article as recited in claim 21 , wherein each of said objects has a low resolution of data, further causing the computer to effect an action for determining when said low resolution of data of one of said objects is deleted in accordance with a low resolution deletion policy.
Claim 32
Dependent Claim
83 words
A program storage device readable by machine, tangibly embodying a program of instructions executable by the machine to perform method steps for conserving the effective cache space in a system that stores a plurality of objects in a cache, said method step comprising generating at least one small size lower resolution version of at least one of the objects; saving the lower resolution version in the cache; and discarding a large size higher resolution version of said at least one of the objects.
Claim 33
Dependent Claim
83 words
A program storage device readable by machine, tangibly embodying a program of instructions executable by the machine to perform method steps for conserving the effective cache space in a system that stores a plurality of objects in a cache, said method step comprising generating at least one small size lower resolution version of at least one of the objects; saving the lower resolution version in the cache; and discarding a large size higher resolution version of said at least one of the objects.
Claim 34
Dependent Claim
70 words
A device as recited in claim 24 , wherein each of the objects has a first resolution of data taking up a first amount of cache, the method further comprising: determining when the first resolution of data of one of said objects is deleted in accordance with a first resolution deletion policy to increase an amount of cache free space to make room for another object not in the cache.
Claim 35
Dependent Claim
49 words
A device as recited in claim 24 , wherein each of said objects has a small size low resolution of data, said method further comprising determining when the small size low resolution of data of one of the objects is deleted in accordance with a low resolution deletion policy.
Claim 36
Dependent Claim
202 words
A method as recited in claim 2 , used in order to create space to store a new object x not currently in the cache, wherein each multiresolution object may initially be stored in a plurality of resolution versions, the method comprising: determining if a particular cache directory entry corresponding to a lowest priority object y at the end of the ordered list is a multiresolution object, if y is a multiresolution object, ascertaining if more than one resolution version of object y is currently stored, and if more than one resolution version of object y is currently stored, removing a current highest resolution version of said object y to form an amount of free space, setting the cache directory entry for object y to be a highest priority object by placing the cache directory entry for object y at the beginning of the ordered list, and calculating if the amount of free space is sufficient for storing said object x, if not, repeating the steps of determining, ascertaining, removing, setting and calculating for a next lowest priority object in the ordered-list, until the amount of free space is sufficient for storing object x, and storing object x within the free space.
Claim 37
Dependent Claim
187 words
A method as recited in claim 27 , further comprising: if only one resolution version of object y is currently stored, generating and storing a reduced resolution version of object y, removing the current high resolution version of object y to increase the amount of free space, setting the cache directory entry for object y to be the highest priority object by placing the cache directory entry at the beginning of the ordered list, and calculating if the newly increased free space is sufficient for storing said object x, if not, repeating the steps of determining, ascertaining, generating, removing, setting, placing and calculating for the next lowest priority object in the ordered list of cache directory entries, until the amount of free space is sufficient for storing object x, and storing object x within the free space, if y is not a multiresolution object, removing said object y and calculating if the newly increased amount of free space is sufficient for storing said object x, if not, repeating the steps of determining, ascertaining, generating, removing, and calculating for the next lowest priority used object in the ordered-list.
Claim 38
Independent Claim
98 words
A method for conserving an amount of cache space in a system that stores a plurality of objects in a cache, the method comprising: generating at least one small memory size version of at least one of the objects, the small size version taking up a first amount of cache space; saving the smaller memory size version in the cache; and discarding a high memory size version of said at least one of the objects, the high memory size version taking up a second amount of cache space which is greater than the first amount of cache space.
Claim 39
Independent Claim
98 words
A method for conserving an amount of cache space in a system that stores a plurality of objects in a cache, the method comprising: generating at least one small memory size version of at least one of the objects, the small size version taking up a first amount of cache space; saving the smaller memory size version in the cache; and discarding a high memory size version of said at least one of the objects, the high memory size version taking up a second amount of cache space which is greater than the first amount of cache space.
Claim 40
Independent Claim
59 words
A method for managing a plurality of objects in a cache, the method comprising: creating a cache directory having entries for any non-multiresolution objects that may exist and for at least one multiresolution object, each cache directory entry having pointers to all existing resolution versions of the at least one multiresolution object; and forming an ordered-list of the entries.
Claim 41
Independent Claim
59 words
A method for managing a plurality of objects in a cache, the method comprising: creating a cache directory having entries for any non-multiresolution objects that may exist and for at least one multiresolution object, each cache directory entry having pointers to all existing resolution versions of the at least one multiresolution object; and forming an ordered-list of the entries.
Claim 42
Dependent Claim
18 words
A method as recited in claim 30 , wherein the ordered-list is formed according to an ordering criterion.
Claim 43
Dependent Claim
26 words
A method as recited in claim 31 , wherein the ordering criterion is based on a last usage time at which a particular object was used.
Claim 44
Dependent Claim
196 words
A method as recited in claim 32 , used in order to create space to store a new object x not currently in the cache, wherein each multiresolution object may initially be stored in a plurality of resolution versions each using a different amount of cache space, the method comprising: determining if a particular cache directory entry corresponding to a least-recently-used object y at the end of the ordered list is a multiresolution object, if y is a multiresolution object, ascertaining if more than one resolution version of the object is currently stored, and if more than one resolution version is currently stored, removing the current highest resolution version of said object y, setting the cache directory entry for object y to be the most-recently-used object by placing the cache directory entry at the beginning of the ordered list, and calculating if an amount of newly increased free space is sufficient for storing said object x, if not, repeating the steps of determining, ascertaining, removing, setting and calculating for the next least-recently-used object in the ordered-list, until the amount of free space is sufficient for storing object x, and storing object x within the free space.
Claim 45
Dependent Claim
193 words
A method as recited in claim 33 , further comprising: if only one resolution version is currently stored, generating and storing a reduced resolution version of object y, removing the current high resolution version of said object y, setting the cache directory entry for object y to be the most-recently-used object by placing the cache directory entry at the beginning of the ordered list, and calculating if the newly increased free space is sufficient for storing said object x, if not, repeating the steps of determining, ascertaining, generating, removing, setting and calculating for the next least-recently-used object in the ordered list of cache directory entries, until the amount of free space is sufficient for storing object x, and storing object x within the free space, if y is not a multiresolution object, removing said object y and calculating if the newly increased free space is sufficient for storing said object x, if not, repeating the steps of determining, ascertaining, generating, removing, setting and calculating for the next least-recently used object in the ordered-list, until the amount of free space is sufficient for storing object x, and storing object x within the free space.
Claim 46
Independent Claim
31 words
An apparatus comprising: a cache, a cache manager which includes a cache space conserver to conserve an amount of cache space used to store a plurality of objects in the cache.
Claim 47
Independent Claim
31 words
An apparatus comprising: a cache, a cache manager which includes a cache space conserver to conserve an amount of cache space used to store a plurality of objects in the cache.
Claim 48
Dependent Claim
20 words
An apparatus as recite in claim 35 , further comprising a CPU, a network object reducer, and a memory disk.
Claim 49
Dependent Claim
16 words
An apparatus as recited in claim 35 , wherein the cache further comprises a cache directory.
Claim 50
Dependent Claim
29 words
A method as recited in claim 1 , further comprising the step of forming an ordered-list of objects in accordance to a priority assigned to each of the objects.
Claim 51
Dependent Claim
20 words
A method as recited in claim 38 , wherein the priority assigned is based upon a frequency of object usage.
Claim 52
Dependent Claim
142 words
A method as recited in claim 1 , further comprising: storing each object in a current resolution version, ascertaining if a lowest priority object y is a multiresolution object, and if object y is a multiresolution object, generating and storing a reduced resolution version of object y, removing the current resolution version of object y to create an amount of free space in the memory, setting a priority for object y to be a highest priority, and determining if the amount of free space is sufficient for storing object x, if the amount of free space is not sufficient for storing object x, repeating the steps of ascertaining, generating, removing, setting and determining for a next lowest priority object in the memory, until the amount of free space is sufficient for storing object x, and storing object x within the free space.
Claim 53
Dependent Claim
96 words
A method as recited in claim 40 , further comprising: if y is not a multiresolution object, removing object y from the memory to increase the amount of free space, and determining if the amount of free space is sufficient for storing object x, if the amount of free space is not sufficient for storing object x, repeating the steps of ascertaining, generating, removing, setting and determining for a next lowest priority object in the memory until the amount of free space is sufficient for storing object x, and storing object x within the free space.
Claim 54
Dependent Claim
26 words
A method as recited in claim 40 , whereing the step of ascertaining includes forming a memory directory entry of an ordered list of the objects.
Claim 55
Dependent Claim
123 words
A method as recited in claim 1 , further comprising: ascertaining if a least-recently-used object is a multiresolution object, and if object y is a multiresolution object, generating and storing a reduced resolution version of object y, removing a current high resolution version of object y from the memory so as to create an amount of free space, setting a priority for object y to be a most-recently-used object, and determining if the amount of free space is sufficient for storing object x, if not, repeating the steps of ascertaining, generating, removing, setting and determining for a next least-recently-used object in the memory, until the amount of free space is sufficient for storing object x, and storing object x within the free space.
Claim 56
Dependent Claim
15 words
A method as recited in claim 1 , wherein the memory is a temporary buffer.
Claim 57
Dependent Claim
14 words
A method as recited in claim 1 , wherein the memory is a cache.
References Cited (Backward Citations)
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2005-01-28 | 2005-07-30 | 2006-01-29 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2009-01-28 | 2009-07-30 | 2010-01-29 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2013-01-28 | 2013-07-30 | 2014-01-29 | $7700.00 | Window Closed / Lapsed |