Patent US5515537A successfully refreshed from Google Patents.
← Back to Patent Explorer
US5515537A Expired / Lapsed US ⏱️ 0.0 years remaining

Real-time distributed data base locking manager

Assignee: United States Department of the Navy
•
Filing: 1993-06-01
•
Granted: 1996-05-07
•
Expires: 2013-06-01
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A method of data sharing between processors on the same network utilizes en migration for providing a data locking mechanism. A token migrates between the processors for each original data item and its replicas. Only the processor having possession of the token can perform certain operations such as updating and transmitting this updated information to the other processors. Two different queuing arrangements are described for giving up or retaining possession of the token when a processor, not in possession of the token makes a request for the token.

Inventors

  • 👤 Carlos M. Tavares
  • 👤 Durval M. Tavares

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-05 17:37
CPC Classifications
G; G06; G06F; G06F13/00; G06F13/14; G06F13/36; G06F13/368; G06F13/37

Claims Analysis

Total Claims: 17
Claim 1
Independent Claim 276 words
A method of managing the power of individual processors to perform processes including managing data sharing between processors on a network by a locking and unlocking of data items, utilizing a migrating token, where the processors has at least one data item, each of said at least one data item being an original or replicated data item, comprising the steps of: forming the following series of operational states within each processor, with each processor being in one of said operational states and transitioning from one state to another upon certain happenings, a token being the sole entitlement for each of said processors to transmit data on said network, and said token migrates among each of said processors, the states being: (A) the absence of said token, (B) the token being at the processor but not in use, (C) requesting the token from another processor, (D) the token being assigned to a process at the processor but no other requests are pending, (E) the token having at least one request pending and the token being in the processor; controlling the transitioning from one state to another such that all except one processor is in one of states (A) and (C), and said one processor is in one of states (B), (D), and (E); controlling the transitioning from one state to another such that each processor in state (A) can transition to state (C) upon requesting and not receiving said token, so that a plurality Of processors can be in state (C) at the same time; and said processors in each of states (A), (B), (C), (D), and (E) can read verify a data item without changing states.
Claim 2
Independent Claim 276 words
A method of managing the power of individual processors to perform processes including managing data sharing between processors on a network by a locking and unlocking of data items, utilizing a migrating token, where the processors has at least one data item, each of said at least one data item being an original or replicated data item, comprising the steps of: forming the following series of operational states within each processor, with each processor being in one of said operational states and transitioning from one state to another upon certain happenings, a token being the sole entitlement for each of said processors to transmit data on said network, and said token migrates among each of said processors, the states being: (A) the absence of said token, (B) the token being at the processor but not in use, (C) requesting the token from another processor, (D) the token being assigned to a process at the processor but no other requests are pending, (E) the token having at least one request pending and the token being in the processor; controlling the transitioning from one state to another such that all except one processor is in one of states (A) and (C), and said one processor is in one of states (B), (D), and (E); controlling the transitioning from one state to another such that each processor in state (A) can transition to state (C) upon requesting and not receiving said token, so that a plurality Of processors can be in state (C) at the same time; and said processors in each of states (A), (B), (C), (D), and (E) can read verify a data item without changing states.
Claim 3
Dependent Claim 31 words
A method according to claim 1 wherein a processor in state (A) can carry out each of the following without changing state: updating a data item; and reading a data item.
Claim 4
Dependent Claim 31 words
A method according to claim 2 wherein a processor in state (A) can transition to state (B) comprising the step of transitioning to state (B) upon requesting and receiving said token.
Claim 5
Dependent Claim 25 words
A method according to claim 3 wherein exactly one processor in state (A) transitions to state (B) comprising the step of token initializing by configuration.
Claim 6
Dependent Claim 25 words
A method according to claim 1 wherein a processor in state (B) can carry out the process of reading a data item without changing state.
Claim 7
Dependent Claim 38 words
A method according to claim 5 wherein a processor in state (B) transitions to another state comprising the step of transitioning to state (A) on Token Request By Network by passing ownership of the token to another processor.
Claim 8
Dependent Claim 40 words
A method according to claim 6 wherein a processor in state (B) transitions to another state comprising the step of transitioning to state (E) on Request Queued For Token by granting a lock to a process queued for the token.
Claim 9
Dependent Claim 40 words
A method according to claim 7 wherein a processor in state (B) transitions to another state comprising the step of transitioning to state (D) on Token Request when one process on the processor in state (B) locks a data item.
Claim 10
Dependent Claim 41 words
A method according to claim 1 wherein a processor in state (C) can carry out each of the following processes without changing state: updating a data item; placing a new token request for said migrating token; and reading a data item.
Claim 11
Dependent Claim 29 words
A method according to claim 9 wherein a processor in state (C) transitions to another state comprising the step of transitioning to state (B) upon receiving said migrating token.
Claim 12
Dependent Claim 54 words
A method according to claim 1 wherein a processor in state (D) can carry out each of the following processes without changing state: queuing a Token Requested process attempting a lock when the token is held by a Token Not Yet Released process; queuing a Token Request By Network; and reading a data item.
Claim 13
Dependent Claim 35 words
A method according to claim 11 wherein a processor in state (D) transitions to another state comprising the step of moving to state (B) on Token Release by removing a last lock on the token.
Claim 14
Dependent Claim 44 words
A method according to claim 12 wherein a processor in state (D) transitions to another state comprising the step of transitioning to state (E) on Request Queued For Token to start granting locks to processes queued for the token as Token Release transitions occur.
Claim 15
Dependent Claim 61 words
A method according to claim 1 wherein a processor in state (E) can carry out each of the following processes without changing state: queuing the Token Request By Network; queuing a process attempting a lock when the token is held by another process; granting a lock to a next process in the queue by Token Release; and reading a data item.
Claim 16
Dependent Claim 39 words
A method according to claim 14 wherein a processor in state (E) transitions to another state comprising the step of transitioning to state (D) on Last Request Removed From Token Queue when a last process is granted a lock.
Claim 17
Dependent Claim 46 words
A method according to claim 15 wherein a processor in state (E) transitions to another state comprising the step of transitioning to state (A) on Request in Queue Is From Network by passing ownership of the token to one of the other processors on the network.

References Cited (Backward Citations)

US5072373A Cited
US4748560A Cited
US5053946A Cited
US5175851A Cited
US5301333A Cited
US5155725A Cited
US5247684A Cited
US5307487A Cited
US5377353A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1999-05-07 1999-11-06 2000-05-07 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2003-05-07 2003-11-06 2004-05-07 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2007-05-07 2007-11-06 2008-05-07 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag