A shared data structure is lock-free if its operations do not require mutual exclusion. If one process is interrupted in the middle of an operation, other processes will not be pr...
Synchronization in distributed systems is expensive because, in general, threads must stall to obtain a lock or to operate on volatile data. Transactional memory, on the other hand...
Writing concurrent programs is notoriously difficult, and is of increasing practical importance. A particular source of concern is n correctly-implemented concurrency abstraction...
Tim Harris, Simon Marlow, Simon L. Peyton Jones, M...
Major hardware and software vendors are curious about transactional memory (TM), but are understandably cautious about committing to hardware changes. Our thesis is that deconstru...
Mark D. Hill, Derek Hower, Kevin E. Moore, Michael...
One of the main challenges to harness the potential of Cloud computing is the design of programming models that simplify the development of large-scale parallel applications and t...