DOI QR코드

DOI QR Code

A Parallel Genetic Algorithm for Solving Deadlock Problem within Multi-Unit Resources Systems

  • Ahmed, Rabie (Department of Computer Science, Faculty of Computing and Information Technology, Northern Border University) ;
  • Saidani, Taoufik (Department of Computer Science, Faculty of Computing and Information Technology, Northern Border University) ;
  • Rababa, Malek (Department of Computer Science, Faculty of Computing and Information Technology, Northern Border University)
  • Received : 2021.12.05
  • Published : 2021.12.30

Abstract

Deadlock is a situation in which two or more processes competing for resources are waiting for the others to finish, and neither ever does. There are two different forms of systems, multi-unit and single-unit resource systems. The difference is the number of instances (or units) of each type of resource. Deadlock problem can be modeled as a constrained combinatorial problem that seeks to find a possible scheduling for the processes through which the system can avoid entering a deadlock state. To solve deadlock problem, several algorithms and techniques have been introduced, but the use of metaheuristics is one of the powerful methods to solve it. Genetic algorithms have been effective in solving many optimization issues, including deadlock Problem. In this paper, an improved parallel framework of the genetic algorithm is introduced and adapted effectively and efficiently to deadlock problem. The proposed modified method is implemented in java and tested on a specific dataset. The experiment shows that proposed approach can produce optimal solutions in terms of burst time and the number of feasible solutions in each advanced generation. Further, the proposed approach enables all types of crossovers to work with high performance.

Keywords

Acknowledgement

The authors wish to acknowledge the approval and the support of this research study by the grant No. 7-14-1436-5 from the Deanship of Scientific Research in Northern Border University, Arar, KSA.

References

  1. Silberschatz, Abraham, "Operating System Principles", (7 ed.). Wiley-India. p. 237, 2006.
  2. Padua, David, "Encyclopedia of Parallel Computing", Springer. p. 524, 2011.
  3. Shibu, "Intro To Embedded System", (1st ed.). McGraw Hill Education. p. 446, 2009.
  4. Stuart, Brian L, "Principles of operating systems", (1st ed.). Cengage Learning. p. 446, 2008.
  5. E. W. Dijkstra, "Cooperating sequential processes", Technical Report EWD-123, Technological University, Eindhoven, The Netherlands, 1965.
  6. A. N. Haberman, "Prevention of system deadlocks", Communication of the ACM, Vol. 12, No. 7, July 1969, pp. 373-385. https://doi.org/10.1145/363156.363160
  7. Shoshani and E. Coffman, "Prevention, detection and recover from deadlock in multiprocess, multiple resource systems", Technical Report 80, Princeton University, 1969.
  8. Belik F. "An efficient deadlock avoidance technique", IEEE Transactions on Computers. 1990 Jul;39(7):882-8. https://doi.org/10.1109/12.55690
  9. Yao, B., Yin, J., & Wu, W. , "Deadlock Avoidance Based on Graph Theory", International Journal of u-and e-Service, Science and Technology, 9(2), 353-362, 2016.
  10. Chen, M.; "Policy based reinforcement learning approach Of Job shop scheduling with high level deadlock detection"; MSc. Thesis; Iowa State University; Ames, Iowa; 2013.
  11. Choi, J. Y.; "Design and comparative performance analysis of a heuristic-based parameterised Banker's algorithm using the CRL scheduling problems"; International Journal of Production Research; Vol. 53, No. 9, 2605-2616, http://dx.doi.org/10.1080/00207543.2014.970710; 2015.
  12. Luo, J. C.; and Et al.; "Scheduling of deadlock and failure-prone automated manufacturing systems via hybrid heuristic search"; International Journal of Production Research; http://dx.doi.org/10.1080/00207543.2017.1306132; 2017.
  13. Chen, M.; and Rabelo, L.; "Deadlock-Detection via Reinforcement Learning"; Ind Eng Manage; Vol.6: 215. doi:10.4172/2169-0316.1000215; 2017.
  14. Wu, Y.; and Et al.; "Robust deadlock control for automated manufacturing systems with a single type of unreliable resources"; Advances in Mechanical Engineering; Vol. 10(5) 1-14; DOI: 10.1177/1687814018772411; 2018.
  15. Ahmed, Nada Thanoon, and Narjis Mezaal Shati. "A New Method for Solving Deadlock Using Genetic Algorithms." International Journal of Advanced Research in Engineering and Technology 10.1, 2019.
  16. Smith, J., & Vavak, F. , " Replacement strategies in steady state genetic algorithms: Static environments. Foundations of genetic algorithms", 5, 219-233, 1999.
  17. Poli, R., & Langdon, W. B., "On the search properties of different crossover operators in genetic programming. Genetic Programming", 293-301, 1998.
  18. De Falco, I., Della Cioppa, A., & Tarantino, E., "Mutation-based genetic algorithm: performance evaluation", Applied Soft Computing, 1(4), 285-299, 2002. https://doi.org/10.1016/S1568-4946(02)00021-2