Banker's Algorithm Optimalization to Dynamically Avoid Deadlock in Operating System

Authors

  • Herlambang Rafli Wicaksono Politeknik Siber dan Sandi Negara
  • Herisa Pratama Nur Baeti Politeknik Siber dan Sandi Negara
  • Yasmin Putri Salma Politeknik Siber dan Sandi Negara
  • Aqwam Rosadi Kardian Sekolah Tinggi Manajemen Informatika dan Komputer Jakarta

DOI:

https://doi.org/10.26905/jeemecs.v6i1.8986

Keywords:

Operating Systems, Deadlock, Banker's Algorithm

Abstract

Operating systems hold the responsibility to ensure a computer works as it was intended, including that every resource in a computer is managed and used by any process needing them. Bad resource allocation can lead to a condition where the resources cannot be accessed because they are still used by a frozen process, known as deadlock. Deadlock avoidance in the operating system is usually done using a banker’s algorithm. The current algorithm still possesses limitations, including the need to determine the number of processes before starting the calculation. This paper proposes an optimized banker’s algorithm that can be intercepted in the middle of execution in case of a new process requests some resources so deadlock can be avoided dynamically.

References

J. Ezpeleta, F. Tricas, F. García-Vallés, and J. M. Colom, †A Banker’s Solution for Deadlock Avoidance in FMS With Flexible Routing and Multiresource States,†Ieee Transactions on Robotics And Automation, vol 18, August 2002.

Ms. Kshipra Dixit and Dr. Ajay Khuteta, “A Dynamic and Improved Implementation of Banker’s Algorithm,†International Journal on Recent and Innovation Trends in Computing and Communication, vol.5, pp. 45-49, Agustus 2017.

Yang Wang and Paul Lu, “Maximizing Active Storage Resources with Deadlock Avoidance in Workflow-Based Computations,†IEEE Transactions on Computers, Vol. 62 No. 11, November 2013.

M. Begum, O. Faruque, M. W. Rahman Miah and B. Chandra Das, "An Improved Safety Detection Algorithm Towards Deadlock Avoidance," 2020 IEEE 10th Symposium on Computer Applications & Industrial Electronics (ISCAIE), , pp. 73-78, 2020, doi:10.1109/ISCAIE47305.2020.9108818.

Markus Bangun, “Simulasi Algoritma Banker pada Sistem Antrian,†Jurnal Mahajana Informasi, Vol.2 No 2, 2017.

V. Bobanac and S. Bogdan, "Routing and scheduling in Multi-AGV systems based on dynamic banker algorithm," 2008 16th Mediterranean Conference on Control and Automation, pp. 1168-1173, 2008, doi: 10.1109/MED.2008.4602057.

M. Žarnay and F. T. García, "Enhancing banker's algorithm for avoiding deadlocks in systems with nonsequential processes," Proceedings of the 2014 IEEE Emerging Technology and Factory Automation (ETFA), pp. 1-8, 2014, doi: 10.1109/ETFA.2014.7005149.

Li Jiang, “Process Security Sequence Improvement Algorithm Based on Banker Algorithm,†IOP Conf. Series: Journal of Physics: Conf. Series 1237, 2019.

D. Song, Y. Li and T. Song, "Modified Banker's algorithm with dynamically release resources," 2021 International Conference on Communications, Information System and Computer Engineering (CISCE), pp. 566-569, 2021, doi: 10.1109/CISCE52179.2021.9445935.

K. T. S. Kasthuriarachchi and U. U. S. K. Rajapaksha, "Design of auxiliary simulator for analysing the deadlock occurrence using Banker's algorithm," 2015 Fifteenth International Conference on Advances in

ICT for Emerging Regions (ICTer), pp. 265-265, 2015, doi:10.1109/ICTER.2015.7377698

Downloads

Published

2023-02-27