This survey covers hard real-time scheduling algorithms and schedulability analysis
techniques for homogeneous multiprocessor systems. It reviews the key results in this field …

The scheduling of computer and manufacturing systems has been the subject of extensive
research for over forty years. In addition to computers and manufacturing, scheduling theory …

Consideration is given to the preemptive scheduling of hard-real-time sporadic task systems
on one processor. The authors first give necessary and sufficient conditions for a sporadic …

This paper summarizes the state of the real-time field in the areas of scheduling and
operating system kernels. Given the vast amount of work that has been done by both the …

In this chapter, we summarize research e orts on several di erent problems that fall under the
rubric of online scheduling. In online scheduling, the scheduler receives jobs that arrive over …

We consider the problem of optimal real-time scheduling of periodic and sporadic tasks for
identical multiprocessors. A number of recent papers have used the notions of fluid …

We have seen a variety of on-line scheduling problems. Many of them are understood
satisfactorily, but there are also many interesting open problems. Studied scheduling …

Scheduling problems with processing set restrictions have been studied extensively by
computer scientists and operations researchers under different names. These include …

Each processor in a uniform multiprocessor machine is characterized by a speed or
computing capacity, with the interpretation that a job executing on a processor with speed s …

Conserving the energy consumption of large data centers is of critical significance, where a
few percent in consumption reduction translates into millions-dollar savings. This work …