We consider a single-processor firm real-time (FRT) system with exponential inter-arrival and execution times for jobs with relative deadlines following a general distribution. The scheduling policy of the system is first-come first-served (FCFS) and the capacity of the system is arbitrary. This system is subject to an arbitrary shaped time/utility function (TUF) which determines the accrued ut...

We consider a resource synthesis technique for realtime systems where the energy budget is limited and the performance of the system depends on how resources and energy are used. We consider two performance models for a task: (1) a task has variable execution time and performance of a task depends on the amount of execution time received and (2) the execution time of a task is constant and the ...

This paper develops a framework for statistically guaranteeing end-to-end delay bounds to leaky-bucket-constrained flows transporting real-time traffic in a network of switches using Earliest Deadline First (EDF) packet scheduling and per-hop traffic shaping. We first analyze the delay-bound violation probabilities at an isolated EDF scheduler fed by fluid source processes generating extremal d...

Over the years, the preemptive periodic constrained-deadline task model [9] has proven remarkably useful for the modeling of recurring processes that occur in hard real-time computer application systems, where the failure to satisfy any constraint may have disastrous consequences. The problem of scheduling such tasks upon a single processor (CPU) so that all the deadlines are met has been widel...

Abstract In this chapter, to improve the schedulability of high-criticality flows when network is running, we present a supply/demand bound function analysis method based on earliest deadline first (EDF) scheduling. addition, our considers both source routing and graph routing. At beginning, in low-criticality mode, applied. When errors or exceptions occur, switches turns guarantee that critica...

This paper examines the relative effectiveness of fixed priority pre-emptive 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 processor speed needs to increase to ensure that any taskset that is schedulable according to an op...

Time constraint is the main factor in real time operating system. Different scheduling algorithm is used to schedule the task. The Earliest Deadline First and Ant Colony Optimization is a dynamic scheduling algorithm used in a real time system and it is most beneficial scheduling algorithm for single processor real-time operating systems when the systems are preemptive and under loaded. The mai...

This paper reports on our on going empirical evalu ation of a two tiered resource allocation scheme assum ing independent jobs that is jobs have no precedence constraints The rst tier extends the temporal density approach load balancing within a time interval while the second tier uses variations of the Earliest Deadline First EDF approach to schedule jobs at a site However job scheduling at si...

Tasks of an application program of an embedded system are managed by the scheduler of a real-time operating system (RTOS). Most RTOSs adopt just fixed priority scheduling, which is not optimal in all cases. Some applications require earliest deadline first (EDF) scheduling, which is an optimal scheduling algorithm. In order to develop an efficient real-time embedded system, the scheduling algor...

This paper reports on our on going empirical evalu ation of a two tiered resource allocation scheme assum ing independent jobs that is jobs have no precedence constraints The rst tier extends the temporal density approach load balancing within a time interval while the second tier uses variations of the Earliest Deadline First EDF approach to schedule jobs at a site However job scheduling at si...