120 search results - page 8 / 24 » The Weak Mutual Exclusion problem |
ETFA
2005
IEEE
14 years 1 months ago
2005
IEEE
In this paper we deal with the problem of determining a set of decentralized controllers for P/T nets that are able to impose a given global specification on the net behaviour. M...
WABI
2007
Springer
14 years 1 months ago
2007
Springer
The aim of the motif recognition problem is to detect a set of mutually similar subsequences within a collection of biological sequences. The weak motif recognition problem on DNA ...
BIRTHDAY
2003
Springer
14 years 21 days ago
2003
Springer
Abstract. Bounded fairness is a stronger notion than ordinary eventuality-based fairness, one that guarantees occurrence of an event within a fixed number of occurrences of anothe...
ISCA
1993
IEEE
13 years 11 months ago
1993
IEEE
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...
RTCSA
2000
IEEE
13 years 11 months ago
2000
IEEE
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...