Wait-free queues with multiple enqueuers and dequeuers

KoganAlex,; PetrankErez,

doi:10.1145/2038037.1941585

Cited by 39 publications

(43 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…An alternative bounded variant has also been proposed by Tsigas and Zhang (TZqueue) [92], which uses a slightly different mechanism but performs similarly due to its use of contended CAS for committing operations. It also serves as the basis for a variety of later lock-free queues including the wait-free queues presented by Kogan and Petrank [55,56], which offer even stronger progress guarantees, but with a cost that increases with each additional thread. Queues like these are also common components of relaxed queues [47,54].…”

Section: Concurrent Data Structuresmentioning

confidence: 99%

Runtime Adaptation for Autonomic Heterogeneous Computing

Scogland

Feng

2014

2014 14th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing

View full text Add to dashboard Cite

Heterogeneity is increasing across all levels of computing, with the rise of accelerators such as GPUs, FPGAs, and other coprocessors into everything from cell phones to supercomputers. More quietly it is increasing with the rise of NUMA systems, hierarchical caching, OS noise, and a myriad of other factors. As heterogeneity becomes a fact of life, efficiently managing heterogeneous compute resources is becoming a critical, and ever more complex, task. The focus of this dissertation is to lay the foundation for an autonomic system for heterogeneous computing, employing runtime adaptation to improve performance portability and performance consistency while maintaining or increasing programmability. We investigate heterogeneity arising from a myriad of factors, grouped into the dimensions of locality and capability. This work has resulted in runtime schedulers capable of automatically detecting and mitigating heterogeneity in physically homogeneous systems through MPI and adaptive coscheduling for physically heterogeneous accelerator based systems as well as a synthesis of the two to address multiple levels of heterogeneity as a coherent whole. We also discuss our current work towards the next generation of fine-grained scheduling and synchronization across heterogeneous platforms in the design of a highly-scalable and portable concurrent queue for many-core systems. Each component addresses aspects of the urgent need for automated management of the extreme and ever expanding complexity introduced by heterogeneity. I have also had the good fortune to collaborate with both Lawrence Livermore National Laboratory and Argonne National Laboratory. Experiences as an intern at each lab has had a significant effect on the final shape of my dissertation. Special thanks go to Dr. Pavan Balaji (again), Dr. Bronis de Supinski (again) and Dr. Barry Rountree. These collaborations proved to be major turning points for me, both in my research and my life as a whole.

show abstract

Section: Concurrent Data Structuresmentioning

confidence: 99%

Runtime Adaptation for Autonomic Heterogeneous Computing

Scogland

Feng

2014

2014 14th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing

View full text Add to dashboard Cite

show abstract

“…Since queues are widely used in multithreaded programs for communication, there are a wide array of studies on concurrent lock-free queues [14,16,21,23,33]. Most of these studies focus on multiple-producer and/or multiple-consumer queues.…”

Section: Related Workmentioning

confidence: 99%

“…However, these queues often have limited performance, as a large portion of work has to be done to avoid ABA problem [22]. For example, a single enqueue operation may take more than one microsecond [14].…”

Section: Related Workmentioning

confidence: 99%

“…General purpose CLF queues commonly use linked list that requires dynamic memory management and may result in poor cache locality and extra synchronization [14,16,21,31]. By exchanging data between producer and consumer through a statically allocated array, ring-buffer based queues [7,18,35] can exploit cache locality and facilitate the hardware cache prefetching.…”

Section: Related Workmentioning

confidence: 99%

“…Unfortunately, general purpose lock-free FIFOs still do not perform adequately. For example, cache-unaware lock-free FIFOs [14,16] take more than 1,000 CPU cycles to insert or extract an element. To tackle this problem, FastForward [7] and subsequent research efforts [18,35] provide single-producer-single-consumer concurrent lock-free FIFOs (abbreviated as CLF queues from here on) to support fast core-to-core communication; all of them try to avoid cache thrashing as much as possible.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

B-Queue: Efficient and Practical Queuing for Fast Core-to-Core Communication

Wang

Zhang

Tang

et al. 2012

Int J Parallel Prog

View full text Add to dashboard Cite

Core-to-core communication is critical to the effective use of multi-core processors. A number of software based concurrent lock-free queues have been proposed to address this problem. Existing solutions, however, suffer from performance degradation in real testbeds, or rely on auxiliary hardware or software timers to handle the deadlock problem when batching is used, making those solutions good in theory but difficult to use in practice. This paper describes the pros and cons of existing concurrent lock-free queues in both dummy and real testbeds and proposes BQueue, an efficient and practical single-producer-single-consumer concurrent lockfree queue that solves the deadlock problem gracefully by introducing a self-adaptive backtracking mechanism. Experiments show that in real massively-parallel applications, B-Queue is faster than FastForward and MCRingBuffer, the two state-of-the-art concurrent lock-free queues, by up to 10x and 5x, respectively. Moreover, B-Queue outperforms FastForward and MCRingBuffer in terms of stability and scalability, making it a good candidate for fast core-to-core communication on multi-core architectures.

show abstract

Micro‐transactions for concurrent data structures

Meawad

Iyer

Schoeberl

et al. 2012

Concurrency and Computation

View full text Add to dashboard Cite

SUMMARYTransactional memory is a promising technique for enforcing disciplined access to shared data in a multiprocessor system. Transactional memory simplifies the implementation of a variety of concurrent data structures. In this paper, we study the benefits of a modest, real-time aware, hardware implementation of transactional memory that we call micro-transactions. In particular, we argue that hardware support for micro-transactions allows us to efficiently implement certain data structures. Those data structures are difficult to realize with the atomic operations provided by stock hardware and provide real-time guarantees for those operations. Our main implementation platform is the Java Optimized Processor system, a field-programmable gate array (FPGA) implementation of the Java virtual machine, optimized for real-time Java. We report on the performance of data structures implemented with locks, atomic instructions, and micro-transactions. Our results suggest that transactional memory is an interesting alternative to traditional concurrency control mechanisms.

show abstract

Wait-free queues with multiple enqueuers and dequeuers

Cited by 39 publications

References 25 publications

Runtime Adaptation for Autonomic Heterogeneous Computing

Runtime Adaptation for Autonomic Heterogeneous Computing

B-Queue: Efficient and Practical Queuing for Fast Core-to-Core Communication

Micro‐transactions for concurrent data structures

Contact Info

Product

Resources

About