Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
586
Fault-Tolerance Through Scheduling of Aperiodic Tasks in Hard Real-Time Multiprocessor Systems
, 1997
"... Real-time systems are being increasingly used in several applications which are time critical in nature. Fault-tolerance is an important requirement of such systems, due to the catastrophic consequences of not tolerating faults. In this paper, we study a scheme that provides fault-tolerance through ..."
Abstract
-
Cited by 59 (0 self)
- Add to MetaCart
Real-time systems are being increasingly used in several applications which are time critical in nature. Fault-tolerance is an important requirement of such systems, due to the catastrophic consequences of not tolerating faults. In this paper, we study a scheme that provides fault-tolerance
Fault Tolerant Real-Time Global Scheduling on Multiprocessors
- In Proc. of The 10 th IEEE Euromicro Workshop in Real-Time Systems
, 1999
"... Many real-time multiprocessor scheduling techniques have been proposed to guarantee the timely execution of periodic preemptive real-time tasks. However, timeliness is usually only guaranteed in the absence of faults, which may be unacceptable for some critical systems. We therefore address the prob ..."
Abstract
-
Cited by 13 (2 self)
- Add to MetaCart
Many real-time multiprocessor scheduling techniques have been proposed to guarantee the timely execution of periodic preemptive real-time tasks. However, timeliness is usually only guaranteed in the absence of faults, which may be unacceptable for some critical systems. We therefore address
A fault-tolerant dynamic scheduling algorithm for multiprocessor real-time systems and its analysis
- IEEE Transactions on Parallel and Distributed Systems
, 1998
"... Scheduling multiple versions of the tasks on different processors can provide fault tolerant. One of the models that is used for fault-tolerant scheduling of real–time tasks, namely, is the Primary backup (PB) model. In this approach, ..."
Abstract
-
Cited by 41 (4 self)
- Add to MetaCart
Scheduling multiple versions of the tasks on different processors can provide fault tolerant. One of the models that is used for fault-tolerant scheduling of real–time tasks, namely, is the Primary backup (PB) model. In this approach,
Analysis and Optimization of Fault-Tolerant Task Scheduling on Multiprocessor Embedded Systems
"... Reliability is a major requirement for most safety-related systems. To meet this requirement, fault-tolerant techniques such as hardware replication and software re-execution are often utilized. In this paper, we tackle the problem of anal-ysis and optimization of fault-tolerant task scheduling for ..."
Abstract
-
Cited by 3 (1 self)
- Add to MetaCart
is illustrated us-ing several case studies. Categories and Subject Descriptors B.8.1 [Performance and Reliability]: Reliability, Test-ing, and Fault-Tolerance; C.3 [special-purpose and ap plication-based systems]: Real-time and embedded sys-tems
Analysis of a Fault-Tolerant Multiprocessor Scheduling Algorithm* Keywords: Fault Tolerance, Real Time, Operat- ing Systems, Primary/Backup, Redundancy
"... Fault tolerance is an important aspect of real-time computer systems, since timing constraints must not be violated. When dealing with multiprocessor sys-tems, fault tolerance becomes an even greater require-ment, since there are more components that can fail. In this paper, we present the analysis ..."
Abstract
- Add to MetaCart
of a fault-tolerant scheduling algorithm for real-time applica-tions on multiprocessors. Our algorithm is based on the principles of primary/backup tal, k h p oaer-loading (i.e., schedulin more than a sin e backu in the same time interval!, and backup deafmation [.e.$ reclaiming the resources unused
A Lock-Free Multiprocessor OS Kernel
, 1991
"... Typical shared-memory multiprocessor OS kernels use interlocking, implemented as spinlocks or waiting semaphores. We have implemented a complete multiprocessor OS kernel (including threads, virtual memory, and I/O including a window system and a file system) using only lock-free synchronization meth ..."
Abstract
-
Cited by 107 (2 self)
- Add to MetaCart
Typical shared-memory multiprocessor OS kernels use interlocking, implemented as spinlocks or waiting semaphores. We have implemented a complete multiprocessor OS kernel (including threads, virtual memory, and I/O including a window system and a file system) using only lock-free synchronization
Mechanisms for System-Level Fault Tolerance in Real-Time Systems
"... this paper we concentrate on the development of a method for achieving fault tolerance at the system level, and we define a mechanism by which the guarantees of applications accepted for execution may be revoked. The removal of applications from, or the their replacement in, a schedule may be necess ..."
Abstract
-
Cited by 6 (2 self)
- Add to MetaCart
be necessary in order to maintain the system in a safe state, even in a real-time environment. Our scheme encompasses recovery techniques such as graceful degradation, load shedding, and reconfiguration, while the implementation is done transparently to the user. The paper is organized as follows. In the rest
Robust Partitioning for Real-Time Multiprocessor Systems with Shared Resources
"... In this paper, we focus on the temporal robustness in the hard real-time multiprocessor systems. This robustness is the capacity to tolerate faults in such a way that no dead-lines are missed. A model of sporadic and dependent tasks is considered. Our contribution is to propose a partitioning algori ..."
Abstract
- Add to MetaCart
In this paper, we focus on the temporal robustness in the hard real-time multiprocessor systems. This robustness is the capacity to tolerate faults in such a way that no dead-lines are missed. A model of sporadic and dependent tasks is considered. Our contribution is to propose a partitioning
BJÖRN B. BRANDENBURG: Scheduling and Locking in Multiprocessor Real-Time Operating Systems
, 2011
"... With the widespread adoption of multicore architectures, multiprocessors are now a standard deployment platform for (soft) real-time applications. This dissertation addresses two questions fundamental to the design of multicore-ready real-time operating systems: (1) Which scheduling policies offer t ..."
Abstract
- Add to MetaCart
With the widespread adoption of multicore architectures, multiprocessors are now a standard deployment platform for (soft) real-time applications. This dissertation addresses two questions fundamental to the design of multicore-ready real-time operating systems: (1) Which scheduling policies offer
A Real-Time Parallel Scheduler For The Imprecise Computation Model
- Computations Model, PDCP, Special Issue on Parallel and Distributed Real-Time Systems
, 1999
"... . This paper considers the problem of scheduling hard real-time, periodic jobs on a multiprocessor while allowing imprecise computations. A highly dynamic job set is assumed, where limited a priori knowledge of a job set's behavior is available. The use of static partitioning schemes for such a ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
on these constraints is presented. Key words. real-time systems, multiprocessors, scheduling algorithms, imprecise computations. AMS subject classifications. 68M20, 68N25, 68Q22 1. Introduction. The Imprecise Computation model [2] provides a framework for incorporating graceful degradation in real-time applications
Results 1 - 10
of
586
