This paper addresses resource reclaiming in the con text of non preemptive priority list scheduling for hard real time systems Such scheduling is inherently suscep tible to multiprocessor timing anomalies We present low overhead run time stabilization methods for a gen eral tasking model that allows phantom tasks as a mech anism to model processor external events A family of scheduling algorith...

The Earliest Deadline First (EDF) scheduling algorithm has the least runtime complexity among joblevel fixed-priority algorithms for scheduling tasks on multiprocessor architectures. However, EDF suffers from suboptimality in multiprocessor systems. This paper proposes a new restricted migration-based scheduling algorithm for multiprocessor real-time systems, called Two-level Hierarchical Sched...

Multimedia applications require operating systems that support time-constrained data types such as digital audio and video. These continuous media [1] demand timely service from the system, and time-sharing scheduling algorithms are not sufficient. Furthermore, simple fixed priority scheduling, used in many hard real-time systems, does not necessarily guarantee the successful execution of arbit...

Earliest deadline first (edf) is a widely used algorithm for online deadline scheduling. It has been known for long that edf is optimal for scheduling an underloaded, single-processor system; recent results on the extra-resource analysis of edf further revealed that edf when using moderately faster processors can achieve optimal performance in the underloaded, multi-processor setting. This pape...

In this paper we analyze a scheduling problem where each job j E J is executed in dependence to a branching forest. We have a set of processor types P with a price c(p) for each processor of type p E P. A job j processed on a processor of type p E P has an execution time e(j,p) E N. Given a deadline d E N, we consider the problem to select a minimum cost set of processors (allowing an unlimited...

In real-time environments, tasks have to complete by their deadlines. As we restrict our attention to mono-processor systems, a scheduling algorithm aims to determine which task is to execute on the processor [1,2]. On-line scheduling algorithms have been designed under non-overloaded conditions. We say that a real-time system is overloaded when it is impossible to schedule it on the processor ...

In this work we present an innovative kernel-level scheduling methodology designed for multiprogrammed shared-memory multiprocessors. We propose three scheduling policies equipped with both dynamic space sharing and time sharing, to ensure the scalability of parallel programs under multiprogramming while increasing processor utilization and overall system performance. Our scheduling methodology...