Activities and Findings

Our research on wait-free synchronization and locking protocols has produced the following algorithms:

1. A time optimal wait-free algorithm for the wellknown multiwriter snapshot problem [Jay05]
2. An efficient wait-free algorithm for implementing a multiword LL/SC object [JP05]
3. An efficient wait-free algorithm for computing tree functions in time proportional to the depth of the tree [Jay02]
4. Constant time wait-free implementation of LL/SC instructions from compare&swap [JP03]
5. Efficient design of FCFS abortable locks [Jay03]
6. Design of FCFS group mutual exclusion locks [JPT03]
7. Transformation of mutual exclusion algorithms into fast mutual exclusion algorithms [JPN05]