| Abstract |
|---|
| Serialisation can occur when many simultaneous accesses are made to a single node in a distributed shared-memory multiprocessor. In this paper we investigate routing read requests via an intermediate proxy node (where combining is used to reduce contention) in the presence of finite message buffers. We present a reactive approach, which invokes proxying only when contention occurs, and does not require the programmer or compiler to mark widely-shared data. Simulation results show that the hot-spot contention which occurs in pathological examples can be dramatically reduced, while performance on well-behaved applications is unaffected. |
| Contact |
| Sarah Talbot PhD Student,,Department of Computing,,Imperial College,,180 Queen's Gate, ,London,,SW7 2BZ, ,United Kingdom, s.talbot@doc.ic.ac.uk |