Approximation algorithms for scheduling monotonic moldable tasks on multiple platforms (original) (raw)
References
Blazewicz, J., Cheng, T. E., Machowiak, M., & Oguz, C. (2011). Berth and quay crane allocation: a moldable task scheduling model. Journal of the Operational Research Society,62(7), 1189–1197. Article Google Scholar
Bougeret, M., Dutot, P. F., Jansen, K., Otte, C., & Trystram, D. (2010a). Approximating the non-contiguous multiple organization packing problem. In: IFIP International Conference on Theoretical Computer Science, (pp. 316–327). Springer.
Bougeret, M., Dutot, P. -F., Jansen, K., Otte, C., & Trystram, D. (2010b). A fast 5/2-approximation algorithm for hierarchical scheduling. In: European Conference on Parallel Processing, (pp. 157–167). Springer.
Bougeret, M., Dutot, P.-F., Jansen, K., Robenek, C., & Trystram, D. (2011). Approximation algorithms for multiple strip packing and scheduling parallel jobs in platforms. Discrete Mathematics, Algorithms and Applications,3(04), 553–586. Article Google Scholar
Bougeret, M., Dutot, P. -F., Jansen, K., Robenek, C., & Trystram, D. (2012). Tight approximation for scheduling parallel jobs on identical clusters. In: 2012 IEEE 26th International Parallel and Distributed Processing Symposium Workshops & PhD Forum, (pp. 878–885). IEEE.
Bougeret, M., Dutot, P.-F., Trystram, D., Jansen, K., & Robenek, C. (2015). Improved approximation algorithms for scheduling parallel jobs on identical clusters. Theoretical Computer Science,600, 70–85. Article Google Scholar
Brent, R. P. (1974). The parallel evaluation of general arithmetic expressions. Journal of the ACM (JACM),21(2), 201–206. Article Google Scholar
Caprara, A., Kellerer, H., & Pferschy, U. (2000). The multiple subset sum problem. SIAM Journal on Optimization,11(2), 308–319. Article Google Scholar
Dolgui, A., Kovalev, S., Kovalyov, M. Y., Malyutin, S., & Soukhal, A. (2018). Optimal workforce assignment to operations of a paced assembly line. European Journal of Operational Research,264(1), 200–211. Article Google Scholar
Drozdowski, M. (2009). Scheduling for parallel processing (Vol. 18). Springer. Book Google Scholar
Du, J., & Leung, J.Y.-T. (1989). Complexity of scheduling parallel task systems. SIAM Journal on Discrete Mathematics,2(4), 473–487. Article Google Scholar
Dutot, P. -F., Jansen, K., Robenek, C., & Trystram, D. (2013). A (2+ \(\epsilon \))-approximation for scheduling parallel jobs in platforms. In: European Conference on Parallel Processing, (pp. 78–89). Springer.
Dutton, R. A., Mao, W., Chen, J., & Watson III, W. (2008). Parallel job scheduling with overhead: A benchmark study. In: 2008 International Conference on Networking, Architecture, and Storage, (pp. 326–333). IEEE.
Hochbaum, D. S., & Shmoys, D. B. (1987). Using dual approximation algorithms for scheduling problems theoretical and practical results. (vol. 34, pp. 144–162), New York, NY, USA. Association for Computing Machinery.
Jansen, K. (2004). Scheduling malleable parallel tasks: An asymptotic fully polynomial time approximation scheme. Algorithmica,PP(39), 187–200. Google Scholar
Jansen, K. (2012). A (3/2+\(\epsilon \)) approximation algorithm for scheduling moldable and non-moldable parallel tasks. In: Proceedings of the Twenty-Fourth Annual ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 12, (pp. 224–235), New York, NY, USA. Association for Computing Machinery.
Jansen, K., & Land, F. (2018). Scheduling monotone moldable jobs in linear time. In: 2018 IEEE International Parallel and Distributed Processing Symposium (IPDPS), (pp. 172–181).
Jansen, K., & Porkolab, L. (2002). Linear-time approximation schemes for scheduling malleable parallel tasks. Algorithmica,32(3), 507–520. Article Google Scholar
Jansen, K., & Rau, M. (2019a). Closing the gap for pseudo-polynomial strip packing. In: 27th Annual European Symposium on Algorithms (ESA 2019), vol. 144 of Leibniz International Proceedings in Informatics (LIPIcs), (pp. 62:1–62:14), Dagstuhl, Germany. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik.
Jansen, K., & Rau, M. (2019b). Linear time algorithms for multiple cluster scheduling and multiple strip packing. In: European Conference on Parallel Processing, (pp. 103–116). Springer.
Jansen, K., & Thöle, R. (2010). Approximation algorithms for scheduling parallel jobs. SIAM Journal on Computing,39(8), 3571–3615. Article Google Scholar
Jansen, K., & Trystram, D. (2016). Scheduling parallel jobs on heterogeneous platforms. Electronic Notes in Discrete Mathematics,55, 9–12. Article Google Scholar
Johannes, B. (2006). Scheduling parallel jobs to minimize the Makespan. Journal of Scheduling,9(5), 433–452. Article Google Scholar
Ludwig, W., & Tiwari, P. (1994). Scheduling malleable and nonmalleable parallel tasks. In: Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, (pp. 167–176). Society for Industrial and Applied Mathematics.
Mounié, G., Rapine, C., & Trystram, D. (1999). Efficient approximation algorithms for scheduling malleable tasks. In: Proceedings of the Eleventh Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA ’99, (pp. 23–32), New York, NY, USA. Association for Computing Machinery.
Mounié, G., Rapine, C., & Trystram, D. (2007). A \(\frac{3}{2}\)-approximation algorithm for scheduling independent monotonic malleable tasks. SIAM Journal on Computing,37(2), 401–412. Article Google Scholar
Pascual, F., Rzadca, K., & Trystram, D. (2009). Cooperation in multi-organization scheduling. Concurrency and Computation: Practice and Experience,21(7), 905–921. Article Google Scholar
Schwiegelshohn, U., Tchernykh, A., & Yahyapour, R. (2008). Online scheduling in grids. In: IEEE international symposium on parallel and distributed processing (IPDPS 2008), (pp. 1–10). IEEE.
Tchernykh, A., Ramírez, J. M., Avetisyan, A., Kuzjurin, N., Grushin, D., & Zhuk, S. (2005). Two level job-scheduling strategies for a computational grid. In: International Conference on Parallel Processing and Applied Mathematics, (pp. 774–781). Springer.
Turek, J., Wolf, J. L., & Yu, P. S. (1992). Approximate algorithms for scheduling parallelizable tasks. In: Proceedings of the Fourth Annual ACM Symposium on Parallel Algorithms and Architectures, (pp. 323–332).
Ye, D., Han, X., & Zhang, G. (2009). On-line multiple-strip packing. In: International Conference on Combinatorial Optimization and Applications, (pp. 155–165). Springer.
Zhuk, S. (2006). Approximate algorithms to pack rectangles into several strips. Discrete Mathematics and Applications,16(1), 73–85. Article Google Scholar