Coding Schemes for Data Transmission over Bus Systems

Balakirsky, V.B.; Vinck, Adrianus Han

doi:10.1109/isit.2006.261740

Cited by 5 publications

(5 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Several transient faults may occur simultaneously on several computation nodes as well as several faults may occur on the same computation node. In this article, we assume that transient faults on the bus are addressed at the communication level, for example, with the use of efficient error correction codes [Balakirsky and Vinck 2006;Emani et al 2007;Piriou et al 2006] and/or through hardware replication of the bus [Kopetz and Bauer 2003;Silva et al 2007]. …”

Section: Fault Tolerancementioning

confidence: 99%

Scheduling and Optimization of Fault-Tolerant Embedded Systems with Transparency/Performance Trade-Offs

Izosimov

Pop

Eles

et al. 2012

ACM Trans. Embed. Comput. Syst.

View full text Add to dashboard Cite

In this article, we propose a strategy for the synthesis of fault-tolerant schedules and for the mapping of fault-tolerant applications. Our techniques handle transparency/performance trade-offs and use the faultoccurrence information to reduce the overhead due to fault tolerance. Processes and messages are statically scheduled, and we use process reexecution for recovering from multiple transient faults. We propose a finegrained transparent recovery, where the property of transparency can be selectively applied to processes and messages. Transparency hides the recovery actions in a selected part of the application so that they do not affect the schedule of other processes and messages. While leading to longer schedules, transparent recovery has the advantage of both improved debuggability and less memory needed to store the faulttolerant schedules. ACM Reference Format:Izosimov, V., Pop, P., Eles, P., and Peng, Z. 2012. Scheduling and optimization of fault-tolerant embedded systems with transparency/performance trade-offs.

show abstract

Section: Fault Tolerancementioning

confidence: 99%

Scheduling and Optimization of Fault-Tolerant Embedded Systems with Transparency/Performance Trade-Offs

Izosimov

Pop

Eles

et al. 2012

ACM Trans. Embed. Comput. Syst.

View full text Add to dashboard Cite

show abstract

“…We assume that transient faults on the bus are addressed at the communication level, for example, with the use of efficient error correction codes [19,2] and/or acknowledgements/retransmissions [13].…”

Section: A Fault Tolerancementioning

confidence: 99%

“…by allowing other, potentially higher-value soft processes to complete). 2 If P i , or its re-execution, is dropped but would produce an input for another process P j , we assume that P j will use an input value from a previous execution cycle, i.e., a "stale" value. Thus, output values produced by processes in one execution cycle can be reused by processes in the next cycles.…”

Section: B Utility Modelmentioning

confidence: 99%

“…5a, a single f 2 schedule S 0 is generated, as depicted above the Gantt chart that outlines a possible execution scenario that would follow S 0 . Message sending times on the bus are fixed and message m 2 is, thus, always sent at 150 ms (denoted as m 2 [150] in the schedule). m 2 has to wait for the worst-case completion time of P 2 .…”

Section: B Signalling and Schedulesmentioning

confidence: 99%

See 1 more Smart Citation

Value-based scheduling of distributed fault-tolerant real-time systems with soft and hard timing constraints

Izosimov

Eles

Peng

2010

2010 8th IEEE Workshop on Embedded Systems for Real-Time Multimedia

View full text Add to dashboard Cite

-We present an approach for scheduling of faulttolerant embedded applications composed of soft and hard realtime processes running on distributed embedded systems. The hard processes are critical and must always complete on time. A soft process can complete after its deadline and its completion time is associated with a value function that characterizes its contribution to the quality-of-service of the application. We propose a quasi-static scheduling algorithm to generate a tree of fault-tolerant distributed schedules that maximize the application's quality value and guarantee hard deadlines.

show abstract

“…repeater" meaning that his signals can differ from the output of the channel, and this possibility can bring a desired trade-off between reliability, decoding complexity and the total time delay [4]. We introduce a general setup and decoding schemes, and then demonstrate the results for the (7,4) Hamming code and binary symmetric channels.…”

Section: Introductionmentioning

confidence: 99%

Data Transmission with Helpers over Power—Line Channels

Balakirsky¹,

Vinck²

2006 IEEE International Symposium on Power Line Communications and Its Applications

View full text Add to dashboard Cite

We investigate data transmission schemes over power line channels where the source and the destination are connected by the 3-phase channels. Assuming that the same codeword is simultaneously transmitted over all channels, we analyze the decoding algorithms at the destination provided that there are 3 intermediate independent helpers who receive corrupted versions of the codeword and inform the decoder about results. If helpers are allowed to transmit the same number of bits as the length of the received vector, then the scheme is equivalent to the decoding of the codeword by joint use of its 3 corrupted versions. If helpers are only allowed to send the number of bits equal to the logarithm of the total number of codewords, the scheme corresponds to a 2-step decoding at the receiver when joint operations for 3 received versions are applied to the results of the helpers. We investigate both possibilities and demonstrate the results for the (7,4) Hamming code and binary symmetric channels.

show abstract

Coding Schemes for Data Transmission over Bus Systems

Cited by 5 publications

References 5 publications

Scheduling and Optimization of Fault-Tolerant Embedded Systems with Transparency/Performance Trade-Offs

Scheduling and Optimization of Fault-Tolerant Embedded Systems with Transparency/Performance Trade-Offs

Value-based scheduling of distributed fault-tolerant real-time systems with soft and hard timing constraints

Data Transmission with Helpers over Power—Line Channels

Contact Info

Product

Resources

About