IP Library › Granted Patent US 8,719,829
Granted Patent B2
US 8,719,829 · App. 12/700,414 · Granted May 6, 2014

Synchronizing processes in a computing resource by locking a resource for a process at a predicted time slot

Inventor: Maharaj Mukherjee (Wappinger Falls, NY)
Assignee: International Business Machines Corporation
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 8,719,829
App. No.
12/700,414
Granted
May 6, 2014
Kind
B2
Abstract

Synchronizing processes in a computer system includes creating a predictability model for a process. The predictability model establishes a predicted time slot for a resource that will be needed by the process. The method further requires establishing a predictive request for the resource at the predicted time slot. The predictive request establishes a place holder associated with the process. In addition, the method requires accessing another resource needed by the process for a period of time before the predicted time slot, submitting a request for the resource at the predicted time slot, and processing the request for the process at the resource.

Claims (13)

1. A method of synchronizing processes in a computer system, the method comprising:

creating a predictability model for a process, the predictability model establishing a predicted time slot for a resource that will be needed by the process;

establishing a predictive request for the resource at the predicted time slot, the predictive request establishing a place holder associated with the process, the place holder locking the resource for the process at the predicated time slot;

accessing another resource needed by the process for a period of time before the predicted time slot;

submitting a request for the resource at the predicted time slot;

processing the request for the process at the resource; and

releasing the place holder if the process is not ready for the resource at the predicted time slot, wherein the predictability model is established for each process P_i for j=1, 2, thru N where N represents the total number of processes and wherein a need for a resource R_k for k=1, 2, thru K, where K represents the total number of resources, is predicted for each process P_i for j=1, 2, thru N for future time slots in the future, t — 1, where 1 =j, j+1, j+2 . . . j′, where both j and j′ are limited as 1<j<j′<M

wherein, a probability density function computed as p(i, k, 1)=pdf (P_i, R_k, t — 1), where P_i is a process for j=1, 2, thru N; and R_k is a resource for k=1, 2, thru K is determined for each time slot, t_i, where 1=j,j+1, j+2, . . . j′, 1<j<j′<M.

2. The method of claim 1 , further comprising:

submitting a new request associated with the process for the resource at a new time slot.

3. The method of claim 2 , further comprising: determining a processing priority for the process; and establishing the new time slot based on the processing priority.

4. The method of claim 1 , wherein the probability density function p (i, k, 1) is computed as one of a Predictive Linear Gaussian Model, and a Predictive Gauss-Markov Model having a form comprising

ψ (t+n+1) =γ 0 Zt+Σ i=0, . . . ,n Ω(ν t+i+1 , π t+n+1 )

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Feb 4, 2010
From: MUKHERJEE, MAHARAJ
To: INTERNATIONAL BUSINESS MACHINES CORPORATION
Reel/Frame 023900/0371 →
Continuity (2)
Provisional Application 61158491 · Mar 9, 2009
Related Publication 20100229174A1 · Sep 9, 2010