108 search results - page 6 / 22 » Approximate Synchrony: An Abstraction for Distributed Almost... |
FORMATS
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. Quantitative model checking computes the probability values of a given property quantifying over all possible schedulers. It turns out that maximum and minimum probabilit...
114
click to vote
IPPS
2010
IEEE
14 years 7 months ago
2010
IEEE
Abstract--The now commonplace multi-core chips have introduced, by design, a deep hierarchy of memory and cache banks within parallel computers as a tradeoff between the user frien...
83
Voted
CDC
2009
IEEE
15 years 2 months ago
2009
IEEE
Abstract— Despite its simplicity (two controllers and otherwise LQG), Witsenhausen’s counterexample is one of the long-standing open problems in stochastic distributed control....
OPODIS
2008
14 years 11 months ago
2008
Abstract. Consensus is a fundamental building block used to solve many practical problems that appear on reliable distributed systems. In spite of the fact that consensus is being ...
PODC
1995
ACM
15 years 1 months ago
1995
ACM
The Horus system supports a communication architecture ats protocols as instances of an abstract data type. This approach encourages developers to partition complex protocols into...