Fault tolerant scheduling strategy in a NCS based on frequency transition

dc.contributor.authorOscar A. Esquivel-Flores
dc.contributor.authorHéctor Benítez‐Pérez
dc.coverage.spatialBolivia
dc.date.accessioned2026-03-22T17:10:16Z
dc.date.available2026-03-22T17:10:16Z
dc.date.issued2012
dc.description.abstractA hard real-time system is subject to timing and reliability constraints. In fault-tolerant real-time systems, tasks have deadlines to be met despite of the presence of fault. In this context primary-backup scheme has been one of the most important algorithm employed for fault-tolerant scheduling for real-time tasks. Each task has primary version and backup version and the versions must be scheduled on different processors. Commonly, this method has been used guaranteeing compliance with the primary tasks and backup without considering the optimal use of the communication media in networked control systems. In this paper a scheduling strategy is proposed based on frequency transition which uses primary-backup for tolerating faults considering the optimal use of network.
dc.identifier.doi10.1109/scis-isis.2012.6505203
dc.identifier.urihttps://doi.org/10.1109/scis-isis.2012.6505203
dc.identifier.urihttps://andeanlibrary.org/handle/123456789/62584
dc.language.isoen
dc.sourceUniversidad La Salle
dc.subjectBackup
dc.subjectComputer science
dc.subjectFault tolerance
dc.subjectScheduling (production processes)
dc.subjectDistributed computing
dc.subjectReal-time computing
dc.subjectEmbedded system
dc.subjectComputer network
dc.titleFault tolerant scheduling strategy in a NCS based on frequency transition
dc.typearticle

Files