Skip to main content
SpringerLink
Log in

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

Journal of Scheduling volume 16, pages 423–428 (2013)Cite this article

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.

This is a preview of subscription content, access via your institution.

Access options

Buy single article

Instant access to the full article PDF.

USD 39.95

Price includes VAT (Canada)

References

  • Bhandari, V., Raghunathan, V., Bui, B. D., & Caccamo, M. (2007). Real-time implications of multiple transmission rates in wireless networks. In Proceedings MOBICOM (pp. 314–317).

    Google Scholar 

  • Dua, A., & Bambos, N. (2007). Downlink wireless packet scheduling with deadlines. IEEE Transactions on Mobile Computing, 6, 1410–1425.

    Article  Google Scholar 

  • Georgiadis, L., Guerin, R., & Parekh, A. (1997). Optimal multiplexing on a single link: delay and buffer requirements. IEEE Transactions on Information Theory, 43, 1518–1535.

    Article  Google Scholar 

  • Raghunathan, V. (2007). Physical-layer aware algorithms and protocols for wireless networks. Ph.D. Dissertation, University of Illinois at Urbana-Champaign.

  • Raghunathan, V., Borkar, V., Cao, M., & Kumar, P. R. (2008). Index policies for real-time multicast scheduling for wireless broadcast systems. In Proceedings IEEE Infocom (pp. 1570–1578).

    Google Scholar 

  • Ross, S. M. (1992). Applied probability models with optimization applications. New York: Dover.

    Google Scholar 

  • Shakkotai, S., & Srikant, R. (2002). Scheduling real-time traffic with deadlines over a wireless channel. Wireless Networks, 8, 13–26.

    Article  Google Scholar 

Download references

Acknowledgements

The author thanks the anonymous reviewer whose comments helped to improve the content and the presentation of the paper.

Author information

Authors and Affiliations

  1. Department of Mechanical Engineering, University of Thessaly, Pedion Areos, 38334, Volos, Greece

    Dimitrios G. Pandelis

Authors
  1. Dimitrios G. Pandelis
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Dimitrios G. Pandelis.

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Pandelis, D.G. A note on preemptive scheduling of multiclass jobs with geometric service times and hard deadlines. J Sched 16, 423–428 (2013). https://doi.org/10.1007/s10951-012-0293-x

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10951-012-0293-x

Keywords

  • Scheduling with deadlines
  • Geometric processing times
  • Dynamic programming
  • Wireless communications

Search

Navigation