发明授权
US08838944B2 Fast concurrent array-based stacks, queues and deques using fetch-and-increment-bounded, fetch-and-decrement-bounded and store-on-twin synchronization primitives
有权
快速并发的基于阵列的堆栈，使用获取和增量限制，获取和减少限制和存储双同步原语的队列和字符串
- 专利标题： Fast concurrent array-based stacks, queues and deques using fetch-and-increment-bounded, fetch-and-decrement-bounded and store-on-twin synchronization primitives
- 专利标题（中）： 快速并发的基于阵列的堆栈，使用获取和增量限制，获取和减少限制和存储双同步原语的队列和字符串
-
申请号： US12564535申请日： 2009-09-22
-
公开(公告)号： US08838944B2公开(公告)日： 2014-09-16
- 发明人: Dong Chen , Alana Gara , Philip Heidelberger , Sameer Kumar , Martin Ohmacht , Burkhard Steinmacher-Burow , Robert Wisniewski
- 申请人： Dong Chen , Alana Gara , Philip Heidelberger , Sameer Kumar , Martin Ohmacht , Burkhard Steinmacher-Burow , Robert Wisniewski
- 申请人地址： US NY Armonk
- 专利权人： International Business Machines Corporation
- 当前专利权人： International Business Machines Corporation
- 当前专利权人地址： US NY Armonk
- 代理机构： Scully, Scott, Murphy & Presser, P.C.
- 代理商 Daniel P. Morris, Esq.
- 主分类号： G06F9/52
- IPC分类号： G06F9/52 ; G06F9/54
摘要：
Implementation primitives for concurrent array-based stacks, queues, double-ended queues (deques) and wrapped deques are provided. In one aspect, each element of the stack, queue, deque or wrapped deque data structure has its own ticket lock, allowing multiple threads to concurrently use multiple elements of the data structure and thus achieving high performance. In another aspect, new synchronization primitives FetchAndIncrementBounded (Counter, Bound) and FetchAndDecrementBounded (Counter, Bound) are implemented. These primitives can be implemented in hardware and thus promise a very fast throughput for queues, stacks and double-ended queues.
公开/授权文献
信息查询
