65 search results - page 6 / 13 » When does a correct mutual exclusion algorithm guarantee mut... |
USENIX
2007
13 years 9 months ago
2007
Virtual machine (VM) memory allocation and VM consolidation can benefit from the prediction of VM page miss rate at each candidate memory size. Such prediction is challenging for...
SOFSEM
2009
Springer
14 years 4 months ago
2009
Springer
We introduce the first process algebra with non-blocking reading actions for modelling concurrent asynchronous systems. We study the impact this new kind of actions has on fairnes...
ENTCS
2002
13 years 7 months ago
2002
The perceived advantages of distributed systems, such as increased reliability and availability, are o set by the increased complexity of developing such applications. The develop...
TSE
1998
13 years 7 months ago
1998
—Masking fault-tolerance guarantees that programs continually satisfy their specification in the presence of faults. By way of contrast, nonmasking fault-tolerance does not guara...
RTSS
2005
IEEE
14 years 28 days ago
2005
IEEE
nt a new concurrency control abstraction for real-time systems called preemptible atomic regions (PARs). PARs a transactional mechanism that improves upon lock-based mutual exclus...