Skip to main content
SpringerLink
Log in

Dispatching Discrete-Size Jobs with Multiple Deadlines to Parallel Heterogeneous Servers

  • Chapter
  • First Online:
Systems Modeling: Methodologies and Tools

Part of the book series: EAI/Springer Innovations in Communication and Computing ((EAISICC))

  • 1420 Accesses

Abstract

We study the M/D/1 queue and its generalization, the M/iD/1 queue, when jobs have firm deadlines for waiting (or sojourn) time. If a deadline is not met, a job-specific deadline violation cost is incurred. The M/iD/1 queue enables us to model both varying jobs sizes and batch arrival processes. We derive explicit value functions for these M/D/1-type of queues that enable the development of efficient cost-aware dispatching policies to parallel servers.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    We use the convention that 00 = 1 so that (3.7) holds also when τ = 0.

References

  1. J. Dean, L.A. Barroso, The tail at scale. Commun. ACM 56(2), 74–80 (2013)

    Article  Google Scholar 

  2. Z. Liu, M.S. Squillante, J.L. Wolf, On maximizing service-level-agreement profits, in Proceedings of the 3rd ACM Conference on Electronic Commerce, ser. EC ’01 (ACM, New York, 2001), pp. 213–223

    Google Scholar 

  3. E. Hyytiä, R. Righter, Routing jobs with deadlines to heterogeneous parallel servers. Oper. Res. Lett. 44(4), 507–513 (2016)

    Article  MathSciNet  Google Scholar 

  4. E. Hyytiä, R. Righter, O. Bilenne, X. Wu, Dispatching fixed-sized jobs with multiple deadlines to parallel heterogeneous servers. Perform. Eval. 114, 32–44 (2017)

    Article  Google Scholar 

  5. E. Hyytiä, A. Penttinen, S. Aalto, J. Virtamo, Dispatching problem with fixed size jobs and processor sharing discipline, in 23rd International Teletraffic Congress (ITC’23), San Fransisco (2011), pp. 190–197

    Google Scholar 

  6. E. Hyytiä, A. Penttinen, S. Aalto, Size- and state-aware dispatching problem with queue-specific job sizes. Eur. J. Oper. Res. 217(2), 357–370 (2012)

    Article  MathSciNet  Google Scholar 

  7. K.R. Krishnan, Joining the right queue: a state-dependent decision rule. IEEE Trans. Autom. Control 35(1), 104–108 (1990)

    Article  Google Scholar 

  8. E. Hyytiä, R. Righter, S. Aalto, Task assignment in a heterogeneous server farm with switching delays and general energy-aware cost structure. Perform. Eval. 75–76(0), 17–35 (2014)

    Article  Google Scholar 

  9. A. Penttinen, E. Hyytiä, S. Aalto, Energy-aware dispatching in parallel queues with on-off energy consumption, in 30th IEEE International Performance Computing and Communications Conference (IPCCC), Orlando, 2011

    Google Scholar 

  10. E. Hyytiä, J. Virtamo, S. Aalto, A. Penttinen, M/M/1-PS queue and size-aware task assignment. Perform. Eval. 68(11), 1136–1148 (2011)

    Article  Google Scholar 

  11. K.R. Krishnan, T.J. Ott, State-dependent routing for telephone traffic: theory and results, in IEEE Conference on Decision and Control, vol. 25 (1986), pp. 2124–2128

    Google Scholar 

  12. E. Hyytiä, R. Righter, J. Virtamo, L. Viitasaari, Value (generating) functions for the MX/G/1 queue, in 29th International Teletraffic Congress (ITC’29), Genoa, 2017

    Google Scholar 

  13. L. Takács, A single-server queue with Poisson input. Oper. Res. 10(3), 388–394 (1962)

    Article  MathSciNet  Google Scholar 

  14. L. Kleinrock, Queueing Systems, Volume I: Theory (Wiley Interscience, New York, 1975)

    MATH  Google Scholar 

  15. A. Erlang, Sandsynlighedsberegning og telefonsamtaler. Nyt tidsskrift for Matematik B 20, 33–39 (1909)

    MATH  Google Scholar 

  16. J.F. Shortle, P.H. Brill, Analytical distribution of waiting time in the M/{iD}/1 queue. Queueing Syst. 50(2), 185–197 (2005)

    Article  MathSciNet  Google Scholar 

  17. M. Harchol-Balter, M.E. Crovella, C.D. Murta, On choosing a task assignment policy for a distributed server system. J. Parallel Distrib. Comput. 59, 204–228 (1999)

    Article  Google Scholar 

  18. M. Harchol-Balter, Performance Modeling and Design of Computer Systems: Queueing Theory in Action (Cambridge University Press, Cambridge, 2013)

    MATH  Google Scholar 

  19. H. Wu, K. Wolter, Tradeoff analysis for mobile cloud offloading based on an additive energy-performance metric, in Proceedings of Valuetools’14 (2014), pp. 90–97

    Google Scholar 

  20. P. Whittle, Optimal Control: Basics and Beyond (Wiley, New York, 1996)

    MATH  Google Scholar 

  21. E. Hyytiä, Lookahead actions in dispatching to parallel queues. Perform. Eval. 70(10), 859–872 (2013)

    Article  Google Scholar 

Download references

Acknowledgements

This work was supported by the Academy of Finland in the FQ4BD project (grant nos. 296206).

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Iceland, Reykjavík, Iceland

    Esa Hyytiä

  2. Department of Industrial Engineering and Operations Research, UC Berkeley, Berkeley, CA, USA

    Rhonda Righter

  3. Department of Communications and Networking, Aalto University, Espoo, Finland

    Olivier Bilenne & Xiaohu Wu

Authors
  1. Esa Hyytiä
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Rhonda Righter
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Olivier Bilenne
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Xiaohu Wu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Esa Hyytiä .

Editor information

Editors and Affiliations

  1. Department of Engineering, University of Messina, Messina, Italy

    Antonio Puliafito

  2. ECE Department School of Engineering, Duke University, Durham, NC, USA

    Kishor S. Trivedi

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer International Publishing AG, part of Springer Nature

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Hyytiä, E., Righter, R., Bilenne, O., Wu, X. (2019). Dispatching Discrete-Size Jobs with Multiple Deadlines to Parallel Heterogeneous Servers. In: Puliafito, A., Trivedi, K. (eds) Systems Modeling: Methodologies and Tools. EAI/Springer Innovations in Communication and Computing. Springer, Cham. https://doi.org/10.1007/978-3-319-92378-9_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-92378-9_3

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-92377-2

  • Online ISBN: 978-3-319-92378-9

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation