skip to main content
10.1145/3631309.3632836acmotherconferencesArticle/Chapter ViewAbstractPublication PagesmiddlewareConference Proceedingsconference-collections
research-article

Benchmarks for Job Scheduling in Ultra-Distributed Systems

Published: 11 December 2023 Publication History

Abstract

As the number of edge devices rapidly multiplies into the millions in the post-5G era, there is a simultaneous surge in demand for job execution driven by the data generated by these devices. Ultra-distributed computing systems have emerged to support this notable proliferation of interconnected devices and in addressing the unprecedented data generated over low-latency networks. To ensure the high availability and reliability of these systems, an efficient job scheduling method is required to schedule jobs across available resources. However, there are currently no large-scale benchmarks available to evaluate job scheduling methods. This paper introduces large-scale benchmarks of up to one million devices for job shop scheduling problems. We evaluate the makespan reduction of widely used combinatorial optimizations on these benchmarks, including simulated annealing, ant colony, tree Parzen search, particle swarm, artificial bee colony, cuckoo search, whale, grey wolf, firefly, and bat optimizations. We investigate the impact of execution time on finding the optimal makespan of job shop scheduling for each method. The experimental results can be used to guide the selection of a job scheduling method for particular applications.

References

[1]
Joseph Adams, Egon Balas, and Daniel Zawack. 1988. The Shifting Bottleneck Procedure for Job Shop Scheduling. Management Science 34, 3 (1988), 391--401.
[2]
Bahriye Akay and Dervis Karaboga. 2012. Artificial bee colony algorithm for large-scale problems and engineering design optimization. J. Intell. Manuf. 23, 4 (2012), 1001--1014.
[3]
Belal Ali Al-Maytami, Pingzhi Fan, Abir Hussain, Thar Baker, and Panos Liatsis. 2019. A Task Scheduling Algorithm With Improved Makespan Based on Prediction of Tasks Computation Time algorithm for Cloud Computing. IEEE Access 7 (2019), 160916--160926.
[4]
David Lee Applegate and William John Cook. 1991. A Computational Study of the Job-Shop Scheduling Problem. ORSA Journal on Computing 3, 2 (May 1991), 149--156. the JSSP instances used were generated in Bonn in 1986.
[5]
Giacomo Da Col and Erich Teppan. 2021. Large-Scale Benchmarks for the Job Shop Scheduling Problem. CoRR abs/2102.08778 (2021), 1--10. arXiv:2102.08778
[6]
Susumu Date, Yoshiyuki Kido, Yuki Katsuura, Yuki Teramae, and Shinichiro Kigoshi. 2023. Supercomputer for Quest to Unsolved Interdisciplinary Data-science (SQUID) and its Five Challenges. In Sustained Simulation Performance 2021, Michael M. Resch, Johannes Gebert, Hiroaki Kobayashi, and Wolfgang Bez (Eds.). Springer International Publishing, Cham, 1--19.
[7]
Ebru Demirkol, Sanjay Mehta, and Reha Uzsoy. 1998. Benchmarks for shop scheduling problems. European Journal of Operational Research 109, 1 (August 1998), 137--141.
[8]
Richard A. Dutton, Weizhen Mao, Jie Chen, and William Watson. 2008. Parallel Job Scheduling with Overhead: A Benchmark Study. In 2008 International Conference on Networking, Architecture, and Storage. IEEE, Chongqing, China, 326--333.
[9]
M. R. Garey, D. S. Johnson, and Ravi Sethi. 1976. The Complexity of Flowshop and Jobshop Scheduling. Mathematics of Operations Research 1, 2 (may 1976), 117--129.
[10]
G.L. Thompson. J.F. Muth. 1966. Industrial Scheduling. Recherches Économiques de Louvain/Louvain Economic Review 32, 2 (1966), 121--122.
[11]
James Kennedy and Russell C. Eberhart. 1995. Particle swarm optimization. In Proceedings of the IEEE International Conference on Neural Networks. IEEE, Perth, WA, Australia, 1942--1948.
[12]
S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi. 1983. Optimization by Simulated Annealing. Science 220, 4598 (1983), 671--680.
[13]
Stephen R. Lawrence. 1984. Resource Constrained Project Scheduling: An Experimental Investigation of Heuristic Scheduling Techniques (Supplement). Ph.D. Dissertation. Graduate School of Industrial Administration (GSIA), Carnegie-Mellon University, Pittsburgh, PA, USA.
[14]
Dumitrel Loghin, Shaofeng Cai, Gang Chen, Tien Tuan Anh Dinh, Feiyi Fan, Qian Lin, Janice Ng, Beng Chin Ooi, Xutao Sun, Quang-Trung Ta, Wei Wang, Xiaokui Xiao, Yang Yang, Meihui Zhang, and Zhonghua Zhang. 2020. The Disruptions of 5G on Data-Driven Technologies and Applications. IEEE Transactions on Knowledge and Data Engineering 32, 6 (2020), 1179--1198.
[15]
Daniel Merkle and Martin Middendorf. 2006. Marco Dorigo and Thomas Stützle, Ant Colony Optimization, MIT Press (2004) ISBN 0-262-04219-3. Eur. J. Oper. Res. 168, 1 (2006), 269--271.
[16]
Seyedali Mirjalili and Andrew Lewis. 2016. The Whale Optimization Algorithm. Advances in Engineering Software 95 (2016), 51--67.
[17]
Seyedali Mirjalili, Seyed Mohammad Mirjalili, and Andrew Lewis. 2014. Grey Wolf Optimizer. Advances in Engineering Software 69 (2014), 46--61.
[18]
Jatoth Mohan, Krishnanand Lanka, and A. Neelakanteswara Rao. 2019. A Review of Dynamic Job Shop Scheduling Techniques. Procedia Manufacturing 30 (2019), 34--39. Digital Manufacturing Transforming Industry Towards Sustainable Growth.
[19]
Yoshihiko Ozaki, Yuki Tanigaki, Shuhei Watanabe, and Masaki Onishi. 2020. Multiobjective Tree-Structured Parzen Estimator for Computationally Expensive Optimization Problems. In Proceedings of the 2020 Genetic and Evolutionary Computation Conference (Cancún, Mexico) (GECCO '20). Association for Computing Machinery, New York, NY, USA, 533--541.
[20]
Robert H. Storer, S. David Wu, and Renzo Vaccari. 1992. New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling. Journal of Management Sciences 38, 10 (1992), 1495--1509.
[21]
Éric D. Taillard. 1993. Benchmarks for Basic Scheduling Problems. European Journal of Operational Research 64, 2 (Jan. 1993), 278--285.
[22]
Pei Wei Tsai, Jeng Shyang Pan, Bin Yih Liao, Ming Jer Tsai, and Vaci Istanda. 2012. Bat Algorithm Inspired Algorithm for Solving Numerical Optimization Problems. Mechanical Engineering, Materials and Energy 148 (3 2012), 134--137.
[23]
Takeshi Yamada and Ryohei Nakano. 1992. A Genetic Algorithm Applicable to Large-Scale Job-Shop Instances. In Proceedings of Parallel Problem Solving from Nature 2 (PPSN II), Reinhard Männer and Bernard Manderick (Eds.). Elsevier, Amsterdam, The Netherlands, 281--290.
[24]
Xin-She Yang. 2009. Firefly Algorithms for Multimodal Optimization. In SAGA (Lecture Notes in Computer Science, Vol. 5792), Osamu Watanabe and Thomas Zeugmann (Eds.). Springer, Berlin, Germany, 169--178.
[25]
Xin-She Yang. 2012. Cuckoo search for inverse problems and simulated-driven shape optimization. J. Comput. Methods Sci. Eng. 12, 1--2 (2012), 129--137.

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences
Mid4CC '23: Proceedings of the 1st International Workshop on Middleware for the Computing Continuum
December 2023
39 pages
ISBN:9798400704574
DOI:10.1145/3631309
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

In-Cooperation

  • IFIP
  • Usenix

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 11 December 2023

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. combinatorial optimization
  2. distributed computing
  3. heterogeneous environments
  4. job shop problem
  5. large-scale benchmarks
  6. resource scheduling

Qualifiers

  • Research-article

Funding Sources

  • Research and Development Project of the Enhanced Infrastructures for Post-5G Information and Communication Systems (JPNP20017), commissioned by the New Energy and Industrial Technology Development Organization (NEDO)

Conference

Mid4CC '23

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • 0
    Total Citations
  • 93
    Total Downloads
  • Downloads (Last 12 months)63
  • Downloads (Last 6 weeks)5
Reflects downloads up to 14 Feb 2025

Other Metrics

Citations

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media