The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.

The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.

Date of Patent:
Aug. 11, 2015

Filed:

Nov. 17, 2008
Applicants:

Yuxi Bai, Kirkland, WA (US);

Alexandre Olegovich Verbitski, Woodinville, WA (US);

Ming-chuan Wu, Bellevue, WA (US);

Inventors:

Yuxi Bai, Kirkland, WA (US);

Alexandre Olegovich Verbitski, Woodinville, WA (US);

Ming-Chuan Wu, Bellevue, WA (US);

Assignee:
Attorneys:
Primary Examiner:
Assistant Examiner:
Int. Cl.
CPC ...
G06Q 10/06 (2012.01); G06F 9/52 (2006.01);
U.S. Cl.
CPC ...
G06Q 10/06 (2013.01); G06Q 10/063 (2013.01); G06F 9/52 (2013.01); Y10S 707/00 (2013.01);
Abstract

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.


Find Patent Forward Citations

Loading…