-
1.发明申请FAST CONCURRENT ARRAY-BASED STACKS, QUEUES AND DEQUES USING FETCH-AND-INCREMENT-BOUNDED AND A TICKET LOCK PER ELEMENT 有权基于阵列的快速堆叠堆栈，使用边界加密和每个元素的门票锁定的排队和排序公开(公告)号：US20110072241A1
公开(公告)日：2011-03-24
申请号：US12564535
申请日：2009-09-22
申请人： 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
CPC分类号： G06F9/52 , G06F9/3004 , G06F9/30087 , G06F9/526 , G06F9/546
摘要： 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.
摘要翻译： 提供了基于并发数组的堆栈，队列，双端队列（deques）和包装deques的实现原语。 在一个方面，堆栈，队列，deque或包装的deque数据结构的每个元素都有自己的票证锁定，允许多个线程同时使用数据结构的多个元素，从而实现高性能。 在另一方面，实现新的同步原语FetchAndIncrementBounded（Counter，Bound）和FetchAndDecrementBounded（Counter，Bound）。 这些原语可以在硬件中实现，从而为队列，堆栈和双端队列提供非常快的吞吐量。
-
2.发明授权Fast concurrent array-based stacks, queues and deques using fetch-and-increment-bounded, fetch-and-decrement-bounded and store-on-twin synchronization primitives 有权快速并发的基于阵列的堆栈，使用获取和增量限制，获取和减少限制和存储双同步原语的队列和字符串公开(公告)号：US08838944B2
公开(公告)日：2014-09-16
申请号：US12564535
申请日：2009-09-22
申请人： 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
CPC分类号： G06F9/52 , G06F9/3004 , G06F9/30087 , G06F9/526 , G06F9/546
摘要： 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.
摘要翻译： 提供了基于并发数组的堆栈，队列，双端队列（deques）和包装deques的实现原语。 在一个方面，堆栈，队列，deque或包装的deque数据结构的每个元素都有自己的票证锁定，允许多个线程同时使用数据结构的多个元素，从而实现高性能。 在另一方面，实现新的同步原语FetchAndIncrementBounded（Counter，Bound）和FetchAndDecrementBounded（Counter，Bound）。 这些原语可以在硬件中实现，从而为队列，堆栈和双端队列提供非常快的吞吐量。
-
搜索结果
2 条记录 (耗时 0.023 秒)
