Abstract
In this talk, we demonstrates that the first-come first-served nature of queue-based locks make them less suitable for non-uniform communication architectures (NUCAs), for example NUMAs built from a few large nodes.

We propose the new RH lock that explores the NUCA architectures by creating a controlled unfairness in combination with a much reduced traffic compared with the test-and-set locks. A critical section guarded by the RH lock is shown to take less than half the time to execute compared with the same critical section guarded by any other lock.

Finally, we investigate the effectiveness of our new lock on a set of real applications. For example, execution time for Raytrace with 30 processors can be improved between 1.83 and 5.70 times by using the RH locks instead of other locks.

Appears in Proceedings of the 2nd Annual Workshop on Memory Performance Issues (WMPI 2002), held in conjunction with the 29th International Symposium on Computer Architecture (ISCA29), Anchorage, Alaska, USA, May 2002.

Contact: zoranr@docs.uu.se

This talk will start after Memory Characterization of the ECperf Benchmark
by Martin Karlsson

ASTEC seminar
May 16, 2002

Place: Information technology, Uppsala University
Room: 1146
Time: 14.15-15.00 (+ discussions)

Room 1146 is in building 1, floor 1, room 46 (in the northern part of the building).

There will be an extended period for discussions after the seminar in the coffe room on floor 4.

Speakers are encouraged to give an short (5 min) introduction to the subject at the begining of the talk.
Listeners are excused if they have to leave after 15.00.