Abstract
We investigate variants of the problem of scheduling tasks on uniformly related machines to minimize the makespan. In the k-splittable scheduling problem each task can be broken into at most k ≥ 2 pieces to be assigned to different machines. In a more general SAC problem each task j has its own splittability parameter k j ≥ 2. These problems are NP-hard and previous research focuses mainly on approximation algorithms.
Our motivation to study these scheduling problems is traffic allocation for server farms based on a variant of the Internet Domain Name Service (DNS) that uses a stochastic splitting of request streams. We show that the traffic allocation problem with standard latency functions from Queueing Theory cannot be approximated in polynomial time within any finite factor because of the extreme behavior of these functions.
Our main result is a polynomial time, exact algorithm for the k-splittable scheduling problem as well as the SAC problem with a fixed number of machines. The running time of our algorithm is exponential in the number of machines but is only linear in the number of tasks. This result is the first proof that bounded splittability reduces the complexity of scheduling as the unsplittable scheduling is known to be NP-hard already for two machines. Furthermore, since our algorithm solves the scheduling problem exactly, it also solves the traffic allocation problem.
Partially supported by DFG grants Vo889/1-1, Sa933/1-1, and the IST program of the EU under contract IST-1999-14186 (ALCOM-FT).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Agarwal, A., Agarwal, T., Chopra, S., Feldmann, A., Kammenhuber, N., Krysta, P., Vöcking, B.: An Experimental Study of k-Splittable Scheduling for DNS-Based Traffic Allocation. To appear in Proc. of the 9th EUROPAR (2003)
Alon, N., Azar, Y., Woeginger, G.J., Yadid, T.: Approximation schemes for scheduling on parallel machines. Journal of Scheduling 1, 55–66 (1998)
Blum, M., Floyd, R., Pratt, V., Rivest, R., Tarjan, R.: Time bounds for selection. J. Computer and System Science 7(4), 448–461 (1973)
Epstein, L., Sgall, J.: Approximation schemes for scheduling on uniformly related and identical parallel machines. In: Proc. of the 7th ESA, pp. 151–162 (1999)
Hochbaum, D.S., Shmoys, D.B.: Using dual approximation algorithms for scheduling problems: theoretical and practical results. J. ACM 34, 144–162 (1987)
Hochbaum, D.S., Shmoys, D.B.: A polynomial approximation scheme for scheduling on uniform processors: using the dual approximation approach. SIAM Journal on Computing 17, 539–551 (1988)
Horowitz, E., Sahni, S.K.: Exact and approximate algorithms for scheduling nonidentical processors. J. ACM 23, 317–327 (1976)
Kurose, J.F., Ross, K.W.: Computer networking: a top-down approach featuring the Internet. Addison-Wesley, Reading (2001)
Kwek, S., Mehlhorn, K.: Optimal search for rationals. Information Processing Letters 86, 23–26 (2003)
McNaughton, R.: Scheduling with deadlines and loss functions. Management Science 6, 1–12 (1959)
Papadimitriou, C.H.: Efficient search for rationals. Information Processing Letters 8, 1–4 (1979)
Shachnai, H., Tamir, T.: Multiprocessor Scheduling with Machine Allotment and Parallelism Constraints. Algorithmica 32(4), 651–678 (2002)
Xing, W., Zhang, J.: Parallel machine scheduling with splitting jobs. Discrete Applied Mathematics 103, 259–269 (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Krysta, P., Sanders, P., Vöcking, B. (2003). Scheduling and Traffic Allocation for Tasks with Bounded Splittability. In: Rovan, B., Vojtáš, P. (eds) Mathematical Foundations of Computer Science 2003. MFCS 2003. Lecture Notes in Computer Science, vol 2747. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45138-9_44
Download citation
DOI: https://doi.org/10.1007/978-3-540-45138-9_44
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40671-6
Online ISBN: 978-3-540-45138-9
eBook Packages: Springer Book Archive