175 research outputs found
Fisheye Consistency: Keeping Data in Synch in a Georeplicated World
Over the last thirty years, numerous consistency conditions for replicated
data have been proposed and implemented. Popular examples of such conditions
include linearizability (or atomicity), sequential consistency, causal
consistency, and eventual consistency. These consistency conditions are usually
defined independently from the computing entities (nodes) that manipulate the
replicated data; i.e., they do not take into account how computing entities
might be linked to one another, or geographically distributed. To address this
lack, as a first contribution, this paper introduces the notion of proximity
graph between computing nodes. If two nodes are connected in this graph, their
operations must satisfy a strong consistency condition, while the operations
invoked by other nodes are allowed to satisfy a weaker condition. The second
contribution is the use of such a graph to provide a generic approach to the
hybridization of data consistency conditions into the same system. We
illustrate this approach on sequential consistency and causal consistency, and
present a model in which all data operations are causally consistent, while
operations by neighboring processes in the proximity graph are sequentially
consistent. The third contribution of the paper is the design and the proof of
a distributed algorithm based on this proximity graph, which combines
sequential consistency and causal consistency (the resulting condition is
called fisheye consistency). In doing so the paper not only extends the domain
of consistency conditions, but provides a generic provably correct solution of
direct relevance to modern georeplicated systems
Two-Bit Messages are Sufficient to Implement Atomic Read/Write Registers in Crash-prone Systems
Atomic registers are certainly the most basic objects of computing science.
Their implementation on top of an n-process asynchronous message-passing system
has received a lot of attention. It has been shown that t \textless{} n/2
(where t is the maximal number of processes that may crash) is a necessary and
sufficient requirement to build an atomic register on top of a crash-prone
asynchronous message-passing system. Considering such a context, this paper
presents an algorithm which implements a single-writer multi-reader atomic
register with four message types only, and where no message needs to carry
control information in addition to its type. Hence, two bits are sufficient to
capture all the control information carried by all the implementation messages.
Moreover, the messages of two types need to carry a data value while the
messages of the two other types carry no value at all. As far as we know, this
algorithm is the first with such an optimality property on the size of control
information carried by messages. It is also particularly efficient from a time
complexity point of view
Self-stabilization Overhead: an Experimental Case Study on Coded Atomic Storage
Shared memory emulation can be used as a fault-tolerant and highly available
distributed storage solution or as a low-level synchronization primitive.
Attiya, Bar-Noy, and Dolev were the first to propose a single-writer,
multi-reader linearizable register emulation where the register is replicated
to all servers. Recently, Cadambe et al. proposed the Coded Atomic Storage
(CAS) algorithm, which uses erasure coding for achieving data redundancy with
much lower communication cost than previous algorithmic solutions.
Although CAS can tolerate server crashes, it was not designed to recover from
unexpected, transient faults, without the need of external (human)
intervention. In this respect, Dolev, Petig, and Schiller have recently
developed a self-stabilizing version of CAS, which we call CASSS. As one would
expect, self-stabilization does not come as a free lunch; it introduces,
mainly, communication overhead for detecting inconsistencies and stale
information. So, one would wonder whether the overhead introduced by
self-stabilization would nullify the gain of erasure coding.
To answer this question, we have implemented and experimentally evaluated the
CASSS algorithm on PlanetLab; a planetary scale distributed infrastructure. The
evaluation shows that our implementation of CASSS scales very well in terms of
the number of servers, the number of concurrent clients, as well as the size of
the replicated object. More importantly, it shows (a) to have only a constant
overhead compared to the traditional CAS algorithm (which we also implement)
and (b) the recovery period (after the last occurrence of a transient fault) is
as fast as a few client (read/write) operations. Our results suggest that CASSS
does not significantly impact efficiency while dealing with automatic recovery
from transient faults and bounded size of needed resources
On Byzantine Broadcast in Loosely Connected Networks
We consider the problem of reliably broadcasting information in a multihop
asynchronous network that is subject to Byzantine failures. Most existing
approaches give conditions for perfect reliable broadcast (all correct nodes
deliver the authentic message and nothing else), but they require a highly
connected network. An approach giving only probabilistic guarantees (correct
nodes deliver the authentic message with high probability) was recently
proposed for loosely connected networks, such as grids and tori. Yet, the
proposed solution requires a specific initialization (that includes global
knowledge) of each node, which may be difficult or impossible to guarantee in
self-organizing networks - for instance, a wireless sensor network, especially
if they are prone to Byzantine failures. In this paper, we propose a new
protocol offering guarantees for loosely connected networks that does not
require such global knowledge dependent initialization. In more details, we
give a methodology to determine whether a set of nodes will always deliver the
authentic message, in any execution. Then, we give conditions for perfect
reliable broadcast in a torus network. Finally, we provide experimental
evaluation for our solution, and determine the number of randomly distributed
Byzantine failures than can be tolerated, for a given correct broadcast
probability.Comment: 1
Synthesis and Characterization of Grafted Chitosan Blending with Polyvinyl alcohol / Nanocomposite and Study Biological Activity
The study of biopolymers and their derivative materials had received a considerable degree of attention from researchers in the preparation of novel material. Biopolymers and their derivatives have a wide range of applications as a result of their bio-compatibility, bio-degradability and non-toxicity. In this paper, chitosan reacted with different aldehydes(2,4 –dichloro- benzaldehyde or 2-methyl benzaldehyde), different ketones (4-bromoacetophenone or 3-aminoacetophenone) to produce chitosan schiff base (1-4) . Chitosan schiff base (1-4) reacted with glutaric acid or adipic acid in acidic media in distilled water according to the steps of Fischer and Speier to produce compounds (5-12) respectively. Grafted chitosan (5-12) blended with synthetic polymer PVA to produce compounds (13-20), then these polymers were blended with nano Ag by using a hotplate stirrer for 60 min to produce nanocomposites. The synthesized polymers were identified via spectral analysis techniques, including FTIR , 1H-NMR and scanning electron microscope (SEM). Finally, studied anti-bacterial activities of some of the prepared polymers
UWB through-the-Wall Propagation
The propagation of ultrawideband (UWB) signals in indoor environments is an important issue with significant impacts on the future direction and scope of UWB technology. The propagation of UWB signals is governed, among other things, by the properties of materials in the propagation medium. The information on electromagnetic properties of construction materials in the UWB frequency range would provide valuable insights into the appreciation of the capabilities and limitations of UWB technology. Although electromagnetic properties of certain construction materials over relatively narrow bandwidths in GHz frequency ranges are available, ultrawideband characterisation of most typical construction materials for UWB communication purposes has not been reported. In narrowband wireless communications, only the magnitude of insertion loss has been the quantity of interest. But for UWB signals, in addition to the magnitude, the phase information is an equally important factor that needs to be accounted for. In fact, UWB signals not only suffer attenuation when propagating through walls, but also suffer distortion due to the dispersive properties of the walls. This research examines propagation through typical construction materials and their ultrawideband characterisation. Ten commonly used construction materials are chosen for this investigation. Results for the dielectric constant and loss tangent of the materials over the UWB frequency range are presented. Accuracy of the measured results is discussed and distortions of UWB signals due to the dispersive properties of wall materials are addressed
UWB through-the-Wall Propagation
The propagation of ultrawideband (UWB) signals in indoor environments is an important issue with significant impacts on the future direction and scope of UWB technology. The propagation of UWB signals is governed, among other things, by the properties of materials in the propagation medium. The information on electromagnetic properties of construction materials in the UWB frequency range would provide valuable insights into the appreciation of the capabilities and limitations of UWB technology. Although electromagnetic properties of certain construction materials over relatively narrow bandwidths in GHz frequency ranges are available, ultrawideband characterisation of most typical construction materials for UWB communication purposes has not been reported. In narrowband wireless communications, only the magnitude of insertion loss has been the quantity of interest. But for UWB signals, in addition to the magnitude, the phase information is an equally important factor that needs to be accounted for. In fact, UWB signals not only suffer attenuation when propagating through walls, but also suffer distortion due to the dispersive properties of the walls. This research examines propagation through typical construction materials and their ultrawideband characterisation. Ten commonly used construction materials are chosen for this investigation. Results for the dielectric constant and loss tangent of the materials over the UWB frequency range are presented. Accuracy of the measured results is discussed and distortions of UWB signals due to the dispersive properties of wall materials are addressed
On the nature of progress
15th International Conference, OPODIS 2011, Toulouse, France, December 13-16, 2011. ProceedingsWe identify a simple relationship that unifies seemingly unrelated progress conditions ranging from the deadlock-free and starvation-free properties common to lock-based systems, to non-blocking conditions such as obstruction-freedom, lock-freedom, and wait-freedom.
Properties can be classified along two dimensions based on the demands they make on the operating system scheduler. A gap in the classification reveals a new non-blocking progress condition, weaker than obstruction-freedom, which we call clash-freedom.
The classification provides an intuitively-appealing explanation why programmers continue to devise data structures that mix both blocking and non-blocking progress conditions. It also explains why the wait-free property is a natural basis for the consensus hierarchy: a theory of shared-memory computation requires an independent progress condition, not one that makes demands of the operating system scheduler
Path-loss and time dispersion parameters for indoor UWB propagation
The propagation of ultra wideband (UWB) signals in indoor environments is an important issue with significant impacts on the future direction and scope of the UWB technology and its applications. The objective of this work is to obtain a better assessment of the potentials of UWB indoor communications by characterizing the UWB indoor communication channels. Channel characterization refers to extracting the channel parameters from measured data. An indoor UWB measurement campaign is undertaken. Time-domain indoor propagation measurements using pulses with less than 100 ps width are carried out. Typical indoor scenarios, including line-of-sight (LOS), non-line-of-sight (NLOS), room-to-room, within-the-room, and hallways, are considered. Results for indoor propagation measurements are presented for local power delay profiles (local PDP) and small-scale averaged power delay profiles (SSA-PDP). Site-specific trends and general observations are discussed. The results for path-loss exponent and time dispersion parameters are presented
Oscillatory and Asymptotic Behavior of Nonlinear Functional Dynamic Equations of Third Order
The purpose of this work is to derive sufficient conditions for the oscillation of all solutions of the third-order functional dynamic equation p2ξφγ2p1ξφγ1yΔξΔΔ+pξφβygξ=0, on a time scale T. In addition, we present some Hille-type conditions for generalized third-order dynamic equations that improve and extend significant contributions reported in the literature without imposing time-scale restrictions. An example is given to demonstrate the essential results. © 2022 Taher S. Hassan et al
- …