Sciweavers

370 search results - page 1 / 74
» The perfectly synchronized round-based model of distributed ...
Sort
View
IANDC
2007
84views more  IANDC 2007»
13 years 4 months ago
The perfectly synchronized round-based model of distributed computing
ectly-synchronized round-based model provides the powerful abstraction of op failures with atomic and synchronous message delivery. This abstraction makes distributed programming ...
Carole Delporte-Gallet, Hugues Fauconnier, Rachid ...
ICECCS
2010
IEEE
161views Hardware» more  ICECCS 2010»
13 years 5 months ago
Model Checking Round-Based Distributed Algorithms
—In the field of distributed computing, there are many round-based algorithms to solve fundamental problems, such as leader election and distributed consensus. Due to the nature...
Xin An, Jun Pang
GLVLSI
2007
IEEE
141views VLSI» more  GLVLSI 2007»
13 years 8 months ago
A synchronization algorithm for local temporal refinements in perfectly synchronous models with nested feedback loops
he abstract and simple computation and communication mechanism in the synchronous computational model it is easy to simulate synchronous systems and to apply formal verification m...
Tarvo Raudvere, Ingo Sander, Axel Jantsch
ICCI
1993
13 years 9 months ago
The Perfect and Imperfect Clocks Approach to Performance Analysis of Basic Timestamp Ordering in Distributed Databases
Locking and timestamping are two popular approaches to concurrency control in databases systems. Although more than a dozen analytic performance studies of locking techniques have...
Christos Bouras, Paul G. Spirakis
IEEEARES
2009
IEEE
13 years 11 months ago
Perfect Failure Detection in the Partitioned Synchronous Distributed System Model
—In this paper we show that it is possible to implement a perfect failure detector P (one that detects all faulty processes if and only if those processes failed) in a non-synchr...
Raimundo José de Araújo Macêdo...