<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Girault, Alain</style></author><author><style face="normal" font="default" size="100%">Kalla, Hamoudi</style></author><author><style face="normal" font="default" size="100%">Sorel, Yves</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">A scheduling heuristics for distributed real-time embedded systems tolerant to processor and communication media failures</style></title><secondary-title><style face="normal" font="default" size="100%">International Journal of Production Research</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2004</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://www.tandfonline.com/doi/abs/10.1080/00207540410001705248</style></url></web-urls></urls><volume><style face="normal" font="default" size="100%">42</style></volume><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p style=&quot;text-align: justify;&quot;&gt;
	Hardware fault tolerance is an important consideration in critical distributed real-time embedded systems and has been extensively researched. In these systems, critical real-time constraints must be satisfied even in the presence of hardware component failures. Our goal is to propose a solution to automatically produce a fault-tolerant distributed schedule of a given algorithm onto a given distributed architecture, according to real-time constraints. The distributed architectures we consider have bidirectional point-to-point communication links. Our solution is a list scheduling heuristics, based on disjoint paths to tolerate a fixed number of arbitrary processor and communication link failures. Because of the resource limitation in embedded systems, our heuristics implements a software solution based on the active replication technique, where each operation of the algorithm is replicated on different processors. With a detailed example, we show the techniques used to satisfy the real-time constraints and tolerate the failure of processor and communication links. Simulations show the efficiency of our method compared with other heuristics found in the literature.
&lt;/p&gt;
</style></abstract><issue><style face="normal" font="default" size="100%">14</style></issue></record></records></xml>