System and method for controlling multidirectional operation of an elevator
US-2024425322-A1 · Dec 26, 2024 · US
Priority and cost based deadlock victim selection via static wait-for graph
US9104989B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-9104989-B2 |
| Application number | US-27231208-A |
| Country | US |
| Kind code | B2 |
| Filing date | Nov 17, 2008 |
| Priority date | Nov 17, 2008 |
| Publication date | Aug 11, 2015 |
| Grant date | Aug 11, 2015 |
How to read this patent
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
- Title
What the patent document calls the invention.
- Abstract
A short plain-language summary of the technical disclosure.
- Assignees and inventors
Who owns or filed the patent and who is credited as inventor.
- Key dates
Filing, priority, publication, and grant dates set the timeline.
- First independent claim
The legal scope of protection — read this for what is actually claimed.
- CPC / IPC classifications
Technology tags used to group this patent with similar filings.
- Citations and related patents
Prior art links and similar publications in this corpus.
Abstract
Official abstract text for this publication.
Systems and methods that enable resolving deadlock cycles by victim selection based on cost and/or priority of strongly connected components in a static wait-for graph. As such, victims can be selected by iteratively estimating total deadlock resolution cost (based on cost of strongly connected components) for remaining deadlock participants, selecting the participant with the least estimated total cost as the next victim, and reducing the wait-for graph after removing the victim vertex. The victim selection algorithm can be a cost-based greedy algorithm, wherein during each victim selection iteration, a single optimal victim is selected based on estimated remaining cost.
First claim
Opening claim text (preview).
What is claimed is: 1. A computer implemented system for efficiently resolving deadlocks between two computing threads in computer transaction processing, the system comprising: at least one processor and at least one computer-readable storage medium storing instructions executable by the at least one processor, a graph transformation component configured to create a strongly connected component (SCC) from a wait-for graph associated with deadlocks between two computing threads…
Assignees
Inventors
Classifications
Cross-Sectional Technologies · mapped topic
Physics · mapped topic
Physics · mapped topic
- G06Q10/06Primary
Physics · mapped topic
Patent family
Related publications grouped by family.
External sources
Next steps
Free tools are coming soon. Tell us what you want to track and we'll notify you.
Frequently asked questions
Answers are generated from the same data shown on this page.
- What does patent US9104989B2 cover?
- Systems and methods that enable resolving deadlock cycles by victim selection based on cost and/or priority of strongly connected components in a static wait-for graph. As such, victims can be selected by iteratively estimating total deadlock resolution cost (based on cost of strongly connected components) for remaining deadlock participants, selecting the participant with the least estimated t…
- Who is the assignee on this patent?
- Bai Yuxi, Verbitski Alexandre Olegovich, Wu Ming-Chuan, and 1 more
- What technology area does this patent fall under?
- Primary CPC classification G06Q10/06. Mapped technology areas include Physics.
- When was this patent published?
- Publication date Tue Aug 11 2015 00:00:00 GMT+0000 (Coordinated Universal Time) (B2). Legal status and post-grant events are not shown on this page.
- What related patents are in patentsdb?
- We list 8 related publications on this page (citations in our corpus or others sharing the same primary CPC).