File tree Expand file tree Collapse file tree 2 files changed +5
-5
lines changed Expand file tree Collapse file tree 2 files changed +5
-5
lines changed Original file line number Diff line number Diff line change 1
1
# Quiescent-State-Based Reclamation
2
2
3
3
Designing high throughput server is hard. One of the problems we often
4
- encounter is how to update internal data-structure that sustain mostly
4
+ encounter is how to update internal data structures that sustain mostly
5
5
read traffic.
6
6
7
- Tom Hard and PE McKenney conducted a thorough comparison of most
8
- performant implementations within this scheme. One of them is a
9
- cooperative algorithm called "Quiescent-State-Based Reclamation".
7
+ Paul E McKenney conducted a thorough comparison of most performant
8
+ implementations within this scheme. One of them is a cooperative
9
+ algorithm called "Quiescent-State-Based Reclamation".
Original file line number Diff line number Diff line change @@ -259,7 +259,7 @@ static void qsbr_writer(unsigned target)
259
259
260
260
mock_remove_obj (obj );
261
261
262
- /* QSBR synchronisation barrier. */
262
+ /* QSBR synchronization barrier. */
263
263
target_epoch = qsbr_barrier (qsbr );
264
264
while (!qsbr_sync (qsbr , target_epoch )) {
265
265
SPINLOCK_BACKOFF (count );
You can’t perform that action at this time.
0 commit comments