Journal of the ACM (JACM)
A Performance Analysis of Minimum Laxity and Earliest Deadline Scheduling in a Real-Time System
IEEE Transactions on Computers
Time constrained and multiaccess communications (packet-switched networks, scheduling, queues impatience, contention, resolution, algorithms)
An approximate analysis of waiting time in multi-class M/G/1/./EDF queues
Proceedings of the 1996 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Deadline-based connection setup in wavelength-routed WDM networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 14.98 |
The behavior of two policies for scheduling customers with deadlines until the beginning of service onto multiprocessors is studied. Both policies attempt to approximate the performance of the minimum laxity (ML) scheduling policy without incurring its complete overhead by dividing the queue in two: one, of maximum size n