Switches today provide a small menu of scheduling algorithms. While we can tweak
scheduling parameters, we cannot modify algorithmic logic, or add a completely new …

Programmable packet scheduling enables scheduling algorithms to be programmed into the
data plane without changing the hardware. Existing proposals either have no hardware …

We consider the problem of sharing multiple copies of some resource among various tasks.
We introduce a new notion of temporal fairness based on proportionate progress, called P …

We investigate the preemptive scheduling of periodic, real-time task systems on one
processor. First, we show that when all parameters to the system are integers, we may …

Within the hard real-time community, static priority pre-emptive scheduling is receiving
increased attention. Current optimal priority assignment schemes require that at some point …

In this paper, we consider two fundamental multiprocessor scheduling problems: q on-line
multiprocessor scheduling of sequential jobs in a hard-real-time environment, in which all …

Packet schedulers traditionally focus on the prioritized transmission of packets. Scheduling
is often realized through coarse-grained queue-level priorities, as in today's switches, or …

The scheduling of systems of periodic tasks upon multiprocessor platforms is considered.
Utilization-based conditions are derived for determining whether a periodic task system …

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 …

In applications ranging from video reception to telecommunications and packet
communication to aircraft control, tasks enter periodically and have fixed response time …