Differentiable combinatorial scheduling at scale
Article No.: 1271, Pages 31464 - 31476
Abstract
This paper addresses the complex issue of resource-constrained scheduling, an NP-hard problem that spans critical areas including chip design and high-performance computing. Traditional scheduling methods often stumble over scalability and applicability challenges. We propose a novel approach using a differentiable combinatorial scheduling framework, utilizing Gumbel-Softmax differentiable sampling technique. This new technical allows for a fully differentiable formulation of linear programming (LP) based scheduling, extending its application to a broader range of LP formulations. To encode inequality constraints for scheduling tasks, we introduce constrained Gumbel Trick, which adeptly encodes arbitrary inequality constraints. Consequently, our method facilitates an efficient and scalable scheduling via gradient descent without the need for training data. Comparative evaluations on both synthetic and real-world benchmarks highlight our capability to significantly improve the optimization efficiency of scheduling, surpassing state-of-the-art solutions offered by commercial and open-source solvers such as CPLEX, Gurobi, and CP-SAT in the majority of the designs.
References
[1]
Ahn, B. H., Lee, J., Lin, J. M., Cheng, H.-P., Hou, J., and Esmaeilzadeh, H. Ordering chaos: Memory-aware scheduling of irregularly wired neural networks for edge devices. Proceedings of Machine Learning and Systems, 2:44-57, 2020.
[2]
Amarú, L., Gaillardon, P.-E., and De Micheli, G. The epfl combinational benchmark suite. In Proceedings of the 24th International Workshop on Logic & Synthesis (IWLS), number CONF, 2015.
[3]
Babu, A., Wang, C., Tjandra, A., Lakhotia, K., Xu, Q., Goyal, N., Singh, K., von Platen, P., Saraf, Y., Pino, J., et al. Xls-r: Self-supervised cross-lingual speech representation learning at scale. arXiv preprint arXiv:2111.09296, 2021.
[4]
Baevski, A., Schneider, S., and Auli, M. vq-wav2vec: Self-supervised learning of discrete speech representations. arXiv preprint arXiv:1910.05453, 2019.
[5]
Baltean-Lugojan, R., Misener, R., Bonami, P., and Tramontani, A. Strong sparse cut selection via trained neural nets for quadratic semidefinite outer-approximations. Imperial College, London, Tech. Rep, 2018.
[6]
Baptiste, P., Le Pape, C., and Nuijten, W. Constraint-based scheduling: applying constraint programming to scheduling problems, volume 39. Springer Science & Business Media, 2001.
[7]
Bartan, B., Li, H., Teague, H., Lott, C., and Dilkina, B. Moccasin: Efficient tensor rematerialization for neural networks, 2023.
[8]
Bengio, Y., Lodi, A., and Prouvost, A. Machine learning for combinatorial optimization: a methodological tour d'horizon. European Journal of Operational Research, 290(2):405-421, 2021.
[9]
Blum, C. and Roli, A. Metaheuristics in combinatorial optimization: Overview and conceptual comparison. ACM computing surveys (CSUR), 35(3):268-308, 2003.
[10]
Booth, K. E., Nejat, G., and Beck, J. C. A constraint programming approach to multi-robot task allocation and scheduling in retirement homes. In Principles and Practice of Constraint Programming: 22nd International Conference, CP 2016, Toulouse, France, September 5-9, 2016, Proceedings 22, pp. 539-555. Springer, 2016a.
[11]
Booth, K. E., Tran, T. T., Nejat, G., and Beck, J. C. Mixed-integer and constraint programming techniques for mobile robot task planning. IEEE Robotics and Automation Letters, 1(1):500-507, 2016b.
[12]
Brucker, P., Knust, S., Schoo, A., and Thiele, O. A branch and bound algorithm for the resource-constrained project scheduling problem. European journal of operational research, 107(2):272-288, 1998.
[13]
Camion, P. Characterization of totally unimodular matrices. Proceedings of the American Mathematical Society, 16 (5):1068-1073, 1965.
[14]
Cappart, Q. and Schaus, P. Rescheduling railway traffic on real time situations using time-interval variables. In Integration of AI and OR Techniques in Constraint Programming: 14th International Conference, CPAIOR 2017, Padua, Italy, June 5-8, 2017, Proceedings 14, pp. 312-327. Springer, 2017.
[15]
Cesta, A., Oddi, A., and Smith, S. F. A constraint-based method for project scheduling with time windows. Journal of Heuristics, 8:109-136, 2002.
[16]
Chen, H. and Shen, M. A deep-reinforcement-learning-based scheduler for fpga hls. In 2019 IEEE/ACM International Conference on Computer-Aided Design (ICCAD), pp. 1-8, 2019.
[17]
Christofides, N., Alvarez-Valdés, R., and Tamarit, J. M. Project scheduling with resource constraints: A branch and bound approach. European journal of operational research, 29(3):262-273, 1987.
[18]
Coelho, J. and Vanhoucke, M. Multi-mode resource-constrained project scheduling using rcpsp and sat solvers. European Journal of Operational Research, 213(1):73-82, 2011.
[19]
Cong, J. and Zhang, Z. An efficient and versatile scheduling algorithm based on sdc formulation. In Proceedings of the 43rd annual Design Automation Conference, pp. 433-438, 2006.
[20]
Cong, J., Liu, B., Neuendorffer, S., Noguera, J., Vissers, K., and Zhang, Z. High-level synthesis for fpgas: From prototyping to deployment. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 30(4): 473-491, 2011.
[21]
Dai, S., Liu, G., and Zhang, Z. A scalable approach to exact resource-constrained scheduling based on a joint sdc and sat formulation. In Proceedings of the 2018 ACM/SIGDA International Symposium on Field-Programmable Gate Arrays, pp. 137-146, 2018.
[22]
Davis, R. I. and Burns, A. A survey of hard real-time scheduling for multiprocessor systems. ACM computing surveys (CSUR), 43(4):1-44, 2011.
[23]
Dhall, S. K. and Liu, C. L. On a real-time scheduling problem. Operations research, 26(1):127-140, 1978.
[24]
Floudas, C. A. and Lin, X. Mixed integer linear programming in process scheduling: Modeling, algorithms, and applications. Annals of Operations Research, 139:131-162, 2005.
[25]
Fu, Y., Zhang, Y., Li, C., Yu, Z., and Lin, Y. A3c-s: Automated agent accelerator co-search towards efficient deep reinforcement learning. In 2021 58th ACM/IEEE Design Automation Conference (DAC), pp. 13-18. IEEE, 2021a.
[26]
Fu, Y., Zhang, Y., Zhang, Y., Cox, D., and Lin, Y. Auto-nba: Efficient and effective search over the joint space of networks, bitwidths, and accelerators. In International Conference on Machine Learning, pp. 3505-3517. PMLR, 2021b.
[27]
Gagrani, M., Rainone, C., Yang, Y., Teague, H., Jeon, W., Hoof, H. V., Zeng, W. W., Zappi, P., Lott, C., and Bondesan, R. Neural topological ordering for computation graphs, 2022.
[28]
Gasse, M., Chételat, D., Ferroni, N., Charlin, L., and Lodi, A. Exact combinatorial optimization with graph convolutional neural networks. Advances in neural information processing systems, 32, 2019.
[29]
Gedik, R., Kirac, E., Milburn, A. B., and Rainwater, C. A constraint programming approach for the team orienteering problem with time windows. Computers & Industrial Engineering, 107:178-195, 2017.
[30]
Graham, R. L. Bounds on multiprocessing timing anomalies. SIAM journal on Applied Mathematics, 17(2):416-429, 1969.
[31]
Gumbel, E. J. Statistical theory of extreme values and some practical applications: a series of lectures, volume 33. US Government Printing Office, 1954.
[32]
Gurobi Optimization, LLC. Gurobi Optimizer Reference Manual, 2023. URL https://www.gurobi.com.
[33]
Hartmann, S. and Briskorn, D. An updated survey of variants and extensions of the resource-constrained project scheduling problem. European Journal of operational research, 297(1):1-14, 2022.
[34]
He, C., Ye, H., Shen, L., and Zhang, T. Milenas: Efficient neural architecture search via mixed-level reformulation. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, pp. 11993-12002, 2020.
[35]
Hwang, C.-T., Lee, J.-H., and Hsu, Y.-C. A formal approach to the scheduling problem in high level synthesis. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 10(4):464-475, 1991.
[36]
IBM, I. I. Ibm(r) ilog(r) cplex(r) interactive optimizer 22.1.1.0. 2023.
[37]
Jang, E., Gu, S., and Poole, B. Categorical reparameterization with gumbel-softmax. arXiv preprint arXiv:1611.01144, 2016.
[38]
Jouppi, N. P., Young, C., Patil, N., Patterson, D., Agrawal, G., Bajwa, R., Bates, S., Bhatia, S., Boden, N., Borchers, A., et al. In-datacenter performance analysis of a tensor processing unit. In Proceedings of the 44th annual international symposium on computer architecture, pp. 1-12, 2017.
[39]
Karapetyan, D., Punnen, A. P., and Parkes, A. J. Markov chain methods for the bipartite boolean quadratic programming problem. European Journal of Operational Research, 260(2):494-506, 2017.
[40]
Kathail, V. Xilinx vitis unified software platform. In Proceedings of the 2020 ACM/SIGDA International Symposium on Field-Programmable Gate Arrays, pp. 173-174, 2020.
[41]
Kinable, J., van Hoeve, W.-J., and Smith, S. F. Optimization models for a real-world snow plow routing problem. In Integration of AI and OR Techniques in Constraint Programming: 13th International Conference, CPAIOR 2016, Banff, AB, Canada, May 29-June 1, 2016, Proceedings 13, pp. 229-245. Springer, 2016.
[42]
Kolisch, R. and Sprecher, A. Psplib-a project scheduling problem library: Or software-orsep operations research software exchange program. European journal of operational research, 96(1):205-216, 1997.
[43]
Laborie, P., Rogerie, J., Shaw, P., and Vilím, P. Ibm ilog cp optimizer for scheduling: 20+ years of scheduling with constraints at ibm/ilog. Constraints, 23:210-250, 2018.
[44]
Maddison, C. J., Mnih, A., and Teh, Y. W. The concrete distribution: A continuous relaxation of discrete random variables. arXiv preprint arXiv:1611.00712, 2016.
[45]
Mascia, F., López-Ibáñez, M., Dubois-Lacoste, J., and Stützle, T. Grammar-based generation of stochastic local search heuristics through automatic algorithm configuration tools. Computers & operations research, 51: 190-199, 2014.
[46]
Neto, W. L., Li, Y., Gaillardon, P.-E., and Yu, C. End-to-end automatic logic optimization exploration via domain-specific multi-armed bandit. arXiv preprint arXiv:2202.07721, 2022.
[47]
Paulin, P. G. and Knight, J. P. Force-directed scheduling for the behavioral synthesis of asics. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 8(6):661-679, 1989.
[48]
Perron, L. and Didier, F. Cp-sat. URL https://developers.google.com/optimization/cp/cp_solver/.
[49]
Perron, L., Didier, F., and Gay, S. The cp-sat-lp solver. In Yap, R. H. C. (ed.), 29th International Conference on Principles and Practice of Constraint Programming (CP 2023), volume 280 of Leibniz International Proceedings in Informatics (LIPIcs), pp. 3:1-3:2, Dagstuhl, Germany, 2023. Schloss Dagstuhl - Leibniz-Zentrum für Informatik. ISBN 978-3-95977-300-3. URL https://drops.dagstuhl.de/opus/volltexte/2023/19040.
[50]
Reagen, B., Adolf, R., Shao, Y. S., Wei, G.-Y., and Brooks, D. Machsuite: Benchmarks for accelerator design and customized architectures. In 2014 IEEE International Symposium on Workload Characterization (IISWC), pp. 110-119. IEEE, 2014.
[51]
Sanders, J. and Kandrot, E. CUDA by example: an introduction to general-purpose GPU programming. Addison-Wesley Professional, 2010.
[52]
Schmitt, M. and Stuetz, P. Perception-oriented cooperation for multiple uavs in a perception management framework: System concept and first results. In 2016 IEEE/AIAA 35th Digital Avionics Systems Conference (DASC), pp. 1-10. IEEE, 2016.
[53]
Steiner, B., Elhoushi, M., Kahn, J., and Hegarty, J. Olla: Decreasing the memory usage of neural networks by optimizing the lifetime and location of arrays. arXiv preprint arXiv:2210.12924, 2022.
[54]
Steiner, W. An evaluation of smt-based schedule synthesis for time-triggered multi-hop networks. In 2010 31st IEEE Real-Time Systems Symposium, pp. 375-384. IEEE, 2010.
[55]
Tran, T. T., Vaquero, T., Nejat, G., and Beck, J. C. Robots in retirement homes: Applying off-the-shelf planning and scheduling to a team of assistive robots. Journal of Artificial Intelligence Research, 58:523-590, 2017.
[56]
Van Laarhoven, P. J., Aarts, E. H., and Lenstra, J. K. Job shop scheduling by simulated annealing. Operations research, 40(1):113-125, 1992.
[57]
Wall, M. B. A genetic algorithm for resource-constrained scheduling. PhD thesis, Massachusetts Institute of Technology, 1996.
[58]
Wang, R., Shen, L., Chen, Y., Yang, X., and Yan, J. Towards one-shot neural combinatorial solvers: Theoretical and empirical notes on the cardinality-constrained case. In ICLR, 2023.
[59]
Wang, X., Gao, L., Zhang, C., and Shao, X. A multi-objective genetic algorithm based on immune and entropy principle for flexible job-shop scheduling problem. The International Journal of Advanced Manufacturing Technology, 51:757-767, 2010.
[60]
Wu, B., Wang, Y., Zhang, P., Tian, Y., Vajda, P., and Keutzer, K. Mixed precision quantization of convnets via differentiable neural architecture search. arXiv preprint arXiv:1812.00090, 2018.
[61]
Wu, B., Dai, X., Zhang, P., Wang, Y., Sun, F., Wu, Y., Tian, Y., Vajda, P., Jia, Y., and Keutzer, K. Fbnet: Hardwareaware efficient convnet design via differentiable neural architecture search. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, pp. 10734-10742, 2019.
[62]
Wu, N., Li, Y., Hao, C., Dai, S., Yu, C., and Xie, Y. Gamora: Graph learning based symbolic reasoning for large-scale boolean networks. Design Automation Conference (DAC'23), 2023.
[63]
Xu, X., Shah, N., Evans, A., Sinha, S., Cline, B., and Yeric, G. Standard cell library design and optimization methodology for asap7 pdk. In 2017 IEEE/ACM International Conference on Computer-Aided Design (ICCAD), pp. 999-1004. IEEE, 2017.
[64]
Yin, J. and Yu, C. Accelerating exact combinatorial optimization via rl-based initialization - a case study in scheduling, 2023.
[65]
Yin, J., Zhang, Z., and Yu, C. Exact memory-and communication-aware scheduling of dnns on pipelined edge tpus. In 2022 IEEE/ACM 7th Symposium on Edge Computing (SEC), pp. 203-215. IEEE, 2022.
[66]
Yin, J., Li, Y., Robinson, D., and Yu, C. Respect: Reinforcement learning based edge scheduling on pipelined coral edge tpus. arXiv preprint arXiv:2304.04716, 2023.
[67]
Yu, C. Flowtune: Practical multi-armed bandits in boolean optimization. In Proceedings of the 39th International Conference on Computer-Aided Design, pp. 1-9, 2020.
[68]
Yu, C. and Zhang, Z. Painting on placement: Forecasting routing congestion using conditional generative adversarial nets. In Proceedings of the 56th Annual Design Automation Conference 2019, pp. 1-6, 2019.
[69]
Yu, C., Xiao, H., and De Micheli, G. Developing synthesis flows without human knowledge. In Proceedings of the 55th Annual Design Automation Conference, pp. 1-6, 2018.
[70]
Zhang, H., Li, D., and Shen, H. A sat based scheduler for tournament schedules. In SAT, 2004.
[71]
Zhang, Y., Ren, H., Sridharan, A., and Khailany, B. Gatspi: Gpu accelerated gate-level simulation for power improvement. In Proceedings of the 59th ACM/IEEE Design Automation Conference, pp. 1231-1236, 2022.
[72]
Zhou, Y., Gupta, U., Dai, S., Zhao, R., Srivastava, N., Jin, H., Featherston, J., Lai, Y.-H., Liu, G., Velasquez, G. A., et al. Rosetta: A realistic high-level synthesis benchmark suite for software programmable fpgas. In Proceedings of the 2018 ACM/SIGDA International Symposium on Field-Programmable Gate Arrays, pp. 269-278, 2018.
Index Terms
- Differentiable combinatorial scheduling at scale
Index terms have been assigned to the content through auto-classification.
Recommendations
Differentiable McCormick relaxations
McCormick's classical relaxation technique constructs closed-form convex and concave relaxations of compositions of simple intrinsic functions. These relaxations have several properties which make them useful for lower bounding problems in global ...
Quadratic Combinatorial Optimization Using Separable Underestimators
Binary programs with a quadratic objective function are NP-hard in general, even if the linear optimization problem over the same feasible set is tractable. In this paper, we address such problems by computing quadratic global underestimators of the ...
A Sequential Quadratically Constrained Quadratic Programming Method for Differentiable Convex Minimization
This paper presents a sequential quadratically constrained quadratic programming (SQCQP) method for solving smooth convex programs. The SQCQP method solves at each iteration a subproblem that involves convex quadratic inequality constraints as well as a ...
Comments
Information & Contributors
Information
Published In
July 2024
63010 pages
Copyright © 2024.
Publisher
JMLR.org
Publication History
Published: 21 July 2024
Qualifiers
- Research-article
- Research
- Refereed limited
Acceptance Rates
Overall Acceptance Rate 140 of 548 submissions, 26%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 02 Feb 2025