Patent US2632936A successfully refreshed from Google Patents.
Patent US5860153A successfully refreshed from Google Patents.
US5860153A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Memory efficient directory coherency maintenance
Assignee: Oracle America Inc
•
Filing: 1995-11-22
•
Granted: 1999-01-12
•
Expires: 2015-11-22
Abstract
Abstract A bit map is maintained by a provider object of a name server to keep track of names cached by a cache object of the client. The bit map is indexed by performing a hash of the name. When a name is looked up by the server on behalf of a client, the server hashes the name, and sets the bit in the bit map indexed by the result of the hash modulo the size of the bit map. The result of the hash is returned to the client and is stored with the entry in the cache. A bit "set" in the bit map indicates that the client caches at least one name that hashes into the bit. When the server invalidates a name, a hash of the name to be invalidated is used to find the corresponding bit in the bit mask. If the bit is set, the server sends an invalidation request to the client. The invalidation request includes the result of the hash, and the size of the provider's bit map. The client invalidates all entries that hash into the specified bit in the bitmap on the server. Alternatively, the invalidation request also includes the name to be invalidated and the client invalidates only the entry that matches the name.
Inventors
- 👤 Vladimir Matena
- 👤 Jose M. Bernabeu-Auban
- 👤 Yousef A. Khalidi
- 👤 Kenneth W. Shirriff
- 👤 Moti N. Thadani
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-31 06:46
CPC Classifications
H; H04; H04L; H04L61/00; G; G06; G06F; G06F12/00; G06F12/02; G06F12/08; G06F12/0802; G06F12/0806; G06F12/0815; G06F12/0817
Claims Analysis
Total Claims: 22
Claim 1
Independent Claim
171 words
A directory coherence mechanism for use in a client-server system having a server and a plurality of clients, said mechanism comprising: a cache configured to store name information; and a name server configured to provide the name information to the cache, the name server having a data structure and setting a hash indicator of the data structure when providing the cache name information of a particular object name, the hash indicator having a hash index calculated by hashing the particular object name, wherein if the name server receives a directory invalidate request for a name to be invalidated, the name server hashes the name to be invalidated and if a data of the data structure indexed by the hash of the name to be invalidated has been set, the name server orders the cache to invalidate all cached name information associated with the data indexed by the hash of the name to be invalidated and the name server resets the data indexed by the hash of the name to be invalidated.
Claim 2
Dependent Claim
171 words
A directory coherence mechanism for use in a client-server system having a server and a plurality of clients, said mechanism comprising: a cache configured to store name information; and a name server configured to provide the name information to the cache, the name server having a data structure and setting a hash indicator of the data structure when providing the cache name information of a particular object name, the hash indicator having a hash index calculated by hashing the particular object name, wherein if the name server receives a directory invalidate request for a name to be invalidated, the name server hashes the name to be invalidated and if a data of the data structure indexed by the hash of the name to be invalidated has been set, the name server orders the cache to invalidate all cached name information associated with the data indexed by the hash of the name to be invalidated and the name server resets the data indexed by the hash of the name to be invalidated.
Claim 3
Dependent Claim
42 words
The directory coherence mechanism as set forth in claim 1, wherein the cache indicates to a name server cache when all cached object name information associated with the data indexed by the hash of the name to be invalidated has been invalidated.
Claim 4
Dependent Claim
51 words
The directory coherence mechanism as set forth in claim 2, wherein the name server indicates a successful invalidation after the cache has indicated to the name server that all of the cached name information associated with the data indexed by the hash of the name to be invalidated has been invalidated.
Claim 5
Dependent Claim
49 words
The directory coherence mechanism as set forth in claim 1, wherein the name server indicates a successful invalidation if the name server hashes the name to be invalidated and the data of the data structure indexed by the hash of the name to be invalidated has not been set.
Claim 6
Dependent Claim
123 words
The directory coherence mechanism as set forth in claim 1, wherein if the name server receives a directory invalidate request for a name to be invalidated, the name server hashes the name to be invalidated and, if a data of the data structure indexed by the hash of the name to be invalidated has been set, the name server orders the cache to invalidate cached name information associated with the name to be invalidated, then, if the cache indicates that the cached name information associated with the name to be invalidated has been invalidated, the name server resets said data indexed by the hash of the name to be invalidated only if there are no other cached entries mapping to the same data.
Claim 7
Dependent Claim
45 words
The directory coherence mechanism as set forth in claim 5, wherein the cache indicates to the name server when the cached name information associated with the name to be invalidated has been invalidated and when no name information associated with the name has been cached.
Claim 8
Dependent Claim
42 words
The directory coherence mechanism as set forth in claim 6, wherein the name server indicates a successful invalidation after the cache has indicated to the name server that the cached name information associated with the name to be invalidated has been invalidated.
Claim 9
Dependent Claim
49 words
The directory coherence mechanism as set forth in claim 5, wherein the name server indicates a successful invalidation if the name server hashes the name to be invalidated and the data of the data structure indexed by the hash of the name to be invalidated has not been set.
Claim 10
Dependent Claim
31 words
The directory coherence mechanism as set forth in claim 5, wherein said data structure is a bit map, said data is a bit and said hash indicator is a hash bit.
Claim 11
Independent Claim
157 words
A method for maintaining directory coherence, comprising the steps of: caching name information; providing the name information from a name server to a cache, the name server having a data structure and setting a hash indicator of the data structure when providing the name information of a particular name, the hash indicator having a hash index calculated by hashing the particular name; hashing the name to be invalidated, said hashing performed by the name server, if the name server receives a directory invalidate request for a name to be invalidated; and if a data of the data structure indexed by the hash of the name to be invalidated has been set, said method ordering the cache to invalidate all cached name information associated with said data indexed by the hash of the name to be invalidated and resetting the data indexed by the hash of the name to be invalidated, said ordering performed by the name server.
Claim 12
Independent Claim
157 words
A method for maintaining directory coherence, comprising the steps of: caching name information; providing the name information from a name server to a cache, the name server having a data structure and setting a hash indicator of the data structure when providing the name information of a particular name, the hash indicator having a hash index calculated by hashing the particular name; hashing the name to be invalidated, said hashing performed by the name server, if the name server receives a directory invalidate request for a name to be invalidated; and if a data of the data structure indexed by the hash of the name to be invalidated has been set, said method ordering the cache to invalidate all cached name information associated with said data indexed by the hash of the name to be invalidated and resetting the data indexed by the hash of the name to be invalidated, said ordering performed by the name server.
Claim 13
Dependent Claim
116 words
The method as set forth in claim 10, wherein if the name server receives a directory invalidate request for a name to be invalidated, further comprising the steps of: hashing the name to be invalidated, said hashing performed by the name server; if a data of the data structure indexed by the hash of the name to be invalidated has been set, said method ordering the cache to invalidate all cached name information associated with the data indexed by the hash of the name to be invalidated, said ordering performed by the name server; and resetting a bit indexed by the hash of an object name to be invalidated, said resetting performed by the name server.
Claim 14
Dependent Claim
46 words
The method as set forth in claim 11, further comprising the step of: indicating to the name server when all cached name information associated with the data indexed by the hash of the name to be invalidated has been invalidated, said indicating performed by the cache.
Claim 15
Dependent Claim
57 words
The method as set forth in claim 12, further comprising the step of: indicating a successful invalidation after the cache has indicated to the name server that all of the cached name information associated with the data indexed by the hash of the name to be invalidated has been invalidated, said indicating performed by the name server.
Claim 16
Dependent Claim
55 words
The method as set forth in claim 11, further comprising the step of: indicating a successful invalidation if the name server hashes the name to be invalidated and the data of the data structure indexed by the hash of the name to be invalidated has not been set, said indicating performed by the name server.
Claim 17
Dependent Claim
117 words
The method as set forth in claim 10, wherein if the name server receives a directory invalidate request for a name to be invalidated, the method further comprises the steps of: hashing the name to be invalidated; if a data of the data structure indexed by the hash of the name to be invalidated has been set, ordering the cache to invalidate cached name information associated with the name to be invalidated, said ordering performed by the name server; and then, if the cache indicates that the cached name information associated with the name to be invalidated has been invalidated, resetting a bit hashed for the name to be invalidated, said indicating performed by the name server.
Claim 18
Dependent Claim
39 words
The method as set forth in claim 15, further comprising the steps of: indicating to the name server when the cached name information associated with the name to be invalidated has been invalidated, said indicating performed by the cache.
Claim 19
Dependent Claim
48 words
The method as set forth in claim 16, further comprising the step of: indicating a successful invalidation after the cache has indicated to the name server that the cached name information associated with the name to be invalidated has been invalidated, said indicating performed by the name server.
Claim 20
Dependent Claim
55 words
The method as set forth in claim 15, further comprising the step of: indicating a successful invalidation if the name server hashes the name to be invalidated and the data of the data structure indexed by the hash of the name to be invalidated has not been set, said indicating performed by the name server.
Claim 21
Dependent Claim
38 words
The method as set forth in claim 15, further comprising the step of: keeping the data set if there are entries left in the cache that map to the same data, said keeping performed by the name server.
Claim 22
Dependent Claim
29 words
The method as set forth in claim 12 wherein said data is a bit, said data structure is a bit map and said hash indicator is a hash bit.
References Cited (Backward Citations)
US4887204A
Cited
US5151989A
Cited
US5265245A
Cited
US5495608A
Cited
US5537574A
Cited
US5434914A
Cited
US5604882A
Cited
US5581704A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2002-01-11 | 2002-07-13 | 2003-01-12 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2006-01-11 | 2006-07-13 | 2007-01-12 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2010-01-11 | 2010-07-13 | 2011-01-12 | $7700.00 | Window Closed / Lapsed |