Loading...
Please wait, while we are loading the content...
Similar Documents
Scalable Concurrent Counting (1995)
| Content Provider | CiteSeerX |
|---|---|
| Author | Herlihy, Maurice Lim, Beng-Hong Shavit, Nir |
| Abstract | The notion of counting is central to a number of basic multiprocessor coordination problems, such as dynamic load balancing, barrier synchronization, and concurrent data structure design. In this paper, we investigate the scalability of a variety of counting techniques for large-scale multiprocessors. We compare counting techniques based on: (1) spin locks, (2) message passing, (3) distributed queues, (4) software combining trees, and (5) counting networks. Our comparison is based on a series of simple benchmarks on a simulated 64-processor Alewife machine, a distributed-memory multiprocessor currently under development at MIT. Although locking techniques are known to perform well on small-scale, bus-based multiprocessors, serialization limits performance and contention can degrade performance. Both counting networks and combining trees substantially outperform the other methods by avoiding serialization and alleviating contention, although combining tree throughput is more sensitive t... |
| File Format | |
| Volume Number | 13 |
| Journal | ACM Transactions on Computer Systems |
| Language | English |
| Publisher Date | 1995-01-01 |
| Access Restriction | Open |
| Subject Keyword | Scalable Concurrent Counting Bus-based Multiprocessor Concurrent Data Structure Design Tree Throughput Spin Lock Simulated 64-processor Alewife Machine Counting Network Large-scale Multiprocessor Basic Multiprocessor Coordination Problem Simple Benchmark Message Passing Serialization Limit Performance Dynamic Load Balancing Distributed-memory Multiprocessor |
| Content Type | Text |
| Resource Type | Article |
