System and method for weak lock allowing force preemption by high priority thread

Patent metadata

Field	Value
Publication number	US-11409559-B2
Application number	US-201916662875-A
Country	US
Kind code	B2
Filing date	Oct 24, 2019
Priority date	Oct 24, 2019
Publication date	Aug 9, 2022
Grant date	Aug 9, 2022

Abstract

A method, computer program product, and computer system for identifying, by a computing device, an attribute of a lock object associated with data. It may be determined that the lock object is acquired by a first task performing a transaction with the data based upon, at least in part, the attribute of the lock object. The lock object may be acquired by a second task by releasing the lock object from the first task prior to the transaction with the data being completed, wherein the second task is a higher priority task than the first task.

First claim

What is claimed is:

1. A computer-implemented method comprising:
identifying, by a computing device, an attribute of a lock object associated with data;
determining that the lock object is acquired by a first task performing a transaction with the data based upon, at least in part, the attribute of the lock object; and
acquiring the lock object by a second task by releasing the lock object from the first task prior to the transaction with the data being completed, wherein the second task is a higher priority task than the first task, wherein acquiring the lock object by the second task includes aborting the transaction being performed by the first task, wherein the high priority task is configured to verify consistency of data when the transaction being performed by the first task is aborted, wherein timing of when the lock object is acquired by the second task is based upon, at least in part, whether the lock object is an exclusive lock or a shared lock, wherein acquiring the lock object by the second task includes:
rolling back the transaction being performed by the first task; and
adding one or more calls to points in a process flow of the transaction where rolling back the transaction would not create an unacceptable waiting time for a third task with a higher priority than the first task to acquire the lock object.

2. The computer-implemented method of claim 1 wherein acquiring the lock object by the second task includes adding one or more calls to points in a process flow of the transaction where aborting the first task would not impact data consistency.

3. The computer-implemented method of claim 1 further comprising repeating the transaction by the first task after the second task releases the lock object.

4. The computer-implemented method of claim 1 wherein an attribute of the lock object associated with data includes a lock synchronization object that is configured to be used with a synchronization object, wherein the synchronization object includes one or more of an RW-Lock, a Barrier, and a Semaphore.

5. A computer program product residing on a non-transitory computer readable storage medium having a plurality of instructions stored thereon which, when executed across one or more processors, causes at least a portion of the one or more processors to perform operations comprising:
identifying an attribute of a lock object associated with data;
determining that the lock object is acquired by a first task performing a transaction with the data based upon, at least in part, the attribute of the lock object; and
acquiring the lock object by a second task by releasing the lock object from the first task prior to the transaction with the data being completed, wherein the second task is a higher priority task than the first task, wherein acquiring the lock object by the second task includes aborting the transaction being performed by the first task, wherein the high priority task is configured to verify consistency of data when the transaction being performed by the first task is aborted, wherein timing of when the lock object is acquired by the second task is based upon, at least in part, whether the lock object is an exclusive lock or a shared lock, wherein acquiring the lock object by the second task includes:
rolling back the transaction being performed by the first task; and
adding one or more calls to points in a process flow of the transaction where rolling back the transaction would not create an unacceptable waiting time for a third task with a higher priority than the first task to acquire the lock object.

6. The computer program product of claim 5 wherein acquiring the lock object by the second task includes adding one or more calls to points in a process flow of the transaction where aborting the first task would not impact data consistency.

7. The computer program product of claim 5 wherein the operations further comprise repeating the transaction by the first task after the second task releases the lock object.

8. A computing system including one or more processors and one or more memories configured to perform operations comprising:
identifying an attribute of a lock object associated with data;
determining that the lock object is acquired by a first task performing a transaction with the data based upon, at least in part, the attribute of the lock object; and
acquiring the lock object by a second task by releasing the lock object from the first task prior to the transaction with the data being completed, wherein the second task is a higher priority task than the first task, wherein acquiring the lock object by the second task includes aborting the transaction being performed by the first task, wherein the high priority task is configured to verify consistency of data when the transaction being performed by the first task is aborted, wherein timing of when the lock object is acquired by the second task is based upon, at least in part, whether the lock object is an exclusive lock or a shared lock, wherein acquiring the lock object by the second task includes:
rolling back the transaction being performed by the first task; and
adding one or more calls to points in a process flow of the transaction where rolling back the transaction would not create an unacceptable waiting time for a third task with a higher priority than the first task to acquire the lock object.

9. The computing system of claim 8 wherein acquiring the lock object by the second task includes adding one or more calls to points in a process flow of the transaction where aborting the first task would not impact data consistency.

Assignees

• Emc Ip Holding Co Llc

Inventors

• Shveidel Vladimir
• Gazit Ronen

Classifications

• G06F9/4881 Primary

  Scheduling strategies for dispatcher, e.g. round robin, multi-level priority queues · CPC title

• G06F9/526

  Mutual exclusion algorithms · CPC title