Results 1 
5 of
5
Adaptive Broadcasting With Faulty Nodes
, 1996
"... We consider broadcasting from a faultfree source to all nodes of a completely connected nnode network in the presence of k faulty nodes. Every node can communicate with at most one other node in a unit of time and during this period every pair of communicating nodes can exchange information packe ..."
Abstract

Cited by 17 (1 self)
 Add to MetaCart
We consider broadcasting from a faultfree source to all nodes of a completely connected nnode network in the presence of k faulty nodes. Every node can communicate with at most one other node in a unit of time and during this period every pair of communicating nodes can exchange information packets. Faulty nodes can receive information but cannot send it. Broadcasting is adaptive, i.e. a node schedules its next communication on the basis of information currently available to it. We study worst case running time of faulttolerant broadcasting algorithms in two models: in the wakeup model only nodes already having the source message can call other nodes and in the unrestricted model all faultfree nodes can call. In the first model we give an optimal algorithm working in time k +dlog(n \Gamma k)e. In the second model we give an algorithm working in time O(log 2 n), whenever the fraction of faulty nodes is bounded by a constant smaller than 1. Key words: adaptive, algorithm, broadc...
Priority queues resilient to memory faults
 IN: PROC. 10TH INTERNATIONAL WORKSHOP ON ALGORITHMS AND DATA STRUCTURES
, 2007
"... In the faultymemory RAM model, the content of memory cells can get corrupted at any time during the execution of an algorithm, and a constant number of uncorruptible registers are available. A resilient data structure in this model works correctly on the set of uncorrupted values. In this paper w ..."
Abstract

Cited by 13 (5 self)
 Add to MetaCart
In the faultymemory RAM model, the content of memory cells can get corrupted at any time during the execution of an algorithm, and a constant number of uncorruptible registers are available. A resilient data structure in this model works correctly on the set of uncorrupted values. In this paper we introduce a resilient priority queue. The deletemin operation of a resilient priority queue returns either the minimum uncorrupted element or some corrupted element. Our resilient priority queue uses O(n) space to store n elements. Both insert and deletemin operations are performed in O(log n + δ) time amortized, where δ is the maximum amount of corruptions tolerated. Our priority queue matches the performance of classical optimal priority queues in the RAM model when the number of corruptions tolerated is O(log n). We prove matching worst case lower bounds for resilient priority queues storing only structural information in the uncorruptible registers between operations.
Data Structures: Sequence Problems, Range Queries and Fault Tolerance
, 2010
"... The focus of this dissertation is on algorithms, in particular data structures that give provably efficient solutions for sequence analysis problems, range queries, and fault tolerant computing. The work presented in this dissertation is divided into three parts. In Part I we consider algorithms for ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
The focus of this dissertation is on algorithms, in particular data structures that give provably efficient solutions for sequence analysis problems, range queries, and fault tolerant computing. The work presented in this dissertation is divided into three parts. In Part I we consider algorithms for a range of sequence analysis problems that have risen from applications in pattern matching, bioinformatics, and data mining. On a high level, each problem is defined by a function and some constraints and the job at hand is to locate subsequences that score high with this function and are not invalidated by the constraints. Many variants and similar problems have been proposed leading to several different approaches and algorithms. We consider problems where the function is the sum of the elements in the sequence and the constraints only bound the length of the subsequences considered. We give optimal algorithms for several variants of the problem based on a simple idea and classic algorithms and data structures. In Part II we consider range query data structures. This a category of
Contents
, 2006
"... 2.1 Broadcasting without faults.......................... 4 ..."
(Show Context)
Deterministic Models of Communication Faults?
"... Abstract. In this paper we survey some results concerning the impact of faulty environments on the solvability and complexity of communication tasks. In particular, we focus on deterministic models of faults in synchronous networks, and show how different variations of the model influence the perfo ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract. In this paper we survey some results concerning the impact of faulty environments on the solvability and complexity of communication tasks. In particular, we focus on deterministic models of faults in synchronous networks, and show how different variations of the model influence the performance bounds of broadcasting algorithms. 1