Upgraded Deadlock Averting Algorithms in Distributed Systems

Authors

  • Abdullah Jan Northern University Nowshera, Peshawar, Pakistan
  • Syed Atif Ali Shah Northern University Nowshera, Peshawar, Pakistan
  • Zafar Khan Northern University Nowshera, Peshawar, Pakistan
  • Sakin Jan Abasyn University Peshawar, Peshawar, Pakistan
  • Adnan Haroon Abasyn University Peshawar, Peshawar, Pakistan
  • Imad Khan Abasyn University Peshawar, Peshawar, Pakistan
  • HabiburRahman Tariq Abasyn University Peshawar, Peshawar, Pakistan

Keywords:

Deadlock averting, Distributed Systems Deadlock averting, Distributed Systems, Deadlock averting Algorithms.

Abstract

Distributed system deadlock is like ordinary deadlock but it is difficult to prevent or detect when it is traced down. In the distributed system all, the related information is distributed over many machines. However, deadlock in distributed systems is tremendously serious. Therefore, it is important to understand how this deadlock is different from the ordinary deadlock and how to prevent it. To prevent deadlock in the distributed system there are two techniques to prevent it one wound-wait and other is wait-die. Therefore, the problem in these algorithms are that they just attend to the timestamp of the process but not the priority of them but in the real operating system priority of the process is very important. In this paper, we present upgraded deadlock averting algorithms and these algorithms are deal with both priority and time stamp of processes.

References

A. S. T. Maarten van Steen, “Distributed Systems,” pp. 1–596, 2017.

Hardik Pandya, “Distributed Systems | Characteristics | Advantages | Disadvantages. | I’M FROSTY,” Hardik Pandya, 2018. [Online]. Available: http://www.imfrosty.com/2014/11/distributed-system.html. [Accessed: 27-Sep-2018].

Chanaka Fernando, “The Evolution of Distributed Systems - DZone Cloud,” Chanaka Fernando, 2018. [Online]. Available: https://dzone.com/articles/the-evolution-of-distributed-systems. [Accessed: 28-Sep-2018].

G. B. George Coulouris, Jean Dollimore, Tim Kindberg, DISTRIBUTED SYSTEMS Concepts and Design, Fifth Edit. Addison-Wesley, 2011.

M. Abdoos, “Improved Deadlock Prevention Algorithms in Distributed Systems,” Int. J. Eng. Appl. Comput. Sci., vol. 02, no. 02, pp. 75–78, Feb. 2017.

G. Dhiraj and V. K. Gupta, “Approaches for Deadlock Detection and Deadlock

Y. Bhatia and S. Verma, “Deadlocks in Distributed Systems,” Int. J. Res., vol. 1, no. 9, pp. 1249–1252, 2014.

D. Malhotra, “Deadlock Prevention Algorithm in Grid Environment,” vol. 02013, 2016.

W. C. H. Cheng, “Using ordered and atomic multicast for distributed deadlock prevention,” Proc. - 1st Int. Symp. Object-Oriented Real-Time Distrib. Comput. ISORC 1998, vol. 1998–April, pp. 106–116, 1998.

F. Tang, I. You, S. Yu, C. L. Wang, M. Guo, and W. Liu, “An efficient deadlock prevention approach for service oriented transaction processing,” Comput. Math. With Appl., vol. 63, no. 2, pp. 458–468, 2012

S. Ghosh, “Distributed Systems: An Algorithmic Approach,” pp. 352–361, 2015.

J. Wu, Distributed system design. 2017.

Dev-C++ download SourceForge.net,” Slashdot Media.[Online]. Available: https: // sourceforge .net/projects/orwelldevcpp/. [Accessed: 21-Feb-2019].

Formulating DNA Chains Using Effective Calculability, Syed Atif Ali Shah, INTERNATIONAL JOURNAL OF COMPUTER (IJC). http://ijcjournal.org

Reengineering the Industrial CMMI, Syed Atif Ali Shah, Journal of Advances in Computer Engineering and Technology 4 (3), 1-10.

Downloads

Published

2019-06-14

How to Cite

Jan, A., Ali Shah, S. A., Khan, Z., Jan, S., Haroon, A., Khan, I., & Tariq, H. (2019). Upgraded Deadlock Averting Algorithms in Distributed Systems. International Journal of Computer (IJC), 34(1), 24–33. Retrieved from https://ijcjournal.org/index.php/InternationalJournalOfComputer/article/view/1401

Issue

Vol. 34 No. 1 (2019)

Section

Articles

License

Authors who submit papers with this journal agree to the following terms.