Abstract
We consider the problem of Scheduling parallel Jobs in heterogeneous Platforms: We are given a set \(\mathcal{J}=\{1,\ldots,n\}\) of n jobs, where a job \(j\in\mathcal{J}\) is described by a pair (p j ,q j ) of a processing time p j ∈ ℚ> 0 and the number of processors required q j ∈ ℕ. We are also given a set \(\mathcal{B}\) of N heterogeneous platforms P 1,…,P N , where each P i contains m i processors for i ∈ {1,…, N}. The objective is to find a schedule for the jobs in the platforms minimizing the makespan. Unless \(\mathcal{P}=\mathcal{NP}\) there is no approximation algorithm with absolute ratio strictly better than 2 for the problem. We give a (2 + ε)-approximation for the problem improving the previously best known approximation ratio.
Research supported by German Research Foundation (DFG) project JA612/12-2.
Chapter PDF
Similar content being viewed by others
Keywords
- Approximation Algorithm
- Free Layer
- Fractional Schedule
- Identical Platform
- Distribute Processing Symposium
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.
References
Amoura, A.K., Bampis, E., Kenyon, C., Manoussakis, Y.: Scheduling independent multiprocessor tasks. Algorithmica 32(2), 247–261 (2002)
Bansal, N., Han, X., Iwama, K., Sviridenko, M., Zhang, G.: Harmonic algorithm for 3-dimensional strip packing problem. In: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2007), pp. 1197–1206 (2007)
Bougeret, M., Dutot, P.F., Jansen, K., Otte, C., Trystram, D.: Approximating the non-contiguous multiple organization packing problem. In: Calude, C.S., Sassone, V. (eds.) TCS 2010. IFIP AICT, vol. 323, pp. 316–327. Springer, Heidelberg (2010)
Bougeret, M., Dutot, P.-F., Jansen, K., Otte, C., Trystram, D.: A fast 5/2-approximation algorithm for hierarchical scheduling. In: D’Ambra, P., Guarracino, M., Talia, D. (eds.) Euro-Par 2010, Part I. LNCS, vol. 6271, pp. 157–167. Springer, Heidelberg (2010)
Bougeret, M., Dutot, P.-F., Jansen, K., Robenek, C., Trystram, D.: Approximation algorithms for multiple strip packing and scheduling parallel jobs in platforms. Discrete Mathematics, Algorithms and Applications 3(4), 553–586 (2011)
Bougeret, M., Dutot, P.-F., Jansen, K., Robenek, C., Trystram, D.: Tight approximation for scheduling parallel jobs on identical clusters. In: IEEE International Parallel and Distributed Processing Symposium Workshops, pp. 878–885 (2012)
Du, J., Leung, J.Y.-T.: Complexity of scheduling parallel task systems. SIAM Journal of Discrete Mathematics 2(4), 473–487 (1989)
Dutot, P.-F., Jansen, K., Robenek, C., Trystram, D.: A (2 + ε)-approximation for scheduling parallel jobs in platforms. Department of Computer Science, University Kiel, Technical Report No. 1217 (2013)
Garey, M.R., Graham, R.L.: Bounds for multiprocessor scheduling with resource constraints. SIAM Journal on Computing 4(2), 187–200 (1975)
Jansen, K.: A (3/2 + ε) approximation algorithm for scheduling moldable and non-moldable parallel tasks. In: 24th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2012), pp. 224–235 (2012)
Jansen, K., Solis-Oba, R.: Rectangle packing with one-dimensional resource augmentation. Discrete Optimization 6(3), 310–323 (2009)
Jansen, K., Thöle, R.: Approximation algorithms for scheduling parallel jobs. SIAM Journal on Computing 39(8), 3571–3615 (2010)
Kenyon, C., Rémila, E.: A near-optimal solution to a two-dimensional cutting stock problem. Mathematics of Operations Research 25(4), 645–656 (2000)
Lee, C.C., Lee, D.T.: A simple on-line bin-packing algorithm. Journal of the ACM 32(3), 562–572 (1985)
Lenstra, J.K., Shmoys, D.B., Tardos, É.: Approximation algorithms for scheduling unrelated parallel machines. Mathematical Programming 46, 259–271 (1990)
Pascual, F., Rzadca, K., Trystram, D.: Cooperation in multi-organization scheduling. Journal of Concurrency and Computation: Practice and Experience 21, 905–921 (2009)
Quezada-Pina, A., Tchernykh, A., Gonzlez-Garca, J., Hirales-Carbajal, A., Miranda-Lpez, V., Ramrez-Alcaraz, J., Schwiegelshohn, U., Yahyapour, R.: Adaptive job scheduling on hierarchical Grids. Future Generation Computer Systems 28(7), 965–976 (2012)
Schwiegelshohn, U., Tchernykh, A., Yahyapour, R.: Online scheduling in grids. In: IEEE International Parallel and Distributed Processing Symposium (IPDPS 2008), pp. 1–10 (2008)
Seiden, S.S., van Stee, R.: New bounds for multidimensional packing. Algorithmica 36(3), 261–293 (2003)
Tchernykh, A., Ramírez, J., Avetisyan, A., Kuzjurin, N., Grushin, D., Zhuk, S.: Two level job-scheduling strategies for a computational grid. In: Wyrzykowski, R., Dongarra, J., Meyer, N., Waśniewski, J. (eds.) PPAM 2005. LNCS, vol. 3911, pp. 774–781. Springer, Heidelberg (2006)
Tchernykh, A., Schwiegelsohn, U., Yahyapour, R., Kuzjurin, N.: On-line Hierarchical Job Scheduling on Grids with Admissible Allocation. Journal of Scheduling 13(5), 545–552 (2010)
Ye, D., Han, X., Zhang, G.: On-line multiple-strip packing. In: Du, D.-Z., Hu, X., Pardalos, P.M. (eds.) COCOA 2009. LNCS, vol. 5573, pp. 155–165. Springer, Heidelberg (2009)
Zhuk, S.N.: Approximate algorithms to pack rectangles into several strips. Discrete Mathematics and Applications 16(1), 73–85 (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dutot, PF., Jansen, K., Robenek, C., Trystram, D. (2013). A (2 + ε)-Approximation for Scheduling Parallel Jobs in Platforms. In: Wolf, F., Mohr, B., an Mey, D. (eds) Euro-Par 2013 Parallel Processing. Euro-Par 2013. Lecture Notes in Computer Science, vol 8097. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40047-6_11
Download citation
DOI: https://doi.org/10.1007/978-3-642-40047-6_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-40046-9
Online ISBN: 978-3-642-40047-6
eBook Packages: Computer ScienceComputer Science (R0)