Sciweavers

471 search results - page 2 / 95
» Automatic Mutual Exclusion
Sort
View
DC
2010
13 years 2 months ago
Closing the complexity gap between FCFS mutual exclusion and mutual exclusion
First-Come-First-Served (FCFS) mutual exclusion (ME) is the problem of ensuring that processes attempting to concurrently access a shared resource do so one by one, in a fair order...
Robert Danek, Wojciech M. Golab
IPL
2000
59views more  IPL 2000»
13 years 7 months ago
When does a correct mutual exclusion algorithm guarantee mutual exclusion?
Leslie Lamport, Sharon E. Perl, William E. Weihl
ECBS
2006
IEEE
135views Hardware» more  ECBS 2006»
13 years 11 months ago
Model Checking Procedures for Infinite State Systems
The paper depicts experiments and results with preditraction based verification applied to infinite state Predicate abstraction is a method for automatic tion of abstract state sp...
Nikola Bogunovi, Edgar Pek
ICCAD
1994
IEEE
99views Hardware» more  ICCAD 1994»
13 years 11 months ago
Condition graphs for high-quality behavioral synthesis
Identifying mutual exclusiveness between operators during behavioral synthesis is important in order to reduce the required number of control steps or hardware resources. To impro...
Hsiao-Ping Juan, Viraphol Chaiyakul, Daniel D. Gaj...
FGCS
2010
108views more  FGCS 2010»
13 years 5 months ago
The wandering token: Congestion avoidance of a shared resource
In a distributed system where scalability is an issue, like in a GRID [5], the problem of enforcing mutual exclusion often arises in a soft form: the infrequent failure of the mut...
Augusto Ciuffoletti