A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
Filters
An algorithm for automatically obtaining distributed and fault-tolerant static schedules
2003 International Conference on Dependable Systems and Networks, 2003. Proceedings.
Preserved Fulltext
In this article, we present a scheduling heuristic which, given all these inputs, produces a fault-tolerant, distributed, and static scheduling of the algorithm on the architecture, with an indication ...
Our goal is to automatically obtain a distributed and fault-tolerant embedded system: distributed because the system must run on a distributed architecture; fault-tolerant because the system is critical ...
Acknowledgments The authors would like to thank Cȃtȃlin Dima, Thierry Grandpierre, Claudio Pinello, and David Powell for their helpful suggestions. ...
doi:10.1109/dsn.2003.1209927
dblp:conf/dsn/GiraultKSS03
fatcat:frl24becpbfjtn5rjpteluztw4
Energy-Efficient Fault-Tolerant Scheduling Approach for Embedded Real Time Systems
2013
International Journal of Electrical Energy
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.
In this paper, we propose a fault-tolerant scheduling heuristic that achieves low energy consumption and high reliability efficiency. ...
Our scheduling algorithm is dedicated to multi-bus heterogeneous architectures, which take as input a given system description and a given fault hypothesis. ...
It generates automatically a distributed static schedule of a given algorithm onto a given architecture, which minimizes the system's runtime, and tolerates upto k processors faults, with respect to real-time ...
doi:10.12720/ijoee.1.4.274-278
fatcat:gy6a3mtl2nd6vehul2bsubkgya
A Fault Tolerant Scheduling Heuristics for Distributed Real Time Embedded Systems
2018
Cybernetics and Information Technologies
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.
In this paper, fault tolerant task scheduling algorithms are proposed for mapping task graphs to heterogeneous processing nodes. ...
The proposed heuristics generate automatically a real-time fault distributed schedule of dependent and independent tasks into heterogonous multiprocessors architecture. ...
Our goal is to produce automatically a fault-tolerant distributed schedule of the algorithm onto the architecture. ...
doi:10.2478/cait-2018-0038
fatcat:ec7fxlrenzeuvkrunljkizs4l4
Reliable Fault-Tolerant Multi-bus Scheduling Algorithm
2013
International Journal of Computer Applications
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.
In this paper, we propose a fault-tolerant scheduling real-time embedded system. ...
This scheduling algorithm is dedicated to multi-bus heterogeneous architectures, which take as input a given system description and a given fault hypothesis. ...
We have proposed a new scheduling heuristic, called RBF, which produces automatically a static distributed fault-tolerant schedule of a given algorithm ALG on a given multi-buses architecture ARC. ...
doi:10.5120/12409-9060
fatcat:uugp4qsiefh77d2zen2d3vhiy4
EasyPDP: An Efficient Parallel Dynamic Programming Runtime System for Computational Biology
2012
IEEE Transactions on Parallel and Distributed Systems
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.
Based on the model, EasyPDP runtime system is designed and implemented. It automatically handles thread creation, dynamic data task allocation and scheduling, data partitioning, and fault tolerance. ...
The experimental results illustrate that EasyPDP system is fine and provides an efficient infrastructure for dynamic programming algorithms. ...
ACKNOWLEDGMENTS The authors would like to thank the editor, all the reviewers, Chao Sun, Jun Du, Liya Fan, Libo Sun, and Tingxu Yan for the help in improving this paper. ...
doi:10.1109/tpds.2011.218
fatcat:dql74n6t4repje7n3zk4hsjj5q
Fault-Tolerant Dynamic Task Scheduling Based on Dataflow Graphs
[chapter]
1998
Fault-Tolerant Parallel and Distributed Systems
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.
This paper describes a distributed algorithm for scheduling parallel programs represented by (macro-) dataflow graphs on multicomputer systems such that they are executed in a fault-tolerant way. ...
The algorithm is described in detail for the 1-fault case and some performance measurements on a multi-transputer system are given. ...
Next, the scheduling algorithm which combines fault tolerance and scheduling for the 1-fault case is explained. ...
doi:10.1007/978-1-4615-5449-3_21
fatcat:qrg5p3jearbetlus4xjarudddq
A Fault Tolerant Scheduling Algorithm for DAG Applications in Cluster Environments
[chapter]
2011
Communications in Computer and Information Science
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 2012; you can also visit the original URL.
The file type is application/pdf.
In this paper, a fault tolerant task scheduling algorithm is proposed for mapping task graphs to heterogeneous processing nodes in cluster computing systems. ...
The algorithm is based on the active replication scheme, and it schedules ε+1 replicas of each task to achieve the required fault tolerance. ...
[14] have presented an algorithm with the goal of automatically obtain a distributed and fault tolerant task scheduling in embedded systems. ...
doi:10.1007/978-3-642-22389-1_18
fatcat:ianhgfaujnd2fc7ihhozuev4ja
An Efficient Fault-Tolerant Multi-Bus Data Scheduling Algorithm Based on Replication and Deallocation
2016
Cybernetics and Information Technologies
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.
The paper proposes a new reliable fault-tolerant scheduling algorithm for real-time embedded systems. ...
The proposed scheduling algorithm takes into consideration only one bus fault in multi-bus heterogeneous architectures, caused by hardware faults and compensated by software redundancy solutions. ...
We have proposed a new scheduling heuristic, called FTA-RD, which produces automatically a static distributed fault-tolerant schedule when data dependencies are represented by directed acyclic graphs with ...
doi:10.1515/cait-2016-0021
fatcat:75lvwszsqjdkbhrubv3prvoo5a
TheWorkQueue with Dynamic Replication-FaultTolerant Scheduler in Desktop Grid Environment
2012
INTERNATIONAL JOURNAL OF COMPUTERS & 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 2018; you can also visit the original URL.
The file type is application/pdf.
Particularly, resource providers in Desktop Grid are volatile, heterogeneous, faulty, and malicious. These distinct features make it difficult for a scheduler to allocate tasks. ...
Moreover, they deteriorate reliability of computation and performance. ...
An alternative approach to BoT scheduling in Desktop Grids named fault-aware schedulers has been proposed in [16] that, rather than just tolerating faults as done by traditional fault-tolerant schedulers ...
doi:10.24297/ijct.v11i4.3128
fatcat:enrth35rhbfbdhta7naf7udusu
Fault-Tolerant Distributed Deployment of Embedded Control Software
2008
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
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 2010; you can also visit the original URL.
The file type is application/pdf.
Control theorists design the control laws to be robust with respect to the former kind of faults while assuming an idealized scenario for the latter. ...
This is performed automatically as part of the embedded software deployment through the combination of the following three steps: replication, mapping, and scheduling. ...
Girault for inspiration and support. ...
doi:10.1109/tcad.2008.917971
fatcat:zpvwmyxlf5hzbbaztgyesd7sea
Transparent recovery from intermittent faults in time-triggered distributed systems
2003
IEEE transactions on computers
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.
The time-triggered model, with tasks scheduled in static (offline) fashion, provides a high degree of timing predictability in safety-critical distributed systems. ...
overhead when compared to corresponding non-fault-tolerant ones. ...
Fault-tolerant scheduling algorithms for aperiodic tasks in multiprocessor systems have also been proposed [13] , [22] . ...
doi:10.1109/tc.2003.1176980
fatcat:jyxuxgooovb4nd4ggc3xio5sy4
A bi-criteria scheduling heuristic for distributed embedded systems under reliability and real-time constraints
2004
International Conference on Dependable Systems and Networks, 2004
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 2005; you can also visit the original URL.
The file type is application/pdf.
If the system reliability or the schedule length requirements are not met, then a parameter of the compromise function can be changed and the algorithm re-executed. ...
The proposed algorithm is a list scheduling heuristics, based on a bi-criteria compromise function that introduces priority between the operations to be scheduled, and that chooses on what subset of processors ...
SYNDEX generates automatically executable fault-tolerant distributed code, by first producing a static fault-tolerant distributed schedule of a given algorithm on a given distributed architecture (either ...
doi:10.1109/dsn.2004.1311904
dblp:conf/dsn/AssayadGK04
fatcat:hdsx7etkuffm7lqqmztzifhfle
Achieving Fault-Tolerant Network Topology in Wireless Mesh Networks
[chapter]
2012
Wireless Mesh Networks - Efficient Link Scheduling, Channel Assignment and Network Planning Strategies
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.
Then we will discuss related work to the automatic base station planning algorithm. ...
The issue of reliable communication via wireless medium has been extensively investigated during the design of every wireless communication 205 Achieving Fault-Tolerant Network Topology in Wireless Mesh ...
The methods, presented in this chapter, are used in flexWARE to achieve availability of the wireless medium by radio coverage monitoring and prediction and network engineering.
Author details ...
doi:10.5772/50173
fatcat:ees7q5gu7feethplpqnpbkkvwa
Architectural support for designing fault-tolerant open distributed systems
1992
Computer
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 distributed voting algorithm and a twolevel hierarchy for permanent memory are key elements in this scheme for supporting fault tolerance in open distributed systems. distributed system consists of autonomous ...
We propose the use of low-level voting and recovery algorithms that can run as a layer of software above the operating system to make the open distributed system an attractive environment for applying ...
Still another approach static redundancy) is incorporated into a combination of these two, called Strategies for designing fault-tolerant computers Many techniques have been used to build fault-tolerant ...
doi:10.1109/2.153257
fatcat:xxdpawep6vganorlmxtfpctahi
Implementation of Fault Tolerance Algorithm to Restore Affected Nodes in Scheduling Clusters
2012
International Journal of Computer Networks & Communications
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 2018; you can also visit the original URL.
The file type is application/pdf.
To control and retain an affected node in the clustering scheduling, fault tolerance techniques are applied. The base of this technique is Node Recovery Algorithm (NRA). ...
This algorithm supports disconnected nodes and restores them to join the scheduling. Furthermore, this algorithm maximizes the efficiency of the cluster and improves the performance. ...
The main goal of fault tolerant task scheduling algorithms is to find a static schedule of application tasks on the processing elements of a cluster computing system and tolerate a given number of processor ...
doi:10.5121/ijcnc.2012.4101
fatcat:4rzipsuwnjbpfibpeb4r4b7rse
« Previous
Showing results 1 — 15 out of 9,184 results