Name
Abstract | ||
|---|---|---|
Read-copy update (RCU) allows lock-free read-only ac- cess to data structures that are concurrently modified on SMP systems. Despite the concurrent modifications, read-only access requires neither locks nor atomic in- structions, and can often be written as if the data were unchanging, in a "CS 101" style. RCU is typically ap- plied to read-mostly linked structures that the read-side code traverses unidirectionally. Previous work has shown no clear best RCU imple- mentation for all measures of performance. This pa- per combines ideas from several RCU implementations in an attempt to create an overall best algorithm, and presents a RCU-based implementation of the System V IPC primitives, improving performance by more than an order of magnitude, while increasing code size by less than 5% (151 lines). This implementation has been ac- cepted into the Linux 2.5 kernel. |
Year | Venue | Keywords |
|---|---|---|
2003 | USENIX Annual Technical Conference, FREENIX Track | data structure |
Field | DocType | Citations |
Kernel (linear algebra),Code size,Computer science,Parallel computing,Read-copy-update,Implementation,Configfs,Data access,procfs,Operating system | Conference | 14 |
PageRank | References | Authors |
0.95 | 3 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Andrea Arcangeli | 1 | 23 | 2.93 |
| Mingming Cao | 2 | 87 | 5.18 |
| Paul E. McKenney | 3 | 279 | 30.11 |
| Dipankar Sarma | 4 | 14 | 1.29 |