This paper focuses on scheduling different hard real-time applications on a uniprocessor when the earliest deadline first algorithm is used as the local scheduler, and the global ...
This paper presents real-time scheduling techniques for reducing the response time of aperiodic tasks scheduled with real-time periodic tasks on multiprocessor systems. Two proble...
It is well known that the Earliest-Deadline-First (EDF) and the Least-Laxity-First (LLF) algorithms are optimal algorithms for the problem of preemptively scheduling jobs that arr...
In uniform multiprocessor platforms, the various processors comprising the multiprocessor platform may have different computing capacities. The focus of this paper is the design o...
A hybrid scheduling algorithm is proposed, which integrates features of the Fixed Priority (FP) and Earliest Deadline First (EDF) scheduling policies. It is shown that this hybrid...