A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Filters
Symmetry Reduction of Time-Triggered Ethernet Protocol
2013
Procedia Computer Science
Preserved Fulltext
This paper presents a formal verification of the TTEthernet protocol, based on an interpretation of the TTEthernet specification document, applied to two formal network scenarios that represent a real-time ...
Also, a set of precise functional requirements is derived from the TTEthernet specification document and expressed using PCTL. ...
After this, there is a chance that the second garbage message from the failing client will collide with the new clock synch coming from the switches and, after this, theres a chance that another node will ...
doi:10.1016/j.procs.2013.06.039
fatcat:fvyxgpjmezhx7eu5pm325pzzn4
Analysis and Enhancements of Leader Elections algorithms in Mobile Ad Hoc Networks
[article]
2012
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Our proposed enhancements include recovered nodes inquiring about the current leader and the use of candidates during election to reduce the overhead of starting a new election session. ...
Factors considered in our analysis are time complexity, message complexity, assumptions considered, fault tolerance and timing model. ...
Since nodes with low mobility have least chances of merging and partitioning from their current clusters. b) The algorithm uses the UID to handle the multiple diffusion computations to elect a new leader ...
arXiv:1210.1686v1
fatcat:ltxrjegqn5azrahc7dxgoi3eea
Randition: Random Blockchain Partitioning for Write Throughput
2019
2019 International Conference on High Performance Computing & Simulation (HPCS)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Byzantine fault tolerance. ...
RANDITION: RANDOM BLOCKCHAIN PARTITIONING FOR WRITE THROUGHPUT by David Nguyen This paper proposes to support dynamic runtime partitioning of Tendermint, which is an in-development state machine replication ...
Therefore, validators with more voting power will have a higher chance of being closer to the front of this queue. ...
doi:10.1109/hpcs48598.2019.9188068
dblp:conf/ieeehpcs/NguyenM19
fatcat:sdczpf5kbfeanbpoliyf7cgn6y
Frequent Subgraph Mining by Giraph Distributed System
2020
International Journal of Engineering and Advanced Technology
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
To enhance the flexibility and performance of the novel method, we carry out different optimization techniques associating it with updating different run time limits. ...
In this paper, we use the Optimized Frequent Subgraph Mining algorithm in the Giraph framework model and make a comparative study with existing different Distributed Systems. ...
Worker Graph Partitioner It determines which partition a vertex belongs to and creates/modifies the partition states (can split/merge partitions). ...
doi:10.35940/ijeat.e1128.069520
fatcat:kawk2zhhobcjjfnyf2h7bwv764
The tail at scale
2013
Communications of the ACM
Preserved Fulltext
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.
Vijaykumar for their helpful feedback on earlier drafts and presentations of this work. Numerous people at Google have worked on systems that use these techniques. ...
have a chance to react. ...
With an average of, say, 20 partitions per machine, the system can shed load in roughly 5% increments and in 1/20 th the time it would take if the system simply had a one-to-one mapping of partitions to ...
doi:10.1145/2408776.2408794
fatcat:xhaaacmgsna3bb53ir3subnxxi
Transparent Fault-Tolerance Using Intra-Machine Full-Software-Stack Replication on Commodity Multicore Hardware
2017
2017 IEEE 37th International Conference on Distributed Computing Systems (ICDCS)
Preserved Fulltext
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.
A hardware failure in one partition can be recovered by another partition taking over its functionality. ...
We have realized this vision by implementing FT-Linux, a Linux-based operating system that transparently replicates race-free, multithreaded POSIX applications on different hardware partitions of a single ...
Haibo Chen for comments on an early version of this paper. ...
doi:10.1109/icdcs.2017.140
dblp:conf/icdcs/LosaBWCR17
fatcat:s5vtbzrtyzerfgebiforfapcla
Efficient handling of sensor failures
2006
Proceedings of the 3rd workshop on Data management for sensor networks in conjunction with VLDB 2006 - DMSN '06
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf.
In this paper, we propose new techniques to deal with sensor failures based on the principles of partition and single path redundancy. ...
Sensors provide unprecedented access to a wealth of information from the physical environment in real-time. ...
By having a different parent, a cohort increases the chances of a node within the same tree to successfully forward the message. ...
doi:10.1145/1315903.1315911
dblp:conf/dmsn/BerfieldCL06
fatcat:bnhrltv7l5dpnpnvauhaouswhu
Building on Quicksand
[article]
2009
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
As the granularity of the unreliable component grows, the latency to communicate with a backup becomes unpalatable. This leads to a more relaxed model for fault tolerance. ...
There is always a chance that an untimely failure shortly after the promise results in a backup proceeding without knowledge of the commitment. Hence, nothing is guaranteed! ...
and partition tolerance. ...
arXiv:0909.1788v1
fatcat:iqjfffnb55hvxfhp43vzlqxn6e
The Attack of the Clones Against Proof-of-Authority
[article]
2019
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
We then introduce the Cloning Attack and show how to apply it to double spend in each of these protocols with a single malicious node. ...
This is why Byzantine fault tolerant consensus algorithms have gained popularity in the blockchain context for their ability to tolerate a limited number t of attackers among n participants. ...
Vincent Gramoli is a Future Fellow of the Australian Research Council. ...
arXiv:1902.10244v3
fatcat:gdhnzwunebd37fgrt2hdw3yqhq
Scalable String Reconciliation by Recursive Content-Dependent Shingling
2019
2019 57th Annual Allerton Conference on Communication, Control, and Computing (Allerton)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
The goal is to synchronize data under a known communication budget at a cost of tolerating incomplete reconciliation. ...
partition trees with a maximum of p=4 partitions. ...
doi:10.1109/allerton.2019.8919901
dblp:conf/allerton/SongT19
fatcat:zn3nj44o2nhqdhssgypu2egvdm
A first qualitative evaluation of star replication schemes for FTT-CAN
2012
Proceedings of 2012 IEEE 17th International Conference on Emerging Technologies & Factory Automation (ETFA 2012)
Preserved Fulltext
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.
., assuming a mostly constant environment. However, the little flexibility of such approaches does not allow continuous operation under dynamic environments. ...
Nevertheless, for FTT-CAN, the implementation of FTT for CAN, no replicated star topology that takes advantage of FTT-CAN's features to increase reliability and error containment exists. ...
Acknowledgement This work was supported by the Spanish Economy and Competitivity Ministry with grant DPI2011-22992 and by FEDER funding. ...
doi:10.1109/etfa.2012.6489702
dblp:conf/etfa/GessnerBPS12
fatcat:4efbb6j6pfdvfdlrxpq2y45dme
SAFA: a Semi-Asynchronous Protocol for Fast Federated Learning with Low Overhead
[article]
2020
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
Federated learning (FL) has attracted increasing attention as a promising approach to driving a vast number of end devices with artificial intelligence. ...
We have conducted extensive experiments with typical machine learning tasks. ...
., clients A and B) refers to the ratio of client A's chance of contributing to the global model to client B's chance. ...
arXiv:1910.01355v2
fatcat:mchsqlzcdzdr7f4l4z4t7kwoa4
Scalable String Reconciliation by Recursive Content-Dependent Shingling
[article]
2019
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
This "string reconciliation" problem is a fundamental building block for a variety of networking applications, including those that maintain large-scale distributed networks and perform remote file synchronization ...
We provide comparisons to the performance of Rsync, one of the most popular file synchronization tools in active use. ...
The partition tree tolerates changes to the input string without affecting most of the partitions. For example, if we change the phrase to "Heart Victoria" with the "i" removed from the front. ...
arXiv:1910.00536v1
fatcat:5ttoenbt3zcexie2ca5vovmjem
Replication-Based Fault-Tolerance for Large-Scale Graph Processing
2014
2014 44th Annual IEEE/IFIP International Conference on Dependable Systems and Networks
Preserved Fulltext
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.
The increasing algorithm complexity and dataset sizes necessitate the use of networked machines for many graph-parallel algorithms, which also makes fault tolerance a must due to the increasing scale of ...
This paper proposes Imitator, a new fault tolerance mechanism, which supports cheap maintenance of vertex states by replicating them to their replicas during normal message exchanges, and provides fast ...
Impact of Graph Partitioning To analyze the impact of graph partitioning algorithms, we implement Fennel [29] on Imitator, which is a heuristic graph partitioning algorithm. ...
doi:10.1109/dsn.2014.58
dblp:conf/dsn/WangZCCG14
fatcat:vfuicg3rqrf3lbivizr52ggwr4
Formal verification of Time-Triggered Ethernet protocol using PRISM model checker
2011
ICM 2011 Proceeding
Preserved Fulltext
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.
It certainly would not have happened with- ...
In figure In this test "Client 1" is the control node with no no chances of failure. The client's failure probability increase at a constant rate of 0.05%. ...
The guardian is a piece of hardware, with its own fault-tolerant clock synchronization sub-system, connected to the switch via ethernet port which is able to control the input and the output of the switch ...
doi:10.1109/icm.2011.6177381
fatcat:gztrlyevynamvmpghhhvs5pjdu
« Previous
Showing results 1 — 15 out of 11,045 results