Software fault tolerance in real-time systems: Identifying the future research questions
Tolerating hardware faults in modern architectures is becoming a prominent problem due to
the miniaturization of the hardware components, their increasing complexity, and the …
the miniaturization of the hardware components, their increasing complexity, and the …
Real-time scheduling under fault bursts with multiple recovery strategy
In this paper, we consider the feasibility problem of a set of real-time jobs which may be
subject to a fault burst during execution. A fault burst represents a time interval during which …
subject to a fault burst during execution. A fault burst represents a time interval during which …
The global limited preemptive earliest deadline first feasibility of sporadic real-time tasks
The feasibility of preemptive and non-preemptive scheduling has been well investigated on
uniprocessor and multiprocessor platforms under both Fixed Priority Scheduling (FPS) and …
uniprocessor and multiprocessor platforms under both Fixed Priority Scheduling (FPS) and …
Fault tolerant scheduling of mixed criticality real-time tasks under error bursts
Dependability is an important requirement in hard real-time applications due to the
potentially catastrophic consequences of failures. In these systems, fault tolerance …
potentially catastrophic consequences of failures. In these systems, fault tolerance …
Clinical text analysis using machine learning methods
KP Chodey, G Hu - … IEEE/ACIS 15th International Conference on …, 2016 - ieeexplore.ieee.org
SemEval (Semantic Evaluation) is an annual workshop where attendees participate in a
series of evaluations (competitions) of computational semantic analysis for natural language …
series of evaluations (competitions) of computational semantic analysis for natural language …
Quantifying the sub-optimality of non-preemptive real-time scheduling
A Thekkilakattil, R Dobrin… - 2013 25th Euromicro …, 2013 - ieeexplore.ieee.org
A number of preemptive real-time scheduling algorithms, such as Earliest Deadline First
(EDF), are known to be optimal on uni-processor systems under specified assumptions …
(EDF), are known to be optimal on uni-processor systems under specified assumptions …
Worst-case finish time analysis for dag-based applications in the presence of transient faults
Tasks in hard real-time systems are required to meet preset deadlines, even in the presence
of transient faults, and hence the analysis of worst-case finish time (WCFT) must consider …
of transient faults, and hence the analysis of worst-case finish time (WCFT) must consider …
Lightweight host and user authentication protocol for All-IP telecom networks
J Pellikka, A Gurtov, Z Faigl - … on a World of Wireless, Mobile …, 2012 - ieeexplore.ieee.org
Future wireless networks are moving fast towards all-IP network architectures and mobile
operators are expanding their services outside traditional cellular networks becoming multi …
operators are expanding their services outside traditional cellular networks becoming multi …
Guaranteeing fault tolerance in real time systems under error bursts
JV Thomas, R Ranjith, RV Pillay - … International Conference on …, 2017 - ieeexplore.ieee.org
Real-time systems in dynamic environments can encounter faults that can lead to incorrect
computation resulting in failure of system or exhibit degraded system performance. Earlier …
computation resulting in failure of system or exhibit degraded system performance. Earlier …
Clustering on a hypercube multicomputer
Squared-error clustering algorithms for single-instruction multiple-data (SIMD) hypercubes
are presented. These algorithms are asymptotically faster than previous algorithms and …
are presented. These algorithms are asymptotically faster than previous algorithms and …