A note on preemptive scheduling of multiclass jobs with geometric service times and hard deadlines

Authors:
Dimitrios G. Pandelis
Affiliations:
Department of Mechanical Engineering, University of Thessaly, Volos, Greece 38334
Venue:
Journal of Scheduling
Year:
2013

Citing 5
Cited 0

Scheduling real-time traffic with deadlines over a wireless channel

Wireless Networks
Real-time implications of multiple transmission rates in wireless networks

Proceedings of the 13th annual ACM international conference on Mobile computing and networking
Downlink Wireless Packet Scheduling with Deadlines

IEEE Transactions on Mobile Computing
Physical layer aware algorithms and protocols for wireless networks

Physical layer aware algorithms and protocols for wireless networks
Optimal multiplexing on a single link: delay and buffer requirements

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the scheduling of multiclass jobs with deadlines to the completion of their service. Deadlines are deterministic and job arrivals in each class occur at the times of deadline expirations in the respective class. Assuming geometric service times with class dependent means, we derive structural properties of preemptive server allocation policies that maximize the expected number of job completions. Our work extends results that have appeared in the real-time wireless scheduling literature.