Sciweavers

9 search results - page 1 / 2
» Efficient implementation of mutual exclusion locks in large ...
Sort
View
PPOPP
1995
ACM
13 years 8 months ago
High Performance Synchronization Algorithms for Multiprogrammed Multiprocessors
Scalable busy-wait synchronization algorithms are essential for achieving good parallel program performance on large scale multiprocessors. Such algorithms include mutual exclusio...
Robert W. Wisniewski, Leonidas I. Kontothanassis, ...
ISCA
1993
IEEE
137views Hardware» more  ISCA 1993»
13 years 9 months ago
Transactional Memory: Architectural Support for Lock-Free Data Structures
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...
Maurice Herlihy, J. Eliot B. Moss
JPDC
2006
111views more  JPDC 2006»
13 years 4 months ago
Designing irregular parallel algorithms with mutual exclusion and lock-free protocols
Irregular parallel algorithms pose a significant challenge for achieving high performance because of the difficulty predicting memory access patterns or execution paths. Within an...
Guojing Cong, David A. Bader
RTCSA
2000
IEEE
13 years 8 months ago
Space efficient wait-free buffer sharing in multiprocessor real-time systems based on timing information
A space efficient wait-free algorithm for implementing a shared buffer for real-time multiprocessor systems is presented in this paper. The commonly used method to implement share...
Håkan Sundell, Philippas Tsigas