Home → Magazine Archive → December 2018 (Vol. 61, No. 12) → December 2018 (Vol. 61, No. 12) → Abstract

Technical Perspective: Node Replication Divides to Conquer

By Tim Harris

Communications of the ACM, Vol. 61 No. 12, Page 96

Shared-memory concurrent data structures are pervasive. They are used explicitly in server software such as in-memory databases and key-value stores. Even when software is built with a programing model based around shared-nothing computation or side-effect-free functional programming, we find concurrent data structures in the heart of the implementation in the operating system, the language runtime system, or the garbage collector.

Designing these high-performance concurrent data structures has long been recognized as a difficult task. Not only is it challenging to develop an implementation that is correct, but the underlying hardware is a moving target; techniques that work well on one system may work poorly on another, and techniques that work on today's systems may work poorly on tomorrow's.


No entries found