Sciweavers

346 search results - page 45 / 70
» Determinizing Asynchronous Automata
Sort
View
PODC
1998
ACM
15 years 2 months ago
Probabilistic Byzantine Quorum Systems
ÐIn this paper, we explore techniques to detect Byzantine server failures in asynchronous replicated data services. Our goal is to detect arbitrary failures of data servers in a s...
Dahlia Malkhi, Michael K. Reiter, Avishai Wool, Re...
INFOCOM
1997
IEEE
15 years 2 months ago
Investigation of the IEEE 802.11 Medium Access Control (MAC)
Analysis of the drafi IEEE 802.11 wireless local area network (WLAN) standard is needed to characterize the expected performance of the standard’s ad hoc and infrastructure netw...
Brian P. Crow, Indra Widjaja, Jeong Geun Kim, Pres...
RTSS
1997
IEEE
15 years 2 months ago
Response-time guarantees in ATM networks
We present a method for providing response-time guarantees in Asynchronous Transfer Mode (ATM) networks. The method is based on traditional real-time CPU Response-Time Analysis (R...
Andreas Ermedahl, Hans Hansson, Mikael Sjödin
DSN
2006
IEEE
15 years 1 months ago
Lucky Read/Write Access to Robust Atomic Storage
This paper establishes tight bounds on the best-case time-complexity of distributed atomic read/write storage implementations that tolerate worst-case conditions. We study asynchr...
Rachid Guerraoui, Ron R. Levy, Marko Vukolic
AGP
1995
IEEE
15 years 1 months ago
Constraint Systems for Pattern Analysis of Constraint Logic-Based Languages
Pattern analysis consists in determining the shape of the set of solutions of the constraint store at some program points. Our basic claim is that pattern analyses can all be desc...
Roberto Bagnara