Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
8,137
Priority-Driven Scheduling of Periodic Task Systems on Multiprocessors
, 2001
"... The scheduling of systems of periodic tasks upon multiprocessor platforms is considered. ..."
Abstract
-
Cited by 122 (16 self)
- Add to MetaCart
The scheduling of systems of periodic tasks upon multiprocessor platforms is considered.
Fast Scheduling of Periodic Tasks on Multiple Resources
- In Proceedings of the 9th International Parallel Processing Symposium
"... Given n periodic tasks, each characterized by an execution requirement and a period, and m identical copies of a resource, the periodic scheduling problem is concerned with generating a schedule for the n tasks on the m resources. We present an algorithm that schedules every feasible instance of t ..."
Abstract
-
Cited by 129 (15 self)
- Add to MetaCart
Given n periodic tasks, each characterized by an execution requirement and a period, and m identical copies of a resource, the periodic scheduling problem is concerned with generating a schedule for the n tasks on the m resources. We present an algorithm that schedules every feasible instance
Mixed Pfair/ERfair Scheduling of Asynchronous Periodic Tasks
, 2001
"... Pfair Scheduling was proposed by... In this paper, we introduce a work-conserving variant of Pfair scheduling called "early-release" fair (ERfair) scheduling. We also present a new scheduling algorithm called PD² and show that it is optimal for scheduling any mix of early-release ..."
Abstract
-
Cited by 113 (46 self)
- Add to MetaCart
-release and non-early-release asynchronous, periodic tasks. In contrast, almost all prior work on Pfair scheduling has been limited to synchronous systems. PD²is an optimization of an earlier deadline-based algorithm of Baruah, Gehrke, and Plaxton called PD; PD² uses a simpler tie
Dual-task interference in simple tasks: Data and theory
- Psychological Bulletin
, 1994
"... People often have trouble performing 2 relatively simple tasks concurrently. The causes of this interference and its implications for the nature of attentional limitations have been controversial for 40 years, but recent experimental findings are beginning to provide some answers. Studies of the psy ..."
Abstract
-
Cited by 434 (12 self)
- Add to MetaCart
of the psychological refractory period effect indicate a stubborn bottleneck encompassing the process of choosing actions and probably memory retrieval generally, together with certain other cognitive operations. Other limitations associated with task preparation, sensory-perceptual processes, and timing can generate
Scheduling Periodic Task Systems to Minimize Output Jitter
, 1999
"... Output jitter --- the variation in the inter-completion times of successive jobs of the same task --- is studied in the context of the preemptive uniprocessor scheduling of periodic real-time tasks. A formal quantitative model for output jitter is proposed. A list of properties that are desirable ..."
Abstract
-
Cited by 58 (10 self)
- Add to MetaCart
Output jitter --- the variation in the inter-completion times of successive jobs of the same task --- is studied in the context of the preemptive uniprocessor scheduling of periodic real-time tasks. A formal quantitative model for output jitter is proposed. A list of properties
Verifying Periodic Task-Control Systems
"... . This paper deals with the automated verification of a class of task-control systems with periods, durations, and scheduling specifications. Such systems are translated into Periodic Hybrid Automata for verification. We show that safety, liveness, and time-bounded properties are decidable for t ..."
Abstract
- Add to MetaCart
. This paper deals with the automated verification of a class of task-control systems with periods, durations, and scheduling specifications. Such systems are translated into Periodic Hybrid Automata for verification. We show that safety, liveness, and time-bounded properties are decidable
An improved schedulability test for uniprocessor periodic task systems
- In Proceedings of EuroMicro Conference on Real-Time Systems
, 2003
"... We present a sufficient linear-time schedulability test for preemptable, asynchronous, periodic task systems with arbitrary relative deadlines, scheduled on a uniprocessor by an optimal scheduling algorithm. We show analytically and empirically that this test is more accurate than the commonlyused d ..."
Abstract
-
Cited by 33 (0 self)
- Add to MetaCart
We present a sufficient linear-time schedulability test for preemptable, asynchronous, periodic task systems with arbitrary relative deadlines, scheduled on a uniprocessor by an optimal scheduling algorithm. We show analytically and empirically that this test is more accurate than the commonlyused
Pfair Scheduling: Beyond Periodic Task Systems
- In Proc. of the 7th International Conference on Real-Time Computing Systems and Applications
, 2000
"... In this paper, we consider variants of Pfair and ERfair scheduling in which subtasks may be released late, i.e., there may be separation between consecutive windows of the same task. We call such tasks intra-sporadic tasks. There are two main contributions of this paper. First, we show the existence ..."
Abstract
-
Cited by 70 (31 self)
- Add to MetaCart
In this paper, we consider variants of Pfair and ERfair scheduling in which subtasks may be released late, i.e., there may be separation between consecutive windows of the same task. We call such tasks intra-sporadic tasks. There are two main contributions of this paper. First, we show
A Learning Algorithm for Continually Running Fully Recurrent Neural Networks
, 1989
"... The exact form of a gradient-following learning algorithm for completely recurrent networks running in continually sampled time is derived and used as the basis for practical algorithms for temporal supervised learning tasks. These algorithms have: (1) the advantage that they do not require a precis ..."
Abstract
-
Cited by 534 (4 self)
- Add to MetaCart
The exact form of a gradient-following learning algorithm for completely recurrent networks running in continually sampled time is derived and used as the basis for practical algorithms for temporal supervised learning tasks. These algorithms have: (1) the advantage that they do not require a
Exploiting Skips In Periodic Tasks For Enhancing Aperiodic Responsiveness
- PROCEEDINGS FO REAL-TIME SYSTEMS SYMPOSIUM
, 1997
"... In certain real-time applications, ranging from multimedia to telecommunication systems, timing constraints can be more flexible than scheduling theory usually permits. For example, in video reception, missing a deadline is acceptable, provided that most deadlines are met. In this paper, we deal wit ..."
Abstract
-
Cited by 31 (3 self)
- Add to MetaCart
with the problem of scheduling hybrid sets of tasks, consisting of firm periodic tasks (i.e., tasks with deadlines which can occasionally skip one instance) and soft aperiodic requests, which have to be served as soon as possible to minimize their average response time. We propose and analyze an algorithm, based
Results 1 - 10
of
8,137
