A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Filters
The Immediate Dependency Relation: An Optimal Way to Ensure Causal Group Communication
[chapter]
2004
Annual Review of Scalable Computing
In order to demonstrate the feasibility of its implementation, we present an optimal broadcast causal protocol inspired by the IDR relation. ...
, including in the overlapping group case. ...
Causal ordering delivery in group communication presents two cases: the broadcast case (one group) and the multi-group case that includes overlapping groups. ...
doi:10.1142/9789812794727_0003
fatcat:x7oprkdtnrbonfaspoltuahwra
An algorithm for minimally latent global virtual time
1993
ACM SIGSIM Simulation Digest
This approach eliminates the avalanche e ect because the collection phase is spread out over time, and it allows for regular and timely GVT updates. ...
It is a global function that is computed many times during the course of a simulation. A small GVT latency (delay between its occurrence and detection) allows for more e cient use of resources. ...
Acknowledgments We would like to thank the referees of this paper for providing insightful comments. ...
doi:10.1145/174134.158464
fatcat:do7qreo75rdrddat6is6ct474q
An algorithm for minimally latent global virtual time
1993
Proceedings of the seventh workshop on Parallel and distributed simulation - PADS '93
This approach eliminates the avalanche e ect because the collection phase is spread out over time, and it allows for regular and timely GVT updates. ...
It is a global function that is computed many times during the course of a simulation. A small GVT latency (delay between its occurrence and detection) allows for more e cient use of resources. ...
Acknowledgments We would like to thank the referees of this paper for providing insightful comments. ...
doi:10.1145/158459.158464
fatcat:ky45zkozybem3jajuzupjgrraq
Total order broadcast and multicast algorithms
2004
ACM Computing Surveys
This article proposes a classification of total order broadcast and multicast algorithms based on their ordering mechanisms, and addresses a number of other important issues. ...
The article discusses algorithms for both the synchronous and the asynchronous system models, and studies the respective properties and behavior of the different algorithms. X. Défago et al. ...
Schneider, and the anonymous reviewers. We are also thankful to Judith Steeh for proofreading this text. ...
doi:10.1145/1041680.1041682
fatcat:hl2evvvb2zfrlhzzcrnyctdcfe
BFT Protocols for Heterogeneous Resource Allocations in Distributed SDN Control Plane
[article]
2019
arXiv
pre-print
A state-hashing approach which ensures causally ordered switch reconfigurations is proposed, that enables an opportunistic RSM execution without relying on strict sequencing. ...
Distributed Software Defined Networking (SDN) controllers aim to solve the issue of single-point-of-failure and improve the scalability of the control plane. ...
We are grateful to Nemanja Deric, Arled Papa, Johannes Riedl and the reviewers for their useful feedback and comments. ...
arXiv:1902.02519v2
fatcat:cg6wqc67yja55n3buhhubtdwge
MSCar: Enhancing Message Sequence Charts with Interactivity for Analysing (Automotive) Communication Sequences
2008
Electronic Communications of the EASST
Our approach proposes the enrichment of large scaled MSCs with novel interaction and design techniques used in the field of information visualization. ...
Instead of the common application to specify system behaviours our interactive MSCs are aimed at exploring and diagnosing dependencies in network communication in general and, regarding our special requirements ...
The ordering of the MSCar elements is loosely based on causal relationships instead of bounding it to an accurate mapping of time intervals. ...
doi:10.14279/tuj.eceasst.13.170
dblp:journals/eceasst/Sedlmair08
fatcat:26427ps44zbzffduow65qn5mva
Testing the Quantitative Spacetime Hypothesis using Artificial Narrative Comprehension (II) : Establishing the Geometry of Invariant Concepts, Themes, and Namespaces
[article]
2020
arXiv
pre-print
Applying this to episodic natural language data, one may obtain a graph geometry associated with the decomposition, which is a direct encoding of spacetime relationships for the events. ...
Given a pool of observations selected from a sensor stream, input data can be robustly represented, via a multiscale process, in terms of invariant concepts, and themes. ...
Some agents are in non-ordered phase (liquid) while others are rigidly ordered (solid phase). ...
arXiv:2010.08125v1
fatcat:xq7mzptaxjc7virpgsdv53siyi
Asynchronous Lease-Based Replication of Software Transactional Memory
[chapter]
2010
Lecture Notes in Computer Science
source of inspiration for the design of replication schemes for transactional memory. ...
Among the plethora of database replication schemes, recent approaches based on Atomic Broadcast (AB) [18] and distributed certification procedures [31, 23, 30] , appear to be particularly attractive for ...
This allows to totally overlap the execution of the OAB for the lease request and the URB for the lease granted, reducing to three communication steps the latency of the lease acquisition phase. ...
doi:10.1007/978-3-642-16955-7_19
fatcat:ymnjs2um4jcjzo5utiefd4kniq
Tools and Techniques for Adding Fault Tolerance to Distributed and Parallel Programs
[chapter]
1993
Parallel Computing on Distributed Memory Multiprocessors
Acknowledgements My thinking and appreciation of the material presented in this paper have benefited from discussions with my colleagues Ken Birman, Keith Marnullo, Fred Schuieider and Sam Toueg over the ...
Causal Broadcast 'Jnly broadcasts that are causally related are received in the same order. ...
Atom/Broadcast All broadcasts to the group are received in the same order by all of its /thembers. This is true even for broadcasts that are causally unrelated. ...
doi:10.1007/978-3-642-58066-6_13
fatcat:hvjqxtubgjeojpnksoezm7aku4
Fault-Tolerant Consensus with an Abstract MAC Layer
[article]
2018
arXiv
pre-print
Our algorithms work for any number of failures, require no advance knowledge of the network participants or network size, and guarantee termination with high probability after a number of broadcasts that ...
These are the first known fault-tolerant consensus algorithms for this model. ...
for the total number of broadcasts by u. ...
arXiv:1810.02848v1
fatcat:ivju23e7o5c33a4ymavnheyeti
On Barriers and the Gap between Active and Passive Replication (Full Version)
[article]
2015
arXiv
pre-print
Passive replication, which has been recently used in the popular ZooKeeper coordination system, can be naturally built on top of the primary-order atomic broadcast primitive. ...
Active replication is commonly built on top of the atomic broadcast primitive. ...
Acknowledgement We would like to express our gratitude to Alex Shraer and Benjamin Reed for the insightful feedback on previous versions of the paper, and to Daniel Gómez Ferro for helping out with the ...
arXiv:1308.2979v5
fatcat:yyjdici7gndljciqtul37rscyy
Peak Transmission Rate Resilient Crosslayer Broadcast for Body Area Networks
[article]
2017
arXiv
pre-print
existing at broadcast strategies in terms of percentage of covered nodes, energy consumption and correct reception of causally-ordered packets (i.e. packets are received in the same order as they were ...
Existing at broadcast strategies without exception start to have a drastic drop of performances for transmission rates above 11Kb/s while our cross-layer protocol performances maintains its good performances ...
Our protocol outperforms existing at broadcast strategies in terms of percentage of covered nodes, energy consumption and correct reception of causally-ordered packets (i.e. packets are received in the ...
arXiv:1702.05031v1
fatcat:wj422rhy3naypnmkg56h4a2tz4
Broadcast Strategies in Wireless Body Area Networks
2015
Proceedings of the 18th ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems - MSWiM '15
existing at broadcast strategies in terms of percentage of covered nodes, energy consumption and correct reception of causally-ordered packets (i.e. packets are received in the same order as they were ...
Existing at broadcast strategies without exception start to have a drastic drop of performances for transmission rates above 11Kb/s while our cross-layer protocol performances maintains its good performances ...
Our protocol outperforms existing at broadcast strategies in terms of percentage of covered nodes, energy consumption and correct reception of causally-ordered packets (i.e. packets are received in the ...
doi:10.1145/2811587.2811611
dblp:conf/mswim/BadreddineCPP15
fatcat:ehtotbqntrhizcnavcr7n5ibua
Creek: Low-latency, Mixed-Consistency Transactional Replication Scheme
[article]
2019
arXiv
pre-print
The execution of strongly consistent operations also stabilizes the execution order of the causally related weakly consistent operations. ...
The former is used to establish a tentative order of all operations for speculative execution, and it can tolerate network partitions. ...
For this, SMR usually relies on the atomic broadcast (AB) (also called total order broadcast) protocol to ensure that all servers deliver the same set of requests in the same order. ...
arXiv:1907.00748v2
fatcat:4yszgbqg4jfj3a5ogvfwotbb7i
Time Is of the Essence: Neural Codes, Synchronies, Oscillations, Architectures
2022
Frontiers in Computational Neuroscience
Some novel concepts for formulating an alternative, more time-centric theory of brain function are discussed. ...
The functional roles of synchronies and oscillations in candidate neural codes, including oscillatory phase-offset codes, are outlined. ...
AUTHOR CONTRIBUTIONS Both authors have made a substantial, direct, and intellectual contribution to the work, and have approved it for publication. ...
doi:10.3389/fncom.2022.898829
pmid:35814343
pmcid:PMC9262106
fatcat:fuifh37oybc2jisft4ctuuvaly
« Previous
Showing results 1 — 15 out of 7,573 results