Sciweavers

471 search results - page 24 / 95
» Automatic Mutual Exclusion
Sort
View
ISCA
1993
IEEE
137views Hardware» more  ISCA 1993»
14 years 17 days 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
PODC
1990
ACM
14 years 15 days ago
Self-Stabilization of Dynamic Systems Assuming only Read/Write Atomicity
Three self-stabilizing protocols for distributed systems in the shared memory model are presented. The first protocol is a mutual exclusion protocol for tree structured systems. T...
Shlomi Dolev, Amos Israeli, Shlomo Moran
RTCSA
2000
IEEE
14 years 20 hour 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
ACTA
2011
13 years 3 months ago
Nonatomic dual bakery algorithm with bounded tokens
A simple mutual exclusion algorithm is presented that only uses nonatomic shared variables of bounded size, and that satisfies bounded overtaking. When the shared variables behave...
Alex A. Aravind, Wim H. Hesselink
JBI
2011
283views Bioinformatics» more  JBI 2011»
13 years 3 months ago
Cross-product extensions of the Gene Ontology
The Gene Ontology is being normalized and extended to include computable logical definitions. These definitions are partitioned into mutually exclusive cross-product sets, many of...
Christopher J. Mungall, Michael Bada, Tanya Z. Ber...