Sciweavers

20 search results - page 1 / 4
» Transparent Concurrent Execution of Mutually Exclusive Alter...
Sort
View
ICDCS
1989
IEEE
13 years 9 months ago
Transparent Concurrent Execution of Mutually Exclusive Alternatives
We examine the task of concurrently computing alternative solutions to a problem. We restrict our interest to the case where only one of the solutions is needed; in this case we n...
Jonathan M. Smith, Gerald Q. Maguire Jr.
ICDCS
2005
IEEE
13 years 11 months ago
A Dynamic Group Mutual Exclusion Algorithm Using Surrogate-Quorums
The group mutual exclusion problem extends the traditional mutual exclusion problem by associating a type with each critical section. In this problem, processes requesting critica...
Ranganath Atreya, Neeraj Mittal
JPDC
2006
111views more  JPDC 2006»
13 years 5 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
PODC
2010
ACM
13 years 9 months ago
Adaptive randomized mutual exclusion in sub-logarithmic expected time
Mutual exclusion is a fundamental distributed coordination problem. Shared-memory mutual exclusion research focuses on local-spin algorithms and uses the remote memory references ...
Danny Hendler, Philipp Woelfel
ENTCS
2002
143views more  ENTCS 2002»
13 years 5 months ago
Collecting Statistics over Runtime Executions
Abstract. We present an extension to linear-time temporal logic (LTL) that combines the temporal specification with the collection of statistical data. By collecting statistics ove...
Bernd Finkbeiner, Sriram Sankaranarayanan, Henny S...