Sciweavers

165 search results - page 12 / 33
» Safety-Liveness Exclusion in Distributed Computing
Sort
View
INFOCOM
2008
IEEE
15 years 6 months ago
Fast and Distributed Computation of Schedules in Wireless Networks
—In a wireless network with node exclusive spectrum sharing, two popular schedules are maximum weight matching (MWM) schedule and maximum size matching (MSM) schedule. The former...
Supratim Deb, Karan Mangla, K. V. M. Naidu
ICDCS
2006
IEEE
15 years 5 months ago
Computing in the Presence of Timing Failures
Timing failures refer to a situation where the environment in which a system operates does not behave as expected regarding the timing assumptions, that is, the timing constraints...
Gadi Taubenfeld
ADHOCNOW
2004
Springer
15 years 5 months ago
A Rate-Adaptive MAC Protocol for Low-Power Ultra-Wide Band Ad-Hoc Networks
Recent theoretical results show that it is optimal to allow interfering sources to transmit simultaneously as long as they are outside a well-defined exclusion region around a de...
Ruben Merz, Jean-Yves Le Boudec, Jörg Widmer,...
ICDCS
2003
IEEE
15 years 4 months ago
Dynamic Module Replacement in Distributed Protocols
Dynamic module replacement — the ability to hot swap a component’s implementation at runtime — is fundamental to supporting evolutionary change in long-lived and highlyavail...
Nigamanth Sridhar, Scott M. Pike, Bruce W. Weide
HPCA
1995
IEEE
15 years 3 months ago
Implementation of Atomic Primitives on Distributed Shared Memory Multiprocessors
In this paper we consider several hardware implementations of the general-purpose atomic primitives fetch and Φ, compare and swap, load linked, and store conditionalon large-scal...
Maged M. Michael, Michael L. Scott