How to implement any concurrent data structure.

Autor:	Calciu, Irina, Sen, Siddhartha, Balakrishnan, Mahesh, Aguilera, Marcos K.
Předmět:	DATA structures ELECTRONIC data processing DATA analysis DATA analysis software NON-uniform memory access COMPUTER architecture
Zdroj:	Communications of the ACM; Dec2018, Vol. 61 Issue 12, p97-105, 9p, 3 Color Photographs
Abstrakt:	We propose a method called Node Replication (NR) to implement any concurrent data structure. The method takes a single-threaded implementation of a data structure and automatically transforms it into a concurrent (thread-safe) implementation. The result is designed to work well with and harness the power of modern servers, which are complex Non-Uniform Memory Access (NUMA) machines with many processor sockets and subtle performance characteristics. Using NR requires no expertise in concurrent data structure design, and the result is free of concurrency bugs. NR represents a paradigm shift of how concurrent algorithms are developed: rather than designing for a data structure, we design for the architecture. [ABSTRACT FROM AUTHOR]
Databáze:	Complementary Index
Externí odkaz:	Zobrazit plný text záznamu Plný text ve formátu HTML
Nepřihlášeným uživatelům se plný text nezobrazuje	K zobrazení výsledku je třeba se přihlásit.