— We develop distributed scheduling schemes that are based on simple random access algorithms and that have no message passing. In spite of their simplicity, these schemes are sh...
We present an approach to the analysis and optimisation of heterogeneous multiprocessor embedded systems. The systems are heterogeneous not only in terms of hardware components, b...
We study the problem of on-line scheduling on two uniformly related machines where the on-line algorithm has resources different from those of the off-line algorithm. We consider ...
Packet scheduling algorithms in switches and routers will likely play a critical role in providing the Quality-of-Service (QoS) guarantees required by many real-time multimedia ap...
In this paper we develop a two stage algorithm for scheduling call centers with strict SLAs and arrival rate uncertainty. The first cut schedule can be developed in less than a mi...