Sciweavers

6 search results - page 1 / 2
» Making Random Choices Invisible to the Scheduler
Sort
View
CONCUR
2007
Springer
13 years 11 months ago
Making Random Choices Invisible to the Scheduler
Abstract. When dealing with process calculi and automata which express both nondeterministic and probabilistic behavior, it is customary to introduce the notion of scheduler to res...
Konstantinos Chatzikokolakis, Catuscia Palamidessi
ENTCS
2002
88views more  ENTCS 2002»
13 years 5 months ago
Testing Concurrent Java Programs using Randomized Scheduling
The difficulty of finding errors caused by unexpected interleavings of threads in concurrent programs is well known. Model checkers can pinpoint such errors and verify correctness...
Scott D. Stoller
AIPS
2009
13 years 6 months ago
Flexible Execution of Plans with Choice
Dynamic plan execution strategies allow an autonomous agent to respond to uncertainties while improving robustness and reducing the need for an overly conservative plan. Executive...
Patrick R. Conrad, Julie A. Shah, Brian C. William...
EUROSYS
2006
ACM
14 years 2 months ago
On the road to recovery: restoring data after disasters
—Restoring data operations after a disaster is a daunting task: how should recovery be performed to minimize data loss and application downtime? Administrators are under consider...
Kimberly Keeton, Dirk Beyer 0002, Ernesto Brau, Ar...
INFOCOM
2009
IEEE
14 years 17 hour ago
Enhanced Spatial Reuse in Multi-Cell WLANs
—When IEEE 802.11 access points (APs) share the same channel in a multi-cell WLAN, their downlink transmissions can interfere. Typically, an AP whose scheduled transmission to so...
Thomas Bonald, Ali Ibrahim, James Roberts