Results 1 - 10 of 2,980

Scheduling Fixed-Priority Tasks with Preemption Threshold

by Yun Wang, Manas Saksena , 1999
"... In the context of fixed-priority scheduling, feasibility of a task set with non-preemptive scheduling does not imply the feasibility with preemptive scheduling and vice versa. In this paper, we use the notion of preemption threshold, first introduced by Express Logic, Inc. in their ThreadX real-time ..."
Abstract - Cited by 61 (0 self) - Add to MetaCart
In the context of fixed-priority scheduling, feasibility of a task set with non-preemptive scheduling does not imply the feasibility with preemptive scheduling and vice versa. In this paper, we use the notion of preemption threshold, first introduced by Express Logic, Inc. in their ThreadX real

Optimal Priority Assignment And Feasibility Of Static Priority Tasks With Arbitrary Start Times

by N.C. Audsley , 1991
"... Within the hard real-time community, static priority pre-emptive scheduling is receiving increased attention. Current optimal priority assignment schemes require that at some point in the system lifetime all tasks must be released simultaneously. Two main optimal priority assignment schemes have bee ..."
Abstract - Cited by 141 (2 self) - Add to MetaCart
Within the hard real-time community, static priority pre-emptive scheduling is receiving increased attention. Current optimal priority assignment schemes require that at some point in the system lifetime all tasks must be released simultaneously. Two main optimal priority assignment schemes have

Priority Tasks Allocation through the Maximum Entropy Principle

by Miguel A. Toledo C, J. Jesús Medel J - Proceedings of the 8th WSEAS International Conference on Automation and Information
"... Abstract: Priority scheduling assigns priorities via some task policy. In this work we introduce a priority tasks allocation model for soft-real-time systems. Task entities are analyzed as continuous stochastic processes with time restrictions specified by probability density functions with stationa ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
Abstract: Priority scheduling assigns priorities via some task policy. In this work we introduce a priority tasks allocation model for soft-real-time systems. Task entities are analyzed as continuous stochastic processes with time restrictions specified by probability density functions

Accounting for Interrupt Handling Costs in Dynamic Priority Task Systems

by Kevin Jeffay , Donald L. Stone , 1993
"... In order to apply the results of formal studies of real-time task models, a practitioner must account for the effects of phenomena present in the implementation but not present in the formal model. We study the feasibility and schedulability problems for periodic tasks that must compete for the pro ..."
Abstract - Cited by 99 (8 self) - Add to MetaCart
for the processor with interrupt handlers -- tasks that are assumed to always have priority over application tasks. The emphasis in the analysis is on deadline driven scheduling methods. We develop conditions that solve the feasibility and schedulability problems and demonstrate that our solutions

Performance Of Stochastic Rendezvous Networks With Priority Tasks

by J.W. Miernik, C.M. Woodside, J. E. Neilson, D. C. Petriu - Performace of Distributed and Parallel Systems , 1988
"... Multi-tasking multiprocessor systems frequently use rendezvous for intertask communication, and Stochastic Rendezvous Networks are a form of performance model for such systems. Tasks are frequently given different priorities to adjust the system performance. This paper considers a pre-emptive-resume ..."
Abstract - Cited by 3 (3 self) - Add to MetaCart
Multi-tasking multiprocessor systems frequently use rendezvous for intertask communication, and Stochastic Rendezvous Networks are a form of performance model for such systems. Tasks are frequently given different priorities to adjust the system performance. This paper considers a pre

Improving feasibility of fixed priority tasks using non-preemptive regions,” in RTSS,

by Marko Bertogna , Giorgio Buttazzo , Gang Yao , 2011
"... Abstract Preemptive schedulers have been widely adopted in single processor real-time systems to avoid the blocking associated with the non-preemptive execution of lower priority tasks and achieve a high processor utilization. However, under ..."
Abstract - Cited by 15 (7 self) - Add to MetaCart
Abstract Preemptive schedulers have been widely adopted in single processor real-time systems to avoid the blocking associated with the non-preemptive execution of lower priority tasks and achieve a high processor utilization. However, under

Applying New Scheduling Theory to Static Priority Pre-Emptive Scheduling

by N. Audsley, A. Burns, M. Richardson, K. Tindell, A. J. Wellings - Software Engineering Journal , 1993
"... The paper presents exact schedulability analyses for real-time systems scheduled at run-time with a static priority pre-emptive dispatcher. The tasks to be scheduled are allowed to experience internal blocking (from other tasks with which they share resources) and (with certain restrictions) release ..."
Abstract - Cited by 448 (64 self) - Add to MetaCart
The paper presents exact schedulability analyses for real-time systems scheduled at run-time with a static priority pre-emptive dispatcher. The tasks to be scheduled are allowed to experience internal blocking (from other tasks with which they share resources) and (with certain restrictions

Inside the black box: Raising standards through classroom assessment

by Paul Black, Dylan Wiliam - Phi Delta Kappan , 1998
"... Raising the standards of learning that are achieved through school education is an important national priority. Governments have been vigorous in the last ten years in making changes in pursuit of this aim. National curriculum testing, the development of the GCSE, league tables of school performance ..."
Abstract - Cited by 564 (7 self) - Add to MetaCart
Raising the standards of learning that are achieved through school education is an important national priority. Governments have been vigorous in the last ten years in making changes in pursuit of this aim. National curriculum testing, the development of the GCSE, league tables of school

Approximating response times for static-priority tasks with release jitters

by Pascal Richard - WIP, Euromicro Int. Conf. on Real-Time Systems (ECRTS’06 , 2006
"... We consider static-priority tasks with constrained-deadlines that are subjected to release jitters. We define an approximate worst-case response time analysis and we propose a polynomial time algorithm. For that purpose, we extend the Fully Polynomial Time Approximation Scheme (FPTAS) presented in [ ..."
Abstract - Cited by 3 (2 self) - Add to MetaCart
We consider static-priority tasks with constrained-deadlines that are subjected to release jitters. We define an approximate worst-case response time analysis and we propose a polynomial time algorithm. For that purpose, we extend the Fully Polynomial Time Approximation Scheme (FPTAS) presented

A REVIEW ON DYNAMIC FAIR PRIORITY TASK SCHEDULING ALGORITHM IN CLOUD COMPUTING

by Deepika Saxena Scholar, Dr. R. K. Chauhan
"... Abstract: Cloud computing, the term in present scenario, covers almost entire internet-based activity. Today, almost everything is deployed, run and managed on the cloud environment. The growing demand for cloud based activities and its day by day increasing count, of number of users and providers, ..."
Abstract - Add to MetaCart
scheduling strategy. In this paper we are providing review on different task scheduling algorithms and a review on our proposed task scheduling algorithm named “Dynamic fair priority task scheduling algorithm in cloud computing”.
Results 1 - 10 of 2,980