Title :
The performance implications of thread management alternatives for shared-memory multiprocessors
Author :
Anderson, Thomas E. ; Lazowska, Edward D. ; Levy, Henry M.
Author_Institution :
Dept. of Comput. Sci. & Eng., Washington Univ., Seattle, WA, USA
fDate :
12/1/1989 12:00:00 AM
Abstract :
An examination is made of the performance implications of several data structure and algorithm alternatives for thread management in shared-memory multiprocessors. Both experimental measurements and analytical model projections are presented. For applications with fine-grained parallelism, small differences in thread management are shown to have significant performance impact, often posing a tradeoff between throughput and latency. Per-processor data structures can be used to to improve throughput, and in some circumstances to avoid locking, improving latency as well. The method used by processors to queue for locks is also shown to affect performance significantly. Normal methods of critical resource waiting can substantially degrade performance with moderate numbers of waiting processors. The authors present an Ethernet-style backoff algorithm that largely eliminates this effect
Keywords :
data structures; multiprocessing systems; operating systems (computers); performance evaluation; critical resource waiting; data structure; fine-grained parallelism; latency; locking; performance implications; shared-memory multiprocessors; thread management; Analytical models; Data structures; Delay; Marine technology; Operating systems; Parallel processing; Sea measurements; Switches; Throughput; Yarn;
Journal_Title :
Computers, IEEE Transactions on