Cross network bridging
US-12119958-B2 · Oct 15, 2024 · US
Obstruction-free data structures and mechanisms with separable and/or substitutable contention management mechanisms
US9052944B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-9052944-B2 |
| Application number | US-10679005-A |
| Country | US |
| Kind code | B2 |
| Filing date | Apr 15, 2005 |
| Priority date | Jul 16, 2002 |
| Publication date | Jun 9, 2015 |
| Grant date | Jun 9, 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.
We teach a powerful approach that greatly simplifies the design of non-blocking mechanisms and data structures, in part by, largely separate the issues of correctness and progress. At a high level, our methodology includes designing an “obstruction-free” implementation of the desired mechanism or data structure, which may then be combined with a contention management mechanism whose role is to facilitate the conditions under which progress of the obstruction-free implementation is assured. In general, the contention management mechanism is separable semantically from an obstruction-free concurrent shared/sharable object implementation to which it is/may be applied. In some cases, the contention management mechanism may actually be coded separately from the obstruction-free implementation. We elaborate herein on the notions of obstruction-freedom and contention management, and various possibilities for combining the two. In addition, we include description of some exemplary applications to particular concurrent software mechanisms and data structure implementations.
First claim
Opening claim text (preview).
What is claimed is: 1. A method of operating a computing machine, the method comprising: creating an instance of a data structure defined using one or more programming language constructs, wherein the data structure instance includes at least one transactional location for which ownership is mediated through use of a single-target synchronization primitive; storing the contents of the data structure instance in a shared memory that is accessible to a plurality of concurrently ex…
Assignees
Inventors
Classifications
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 US9052944B2 cover?
- We teach a powerful approach that greatly simplifies the design of non-blocking mechanisms and data structures, in part by, largely separate the issues of correctness and progress. At a high level, our methodology includes designing an “obstruction-free” implementation of the desired mechanism or data structure, which may then be combined with a contention management mechanism whose role is to …
- Who is the assignee on this patent?
- Moir Mark S, Luchangco Victor M, Herlihy Maurice, and 1 more
- What technology area does this patent fall under?
- Primary CPC classification G06F9/466. Mapped technology areas include Physics.
- When was this patent published?
- Publication date Tue Jun 09 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).