Advances in technology scaling increasingly make Network-on-Chips (NoCs) more susceptible to failures that cause various reliability challenges. With increasing area occupied by different on-chip memories, strategies for maintaining faulttolerance of distributed on-chip memories become a major design challenge. We propose a system-level design methodology for scalable fault-tolerance of distrib...

An eventbased simulation system is introduced, designed for performance assessment of distributed storage systems. Such storage systems employ the communication network to connect several distributed storage units to a virtual storage system that provides higher capacity, better performance and that is tolerant against storage unit failures. By simulation, several data distribution strategies a...

Slow running or straggler tasks can significantly reduce computation speed in distributed computation. Recently, coding-theory-inspired approaches have been applied to mitigate the effect of straggling, through embedding redundancy in certain linear computational steps of the optimization algorithm, thus completing the computation without waiting for the stragglers. In this paper, we propose an...

Safety-critical systems have to be fault tolerant and also meet stringent temporal constraints. Various redundancy strategies are built into such mission-critical applications to ensure the overall success of the mission. This paper implements a fault tolerant scheduling scheme on a dual processor system, wherein the redundancy is made at the task level. The system continues to function with gr...

One characteristic of biological organisms that is desirable in engineering systems is the ability to tolerate faults in their components. Fault tolerance in artificial cellular systems is generally achieved by either timeredundancy or hardware-redundancy. In hardware redundancy spare cells are introduced so that when an active cell fails, a spare substitutes it. In the embryonic hardware archi...

Recent results indicate that the same turbo principle which delivers near to optimal strategies for channel coding, can be used to obtain very efficient source coding schemes. We investigate this issue applying ten Brink’s EXIT chart analysis and show how this technique can be used to select the most efficient match of component codes and puncturing matrices to compress discrete memoryless sour...

Peer-to-peer storage aims to build large-scale, reliable and available storage from many small-scale unreliable, low-availability distributed hosts. Data redundancy is the key to any data guarantees. However, preserving redundancy in the face of highly dynamic membership is costly. We apply a simple resource usage model to measured behavior from the Gnutella file-sharing network to argue that l...

In cloud computing systems, assigning a job to multiple servers and waiting for the earliest copy to finish is an effective method to combat the variability in response time of individual servers. Although adding redundant replicas always reduces service time, the total computing time spent per job may be higher, thus increasing waiting time in queue. The total time spent per job is also propor...

Reliable communication among avionic applications is a crucial prerequisite for today’s all-electronic fly-by-wire aircraft technology. The AFDX switched Ethernet has been developed as a scalable, cost-effective network, based upon IEEE 802.3 Ethernet. It uses redundant links to increase the availability. Typical consensus strategies for the redundancy management task are not feasible, as they ...