Server Cloud Scheduling
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 infinitely many cloud machines. 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 and the other in the cloud. The server processes 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 for the makespan objective for graphs with a constant source and sink dividing cut and strong hardness for the case with unit processing times and delays.
References
[1]
Graham RL Bounds for certain multiprocessing anomalies Bell Syst. Tech. J. 1966 45 9 1563-1581
[2]
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, June 18–21, 2016, pp. 168–177 (2016).
[3]
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–15913 (2018).
[4]
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, January 5–8, 2020, pp. 2770–2789 (2020).
[5]
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, November 16–19, 2020, pp. 822–833 (2020).
[6]
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, January 10–13, 2021, pp. 2958–2977 (2021).
[7]
Aba, M.A., Kordon, A.M., Pallez, G.: Scheduling on two unbounded resources with communication costs. In: Yahyapour, R. (ed.) Euro-Par 2019: Parallel Processing—25th International Conference on Parallel and Distributed Computing, Göttingen, Germany, August 26–30, 2019, Proceedings. Lecture Notes in Computer Science, vol. 11725, pp. 117–128 (2019).
[8]
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 (2013).
[9]
Mäcker A, Malatyali M, auf der Heide FM, and Riechers S Cost-efficient scheduling on machines from the cloud J. Comb. Optim. 2018 36 4 1168-1194
[10]
Maack, M., auf der Heide, F.M., Pukrop, S.: Server cloud scheduling. In: Könemann, J., Peis, B. (eds.) Approximation and Online Algorithms—19th International Workshop, WAOA 2021, Lisbon, Portugal, September 6–10, 2021, Revised Selected Papers. Lecture Notes in Computer Science, vol. 12982, pp. 144–164 (2021).
[11]
Lenstra JK, Kan AR, and Brucker P Complexity of machine scheduling problems Ann. Discrete Math. 1977 1 343-362
[12]
Lenstra JK and Kan AHGR Complexity of scheduling under precedence constraints Oper. Res. 1978 26 1 22-35
[13]
Svensson O Hardness of precedence constrained scheduling on identical machines SIAM J. Comput. 2011 40 5 1258-1274
[14]
Graham RL, Lawler EL, Lenstra JK, and Kan AR Optimization and approximation in deterministic sequencing and scheduling: a survey Ann. Discrete Math. 1979 5 287-326
[15]
Lawler EL and Moore JM A functional equation and its application to resource allocation and sequencing problems Manag. Sci. 1969 16 1 77-84
[16]
Sahni S Algorithms for scheduling independent tasks J. ACM 1976 23 1 116-127
[17]
Adamu MO and Adewumi AO A survey of single machine scheduling to minimize weighted number of tardy jobs J. Ind. Manag. Optim. 2014 10 1 219
[18]
Detienne B A mixed integer linear programming approach to minimize the number of late jobs with and without machine availability constraints Eur. J. Oper. Res. 2014 235 3 540-552
[19]
Sevaux M and Dauzère-Pérès S Genetic algorithms to minimize the weighted number of late jobs on a single machine Eur. J. Oper. Res. 2003 151 2 296-306
[20]
M’Hallah R and Bulfin RL Minimizing the weighted number of tardy jobs on a single machine with release dates Eur. J. Oper. Res. 2007 176 2 727-744
[21]
Möhring, R.H., Schäffter, M.W., Schulz, A.S.: Scheduling jobs with communication delays: Using infeasible solutions for approximation (extended abstract). In: Díaz, J., Serna, M.J. (eds.) Algorithms—ESA ’96, Fourth Annual European Symposium, Barcelona, Spain, September 25–27, 1996, Proceedings. Lecture Notes in Computer Science, vol. 1136, pp. 76–90 (1996).
[22]
Legriel, J., Guernic, C.L., Cotton, S., Maler, O.: Approximating the pareto front of multi-criteria optimization problems. In: Esparza, J., Majumdar, R. (eds.) Tools and Algorithms for the Construction and Analysis of Systems, 16th International Conference, TACAS 2010, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2010, Paphos, Cyprus, March 20–28, 2010. Proceedings. Lecture Notes in Computer Science, vol. 6015, pp. 69–83 (2010).
[23]
Papadimitriou, C.H., Yannakakis, M.: On the approximability of trade-offs and optimal access of web sources. In: 41st Annual Symposium on Foundations of Computer Science, FOCS 2000, 12–14 November 2000, Redondo Beach, California, USA, pp. 86–92 (2000).
Recommendations
Server Cloud Scheduling
Approximation and Online AlgorithmsAbstractConsider 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 ...
Non-Approximability Results for Scheduling Problems with Minsum Criteria
<P>We provide several non-approximability results for deterministic scheduling problems whose objective is to minimize the total job completion time. Unless 𝒫 =𝒩𝒫, none of the problems under consideration can be approximated in polynomial time within ...
Cost-efficient scheduling on machines from the cloud
We consider a scheduling problem where machines need to be rented from the cloud in order to process jobs. There are two types of machines available which can be rented for machine-type dependent prices and for arbitrary durations. However, a machine-...
Comments
Information & Contributors
Information
Published In
© The Author(s) 2023.
Publisher
Springer-Verlag
Berlin, Heidelberg
Publication History
Published: 10 December 2023
Accepted: 06 November 2023
Received: 17 November 2022
Author Tags
Qualifiers
- Research-article
Funding Sources
- Deutsche Forschungsgemeinschaft
- Universität Paderborn (3159)
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Other Metrics
Citations
View Options
View options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in