Abstract
We study non-clairvoyant scheduling to minimize weighted flow time on two different multi-processor models. In the first model, processors are all identical and jobs can possibly be speeded up by running on several processors in parallel. Under the non-clairvoyant model, the online scheduler has no information about the actual job size and degree of speed-up due to parallelism during the execution of a job, yet it has to determine dynamically when and how many processors to run the jobs. The literature contains several O(1)-competitive algorithms for this problem under the unit-weight multi-processor setting [9,10] as well as the weighted single-processor setting [2]. This paper shows the first O(1)-competitive algorithm for weighted flow time in the multi-processor setting.
In the second model, we consider processors with different functionalities and only processors of the same functionality can work on the same job in parallel to achieve some degree of speed up. Here a job is modeled as a sequence of non-clairvoyant demands of different functionalities. This model is derived naturally from the classical job shop scheduling; but as far as we know, there is no previous work on scheduling to minimize flow time under this multi-processor model. In this paper we take a first step to study non-clairvoyant scheduling on this multi-processor model. Motivated by the literature on 2-machine job shop scheduling, we focus on the special case when processors are divided into two types of functionalities, and we show a non-clairvoyant algorithm that is O(1)-competitive for weighted flow time.
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
Anderson, E.J., Jayram, T.S., Kimbrel, T.: Tighter bounds on preemptive job shop scheduling with two machines. Computing 67(1), 83–90 (2001)
Bansal, N., Dhamdhere, K.: Minimizing weighted flow time. ACM Transactions on Algorithms 3(4) (2007)
Bansal, N., Kimbrel, T., Sviridenko, M.: Job shop scheduling with unit processing times. In: Proceedings of ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 207–214 (2005)
Brucker, P.: Job-shop scheduling problem. In: Floudas, C.A., Pardalos, P.M. (eds.) Encyclopedia of Optimization, pp. 1782–1788. Springer, Heidelberg (2009)
Chan, H.-L., Edmonds, J., Pruhs, K.: Speed scaling of processes with arbitrary speedup curves on a multiprocessor. In: SPAA, pp. 1–10 (2009)
Chan, S.-H., Lam, T.-W., Lee, L.-K.: Non-Clairvoyant Speed Scaling for Weighted Flow Time. In: de Berg, M., Meyer, U. (eds.) ESA 2010, Part I. LNCS, vol. 6346, pp. 23–35. Springer, Heidelberg (2010)
Chen, B., Vestjens, A.P.A., Woeginger, G.J.: On-line scheduling of two-machine open shops where jobs arrive over time. J. Comb. Optim. 1(4), 355–365 (1998)
Della Croce, F., Narayan, V., Tadei, R.: The two-machine total completion time flow shop problem. European Journal of Operational Research 90(2), 227–237 (1996)
Edmonds, J.: Scheduling in the dark. Theor. Comput. Sci. 235(1), 109–141 (2000)
Edmonds, J., Pruhs, K.: Scalably scheduling processes with arbitrary speedup curves. In: Proceedings of ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 685–692 (2009)
Kalyanasundaram, B., Pruhs, K.: Speed is as powerful as clairvoyance. J. ACM 47(4), 617–643 (2000)
Motwani, R., Phillips, S., Torng, E.: Non-clairvoyant scheduling. Theor. Comput. Sci. 130(1), 17–47 (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhu, J., Chan, HL., Lam, TW. (2012). Non-clairvoyant Weighted Flow Time Scheduling on Different Multi-processor Models. In: Solis-Oba, R., Persiano, G. (eds) Approximation and Online Algorithms. WAOA 2011. Lecture Notes in Computer Science, vol 7164. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29116-6_12
Download citation
DOI: https://doi.org/10.1007/978-3-642-29116-6_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-29115-9
Online ISBN: 978-3-642-29116-6
eBook Packages: Computer ScienceComputer Science (R0)