Results 1  10
of
36,762
Feasibility intervals for the deadline driven scheduler with arbitrary deadlines
, 1999
"... In this paper, we extend the determination of feasibility intervals to task sets with arbitrary deadlines, both in the synchronous and the asynchronous case. Meanwhile we also improve the arguments and results generally found in the literature. ..."
Abstract

Cited by 20 (6 self)
 Add to MetaCart
In this paper, we extend the determination of feasibility intervals to task sets with arbitrary deadlines, both in the synchronous and the asynchronous case. Meanwhile we also improve the arguments and results generally found in the literature.
Guaranteeing Synchronous Messages with Arbitrary Deadline Constraints
"... This paper addresses issues related to guaranteeing synchronous messages with arbitrary deadline constraints in an FDDI network. We show that several network parameters must be set carefully if message deadlines are to be satisfied. First, message deadlines can only be met if suficient synchronous ..."
Abstract
 Add to MetaCart
This paper addresses issues related to guaranteeing synchronous messages with arbitrary deadline constraints in an FDDI network. We show that several network parameters must be set carefully if message deadlines are to be satisfied. First, message deadlines can only be met if suficient
1 The Quadratic Utilization Upper Bound for Arbitrary Deadline RealTime Tasks
"... In high throughput applications, such as in multimedia, it is preferable to fully utilize computing resources, even at the price of some (bounded) delay. However, in realtime systems, where the maximum admissible delay is modeled by a deadline, most of the theory is developed with the assumption of ..."
Abstract
 Add to MetaCart
of a task deadline smaller than or equal to the task period. The reason of this limitation is in the intrinsic difficulty of the schedulability analysis in the arbitrary deadline case. The most notable guarantee test for sets of arbitrary deadline tasks was due to Lehoczky in 1990. In this paper, we
Fixed Priority Scheduling of Periodic Task Sets with Arbitrary Deadlines
"... This paper considers the problem of fixed priority scheduling of periodic tasks with arbitrary deadlines. A general criterion for the schedulability of such a task set is given. Worst case bounds are given which generalize the Liu and Layland bound. The results are shown to provide a basis for devel ..."
Abstract
 Add to MetaCart
This paper considers the problem of fixed priority scheduling of periodic tasks with arbitrary deadlines. A general criterion for the schedulability of such a task set is given. Worst case bounds are given which generalize the Liu and Layland bound. The results are shown to provide a basis
Feasibility Intervals for Multiprocessor FixedPriority Scheduling of Arbitrary Deadline Periodic Systems
"... In this paper we study the global scheduling of periodic task systems with arbitrary deadlines upon identical multiprocessor platforms. We first show two very general properties which are wellknown for uniprocessor platforms and which remain for multiprocessor platforms: (i) under few and not so re ..."
Abstract
 Add to MetaCart
In this paper we study the global scheduling of periodic task systems with arbitrary deadlines upon identical multiprocessor platforms. We first show two very general properties which are wellknown for uniprocessor platforms and which remain for multiprocessor platforms: (i) under few and not so
Guaranteeing Synchronous Messages with Arbitrary Deadline Constraints in an FDDI Network
 In Proceedings of the IEEE Conference on Local Computer Networks
, 1993
"... This paper addresses issues related to guaranteeing synchronous messages with arbitrary deadline constraints in an FDDI network. We show that several network parameters must be set carefully if message deadlines are to be satisfied. First, message deadlines can only be met if sufficient synchronous ..."
Abstract

Cited by 31 (7 self)
 Add to MetaCart
This paper addresses issues related to guaranteeing synchronous messages with arbitrary deadline constraints in an FDDI network. We show that several network parameters must be set carefully if message deadlines are to be satisfied. First, message deadlines can only be met if sufficient synchronous
FixedPriority Schedulability of ArbitraryDeadline Sporadic Tasks upon Periodic Resources
"... Schedulability for compositional realtime systems has been the focus of a great deal of recent research. In this problem domain, we consider the fixedpriority (FP) scheduling of arbitrarydeadline sporadic task systems upon periodic resources. Existing exact or approximate schedulability tests for ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
Schedulability for compositional realtime systems has been the focus of a great deal of recent research. In this problem domain, we consider the fixedpriority (FP) scheduling of arbitrarydeadline sporadic task systems upon periodic resources. Existing exact or approximate schedulability tests
A Response Time Bound in FixedPriority Scheduling with Arbitrary Deadlines
"... Abstract — Since worstcase response times must be determined repeatedly during the interactive design of realtime application systems, repeated exact computation of such response times would slow down the design process considerably. In this research, we identify three desirable properties of esti ..."
Abstract
 Add to MetaCart
Abstract — Since worstcase response times must be determined repeatedly during the interactive design of realtime application systems, repeated exact computation of such response times would slow down the design process considerably. In this research, we identify three desirable properties of estimates of the exact response times: continuity with respect to system parameters; efficient computability; and approximability. We derive a technique possessing these properties for estimating the worstcase response time of sporadic task systems that are scheduled using fixed priorities upon a preemptive uniprocessor. Index Terms — fixed priority scheduler, response time, approximation schemes, resource augmentation. I.
Quantifying the Suboptimality of Uniprocessor Fixed Priority Preemptive Scheduling for Sporadic Tasksets with Arbitrary Deadlines
"... This paper examines the relative effectiveness of fixed priority preemptive scheduling in a uniprocessor system, compared to an optimal algorithm such as Earliest Deadline First (EDF). The quantitative metric used in this comparison is the processor speedup factor, defined as the factor by which pr ..."
Abstract

Cited by 6 (4 self)
 Add to MetaCart
This paper examines the relative effectiveness of fixed priority preemptive scheduling in a uniprocessor system, compared to an optimal algorithm such as Earliest Deadline First (EDF). The quantitative metric used in this comparison is the processor speedup factor, defined as the factor by which
Performance Evaluation of a Bandwidth Allocation Scheme for Guaranteeing Synchronous Messages with Arbitrary Deadlines in an FDDI Network
 In Proceedings of the IEEE RealTime Systems Symposium
, 1993
"... In this paper, we study the performance of FDDI networks in terms of their guarantee probability, i.e., the probability that a set of synchronous messages are guaranteed to meet their deadlines. Traditional techniques such as queuing analysis cannot be directly used to derive the guarantee probabili ..."
Abstract

Cited by 13 (4 self)
 Add to MetaCart
In this paper, we study the performance of FDDI networks in terms of their guarantee probability, i.e., the probability that a set of synchronous messages are guaranteed to meet their deadlines. Traditional techniques such as queuing analysis cannot be directly used to derive the guarantee
Results 1  10
of
36,762