June 2012
Intermediate to advanced
536 pages
14h 25m
English
This chapter shows how some important problems that seem inherently sequential can be made highly parallel by “spreading out” coordination tasks among multiple parties. What does this spreading out buy us?
To answer this question, we need to understand how to measure the performance of a concurrent data structure. There are two measures that come to mind: latency, the time it takes an individual method call to complete, and throughput, the overall rate at which method calls complete. For example, real-time applications might care more about latency, and databases might care more about throughput.
In Chapter 11 we saw how to apply distributed coordination to the EliminationBackoffStack ...
Read now
Unlock full access