Analysis provided for fixed priority pre-emptive scheduling enables a priori guarantees to be given regarding the timing requirements of critical tasks. By comparison, Best-Effort scheduling maximises system utility, but at best provides only probabilistic guarantees that time constraints will be met. In this paper, we show how these two schemes can be integrated. A new Adaptive Value-Density T...

background: to compare a flexible, multi-dose gnrh antagonist protocol with a long gnrh .agonist protocol in poor respo materials and methods: a randomized clinical trial of 70 poor responder patients (35 patients in gnrh antagonist protocol and 35 patients in long gnrh agonist protocol) was performed at royan institute, tehran, iran. both groups were given a fixed dose of human menopausal gona...

A number of industrial applications advocate the use of time triggered approaches for reasons of predictability, distribution, and particular constraints such as jitter or end-to-end deadlines. The rigid offline scheduling schemes used for time triggered systems, however, do not provide for flexibility. Fixed priority scheduling can provide more flexibility, but is limited with respect to predi...

The purpose of this article is to (i) highlight the flaws in three previously published works [3][2][7] on the worst-case response time analysis for tasks with self-suspensions and (ii) provide straightforward fixes for those flaws, hence rendering the analysis safe. 2012 ACM Subject Classification MANDATORY: Please refer to www.acm.org/about/class/2012

An exact analysis of the worst case response time of multiframe (MF) tasks executing on a uniprocessor according to the fixed priority scheduling scheme is presented in this paper. The paper proves that worst case response time analysis is not feasible in general; but shows how the number of releases that need to be considered in such analysis can be significantly reduced by eliminating non cri...

In this paper, we consider the generalized power model in which the focus is the dynamic power and the static power, and we study the problem of the canonical sporadic task scheduling based on the ratemonotonic (RM) scheme. Moreover, we combine with the dynamic voltage scaling (DVS) and dynamic power management (DPM). We present a static low power sporadic tasks scheduling algorithm (SSTLPSA), ...

Feasibility analysis of fixed priority systems has been widely studied in the real-time literature and several acceptance tests have been proposed to guarantee a set of periodic tasks. They can be divided in two main classes: polynomial time tests and exact tests. Polynomial time tests are used for on-line guarantee of dynamic systems, where tasks can be activated at runtime. These tests introd...

The fundamental requirement for the design of effective and efficient fault-tolerance mechanisms in dependable real-time systems is a realistic and applicable model of potential faults, their manifestations and consequences. Fault and error models also need to be evolved based on the changes in the environments of usage or even based on technological advances. In this paper we propose a novel p...

Engine control applications require the execution of tasks activated in relation to specific system variables, as the crankshaft rotation angle. To prevent possible overload conditions at high rotation speeds, such tasks are designed to vary their functionality (hence their computational requirements) for different speed ranges. Modeling and analyzing such a type of tasks poses new research cha...

In this paper we show how off-line scheduling and fixed priority scheduling (FPS) can be combined to get the advantages of both the capability to cope with complex timing constraints while providing run-time flexibility. We present a method to take advantage of the flexibility provided by FPS while guaranteeing complex constraint satisfaction on periodic tasks. We provide mechanisms to include ...