Skip to main content
SpringerLink
Log in

Server Cloud Scheduling

  • Conference paper
  • First Online:
Approximation and Online Algorithms (WAOA 2021)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 12982))

Included in the following conference series:

Abstract

Consider a set of jobs connected to a directed acyclic task graph with a fixed source and sink. The edges of this graph model precedence constraints and the jobs have to be scheduled with respect to those. We introduce the Server Cloud Scheduling problem, in which the jobs have to be processed either on a single local machine or on one of many cloud machines. Both the source and the sink have to be scheduled on the local machine. For each job, processing times both on the server and in the cloud are given. Furthermore, for each edge in the task graph, a communication delay is included in the input and has to be taken into account if one of the two jobs is scheduled on the server, the other in the cloud. The server can process jobs sequentially, whereas the cloud can serve as many as needed in parallel, but induces costs. We consider both makespan and cost minimization. The main results are an FPTAS with respect for the makespan objective for a fairly general case and strong hardness for the case with unit processing times and delays.

This work was partially supported by the German Research Foundation (DFG) within the Collaborative Research Centre “On-The-Fly Computing” under the project number 160364472—SFB 901/3.

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 49.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 64.99
Price excludes VAT (USA)
  • Compact, lightweight 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

References

  1. Ait Aba, M., Munier Kordon, A., Pallez (Aupy), G.: Scheduling on two unbounded resources with communication costs. In: Yahyapour, R. (ed.) Euro-Par 2019. LNCS, vol. 11725, pp. 117–128. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-29400-7_9

    Chapter  Google Scholar 

  2. Ait Aba, M., Aupy, G., Munier-Kordon, A.: Scheduling on Two Unbounded Resources with Communication Costs. Research Report RR-9264, Inria, March 2019. https://hal.inria.fr/hal-02076473

  3. Davies, S., Kulkarni, J., Rothvoss, T., Tarnawski, J., Zhang, Y.: Scheduling with communication delays via LP hierarchies and clustering. In: 61st IEEE Annual Symposium on Foundations of Computer Science, FOCS 2020, Durham, NC, USA, 16–19 November 2020, pp. 822–833. IEEE (2020). https://doi.org/10.1109/FOCS46700.2020.00081

  4. Davies, S., Kulkarni, J., Rothvoss, T., Tarnawski, J., Zhang, Y.: Scheduling with communication delays via LP hierarchies and clustering II: weighted completion times on related machines. In: Marx, D. (ed.) Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, SODA 2021, Virtual Conference, 10–13 January 2021, pp. 2958–2977. SIAM (2021). https://doi.org/10.1137/1.9781611976465.176

  5. Garg, S.: Quasi-ptas for scheduling with precedences using LP hierarchies. In: Chatzigiannakis, I., Kaklamanis, C., Marx, D., Sannella, D. (eds.) 45th International Colloquium on Automata, Languages, and Programming, ICALP 2018, July 9–13, 2018, Prague, Czech Republic. LIPIcs, vol. 107, pp. 59:1–59:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018). https://doi.org/10.4230/LIPIcs.ICALP.2018.59

  6. Graham, R.L.: Bounds for certain multiprocessing anomalies. Bell Syst. Tech. J. 45(9), 1563–1581 (1966). https://doi.org/10.1002/j.1538-7305.1966.tb01709.x

    Article  MATH  Google Scholar 

  7. Kulkarni, J., Li, S., Tarnawski, J., Ye, M.: Hierarchy-based algorithms for minimizing makespan under precedence and communication constraints. In: Chawla, S. (ed.) Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, SODA 2020, Salt Lake City, UT, USA, 5–8 January 2020, pp. 2770–2789. SIAM (2020). https://doi.org/10.1137/1.9781611975994.169

  8. Lenstra, J.K., Kan, A.H.G.R.: Complexity of scheduling under precedence constraints. Oper. Res. 26(1), 22–35 (1978). https://doi.org/10.1287/opre.26.1.22

  9. Levey, E., Rothvoss, T.: A (1+epsilon)-approximation for makespan scheduling with precedence constraints using LP hierarchies. In: Wichs, D., Mansour, Y. (eds.) Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2016, Cambridge, MA, USA, 18–21 June 2016, pp. 168–177. ACM (2016). https://doi.org/10.1145/2897518.2897532

  10. Mäcker, A., Malatyali, M., auf der Heide, F.M., Riechers, S.: Cost-efficient scheduling on machines from the cloud. J. Comb. Optim. 36(4), 1168–1194 (2018). https://doi.org/10.1007/s10878-017-0198-x

  11. Möhring, R.H., Schäffter, M.W., Schulz, A.S.: Scheduling jobs with communication delays: Using infeasible solutions for approximation. In: Diaz, J., Serna, M. (eds.) ESA 1996. LNCS, vol. 1136, pp. 76–90. Springer, Heidelberg (1996). https://doi.org/10.1007/3-540-61680-2_48

    Chapter  Google Scholar 

  12. Saha, B.: Renting a cloud. In: Seth, A., Vishnoi, N.K. (eds.) IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2013, December 12–14, 2013, Guwahati, India. LIPIcs, vol. 24, pp. 437–448. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2013). https://doi.org/10.4230/LIPIcs.FSTTCS.2013.437

  13. Svensson, O.: Hardness of precedence constrained scheduling on identical machines. SIAM J. Comput. 40(5), 1258–1274 (2011) https://doi.org/10.1137/100810502

Download references

Author information

Authors and Affiliations

  1. Heinz Nixdorf Institute & Department of Computer Science, Paderborn University, Paderborn, Germany

    Marten Maack, Friedhelm Meyer auf der Heide & Simon Pukrop

Authors
  1. Marten Maack
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Friedhelm Meyer auf der Heide
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Simon Pukrop
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Simon Pukrop .

Editor information

Editors and Affiliations

  1. University of Waterloo, Waterloo, ON, Canada

    Jochen Koenemann

  2. RWTH Aachen University, Aachen, Germany

    Britta Peis

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Maack, M., Meyer auf der Heide, F., Pukrop, S. (2021). Server Cloud Scheduling. In: Koenemann, J., Peis, B. (eds) Approximation and Online Algorithms. WAOA 2021. Lecture Notes in Computer Science(), vol 12982. Springer, Cham. https://doi.org/10.1007/978-3-030-92702-8_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-92702-8_10

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-92701-1

  • Online ISBN: 978-3-030-92702-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation