Abstract
In this paper we tackle the well-known problem of scheduling a collection of parallel jobs on a set of processors either in a cluster or in a multiprocessor computer. For the makespan objective, i.e., the completion time of the last job, this problem has been shown to be NP-Hard and several heuristics have already been proposed to minimize the execution time. We introduce a novel approach based on successive linear programming (LP) approximations of a sparse model. The idea is to relax an integer linear program and use ℓ p norm-based operators to force the solver to find almost-integer solutions that can be assimilated to an integer solution. We consider the case where jobs are either rigid or moldable. A rigid parallel job is performed with a predefined number of processors while a moldable job can define the number of processors that it is using just before it starts its execution. We compare the scheduling approach with the classic Largest Task First list based algorithm and we show that our approach provides good results for small instances of the problem. The contributions of this paper are both the integration of mathematical methods in the scheduling world and the design of a promising approach which gives good results for scheduling problems with less than a hundred processors.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
References
Afrati, F.N., Bampis, E., Fishkin, A.V., Jansen, K., Kenyon, C.: Scheduling to minimize the average completion time of dedicated tasks. In: Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science, FST TCS 2000, London, UK, pp. 454–464 (2000)
Amoura, A.K., Bampis, E., Kenyon, C., Manoussakis, Y.: Scheduling independent multiprocessor tasks. Algorithmica 32(2), 247–261 (2002)
Candes, E.J., Romberg, J., Tao, T.: Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information. IEEE Transactions on Information Theory 52(2), 489–509 (2006)
Candes, E.J., Wakin, M.B., Boyd, S.P.: Enhancing Sparsity by Reweighted L1 Minimization. Journal of Fourier Analysis and Applications 14(5), 877–905 (2008)
Casanova, H., Legrand, A., Quinson, M.: Simgrid: A generic framework for large-scale distributed experiments. In: UKSIM 2008, pp. 126–131 (2008)
Chartrand, R., Yin, W.: Iteratively reweighted algorithms for compressive sensing. In: 33rd International Conference on Acoustics, Speech, and Signal Processing, ICASSP (2008)
Donoho, D.L.: Compressed sensing. IEEE Trans. Inform. Theory 52, 1289–1306 (2006)
Dutot, P.-F., Eyraud, L., Mounié, G., Trystram, D.: Bi-criteria algorithm for scheduling jobs on cluster platforms. In: Proceedings of the Sixteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2004, New York, NY, USA, pp. 125–132 (2004)
Dutot, P.-F., Trystram, D.: Scheduling on hierarchical clusters using malleable tasks. In: SPAA 2001, pp. 199–208 (2001)
Dutot, P.-F., Netto, M.A.S., Goldman, A., Kon, F.: Scheduling Moldable BSP Tasks. In: Feitelson, D.G., Frachtenberg, E., Rudolph, L., Schwiegelshohn, U. (eds.) JSSPP 2005. LNCS, vol. 3834, pp. 157–172. Springer, Heidelberg (2005)
Feitelson, D.G.: Job scheduling in multiprogrammed parallel systems. Research Report RC 19790 (87657). IBM T. J. Watson Research Center (1997)
Feitelson, D.G., Mualem, A.W.: On the definition of “on-line” in job scheduling problems. Technical report, SIGACT News (2000)
Garey, M.R., Johnson, D.S.: Computers and Intractability; A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1990)
Goldstein, T., Osher, S.: The split bregman method for l1-regularized problems. SIAM J. Img. Sci. 2, 323–343 (2009)
Graham, R.L., et al.: Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann. Discrete Math., 287–326 (1979)
Lublin, U., Feitelson, D.G.: The workload on parallel supercomputers: Modeling the characteristics of rigid jobs. Journal of Parallel and Distributed Computing 63, 2003 (2001)
Nicod, J.-M., Philippe, L., Rehn-Sonigo, V., Toch, L.: Using virtualization and job folding for batch scheduling. In: ISPDC 2011, 10th Int. Symposium on Parallel and Distributed Computing, Cluj-Napoca, Romania, pp. 39–41. IEEE Computer Society Press (July 2011)
Turek, J., Wolf, J.L., Yu, P.S.: Approximate algorithms scheduling parallelizable tasks. In: Proceedings of the Fourth Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 1992, pp. 323–332. ACM, New York (1992)
Valiant, L.G.: A bridging model for parallel computation. Commun. ACM 33, 103–111 (1990)
Ye, D., Zhang, G.: On-line scheduling of parallel jobs in a list. J. of Scheduling 10, 407–413 (2007)
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
Chretien, S., Nicod, JM., Philippe, L., Rehn-Sonigo, V., Toch, L. (2012). Job Scheduling Using Successive Linear Programming Approximations of a Sparse Model. In: Kaklamanis, C., Papatheodorou, T., Spirakis, P.G. (eds) Euro-Par 2012 Parallel Processing. Euro-Par 2012. Lecture Notes in Computer Science, vol 7484. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32820-6_14
Download citation
DOI: https://doi.org/10.1007/978-3-642-32820-6_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-32819-0
Online ISBN: 978-3-642-32820-6
eBook Packages: Computer ScienceComputer Science (R0)