In this paper, we provide an efficient solution for periodic real-time tasks with (potentially) different power consumption characteristics. We show that, a task T, can run a t a constant speed 5';. at every instance without hurting optimality. We sketch an O(n2 log n) algorithm to compute the optimal S;. values. We also prove that the EDF (Earliest Deadline First) scheduling policy can be used...

In this paper we present the utilization bound for Earliest Deadline First (EDF) scheduling on homogeneous multiprocessor systems with partitioning strategies. Assuming that tasks are pre-emptively scheduled on each processor according to the EDF algorithm, and allocated according to the First Fit (FF) heuristic, we prove that the worst-case achievable utilization is 0:5(n + 1), where n is the ...

In this paper, we consider a queue with impatient customers, under general assumptions. We introduce a convenient representation of the system by a stochastic recursive sequence keeping track of the remaining service and patience times of the customers. This description allows us (i) to provide a comprehensive stability condition in the general case, (ii) to give a rigorous proof of the optimal...

Abstract—This work studies the impact in parallel processing of Interlocked-Hardware-Microkernel (IHM) Plasma microprocessor (IHM-Plasma) by implementing Earliest-Deadline-First (EDF) algorithm hardware task-scheduler block that belongs to those task-based operational systems, such as related real-time systems (RTOS). IHM-Plasma presents Reduced Instruction Set Computer (RISC) architecture. The...

This paper deals with the study of Earliest Deadline First (EDF) which is an optimal scheduling algorithm for uniprocessor real time systems use for scheduling the periodic task in soft real-time multiprocessor systems. In hard real-time systems, a significant disparity exists EDF-based schemes and RMA scheduling (which is the only known way of optimally scheduling recurrent real-time tasks on ...

The present paper describes an extension to real-time analysis of earliest-deadline first (EDF) scheduled embedded systems to allow design space exploration with different intertask communication. The event stream approach for real-time analysis is generalized to unbuffered task communication. Adding this analysis technique to a well known cost model for system level synthesis, it becomes possi...

Reflex is a generic event driven OS for embedded devices. Event handlers and control functions are all represented by passive objects that are scheduled preemptively according to an earliest deadline first (EDF) strategy. The synchronization of events is based on an event flow model similar to the data flow paradigm. In this paper we will present the design rationale of Reflex and particularly ...

In this paper, we develop an analytical framework for providing statistical delay guarantees in an Earliest Deadline First (EDF) scheduler which multiplexes traf-c from multiple markovian sources with heterogeneous delay requirements. Our framework permits the computation of steady-state delay bound violation probabilities (i.e., the fraction of traac that does not meet its delay bounds) at the...

In this paper, we validate the performance of the MKMV EDF credit measure in its timeliness of default prediction, ability to discriminate good firms from bad firms, and accuracy of levels, with a focus on U.S. markets. We focus on the period 1996-2004 for most of our tests. Wherever possible, we compare the performance to that of other popular alternatives like agency ratings, Z-Scores, and a ...

This paper presents work on a switched Ethernet network extended to allow for periodic real-time traffic, using earliest deadline first (EDF) scheduling. A scheme of asymmetrically dividing deadlines of real-time channels between the in and outgoing links to/from the switch is proposed (ADPS). The result of the simulations of setting up RT channels over a full-duplex switched Ethernet network i...