CFP last date
20 December 2024
Call for Paper
January Edition
IJCA solicits high quality original research papers for the upcoming January edition of the journal. The last date of research paper submission is 20 December 2024

Submit your paper
Know more
The week's pick
Responsive image
Improved Shuffled Frog Leaping Algorithm with Self-Adaptive Shuffling for Fuzzy Logic PD+G Controller Optimization in Robotic Manipulators

Duc Hoang Nguyen
Random Articles
Reseach Article

An Optimal Goal Programming Model to Recovery from Deadlocks

by Anas Jebreen Atyeeh Husain
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 138 - Number 8
Year of Publication: 2016
Authors: Anas Jebreen Atyeeh Husain
10.5120/ijca2016909007

Anas Jebreen Atyeeh Husain . An Optimal Goal Programming Model to Recovery from Deadlocks. International Journal of Computer Applications. 138, 8 ( March 2016), 26-32. DOI=10.5120/ijca2016909007

@article{ 10.5120/ijca2016909007,
author = { Anas Jebreen Atyeeh Husain },
title = { An Optimal Goal Programming Model to Recovery from Deadlocks },
journal = { International Journal of Computer Applications },
issue_date = { March 2016 },
volume = { 138 },
number = { 8 },
month = { March },
year = { 2016 },
issn = { 0975-8887 },
pages = { 26-32 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume138/number8/24400-2016909007/ },
doi = { 10.5120/ijca2016909007 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T23:39:09.894953+05:30
%A Anas Jebreen Atyeeh Husain
%T An Optimal Goal Programming Model to Recovery from Deadlocks
%J International Journal of Computer Applications
%@ 0975-8887
%V 138
%N 8
%P 26-32
%D 2016
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Process termination is a common strategy that is used to recover from deadlocks. However, terminating processes during their execution may affect and degrade the performance of the underlying system. The proposed solution in this paper is to select particular processes that can reduce the potential consequences of process termination in order to be terminated. A goal programming (GP) model is constructed to identify and select the best processes that can break a deadlock at lowest consequences of process termination. Several experimental tests are performed and the results showed that the proposed solution maintains the performance of the system during deadlock recovery compared to the other related methods.

References
  1. A. S. Tanenbaum, Modern operating systems ( Prentice Hall Press, 2014).
  2. Y. Nir-Buchbinder, R. Tzoref, S. Ur, Deadlocks: From exhibiting to healing. In Runtime Verification, LNCS 5289, Springer Berlin Heidelberg, 2008, 104-118.
  3. V. S. Kondhalka, Deadlock detection and recovery in Linux. Ph.D. Thesis, San Diego State University, 2012.
  4. Izumi, A., Dohi, T., & Kaio, N. Deadlock Detection Scheduling for Distributed Processes in the Presence of System Failures. Proceedings of the 6th Pacific Rim International Symposium on Dependable Computing IEEE (page 133, 2010).
  5. E. Knapp, Deadlock detection in distributed databases. ACM Computing Surveys (CSUR), Vol. 19, n. 4, pp. 303-328, 1987.
  6. S. Lee, J. L. Kim, Performance analysis of distributed deadlock detection algorithms, Knowledge and Data Engineering, IEEE Transactions on, Vol. 13, n. 4, pp. 623-636, 2001.
  7. M. Singhal, Deadlock detection in distributed systems. IEEE Computer, Vol. 22, n. 11, pp. 37-48, 1989.
  8. J. R. González de Mendívil, F. Fariña, J. R. Garitagotia, C. F. Alastruey, J. M. Bernabeu-Auban, A distributed deadlock resolution algorithm for the AND model. IEEE Transactions on Parallel and Distributed Systems, Vol. 10, n. 5, pp. 433-447, 1999.
  9. I. Terekhov, T. Camp, Time efficient deadlock resolution algorithms. Information Processing Letters, Vol. 69, n. 3, pp. 149-154, 1999.
  10. R. C. Holt, Some deadlock properties of computer systems. ACM Computing Surveys (CSUR), Vol. 4, n. 3, pp. 179-196, 1972.
  11. K. S. Vaisla, M. Goswami, A. Singh, VGS Algorithm-an Efficient Deadlock Resolution Method. Journal of Computer Applications, Vol. 44, n. 1, pp. 29-33, 2012.
  12. S. M. Darwish, A. A. El-Zoghabi, M. H. Hassan, Soft Computing for Database Deadlock Resolution. International Journal of Modeling and Optimization, Vol. 5, n. 1, pp. 15, 2015.
  13. F. Zeng, Just-in-time and just-in-place deadlock resolution. Ph.D. Thesis, New Brunswick Rutgers, The State University of New Jersey, 2007.
  14. A. Silberschatz, P. B. Galvin, G. Gagne, Operating system concepts (Wiley, 2013).
  15. Chow, Y. C., Kostermeyer, W. F., & Luo, K. Efficient techniques for deadlock resolution in distributed systems, Proceedings of the Fifteenth Annual International in Computer Software and Applications Conference, IEEE, (Page: 64 Year of Publication: 1991).
  16. Y. Ling, S. Chen, C. Y. Chiang, On optimal deadlock detection scheduling. IEEE Transactions on Computers, Vol. 55, n. 9, pp. 1178-1187, 2006.
  17. Macri, P. P. Deadlock detection and resolution in a CODASYL based data management system. In Proceedings of the 1976 ACM SIGMOD international conference on Management of data, ACM, (Page: 45 Year of Publication: 1976).
  18. Villadangos, J., Fariña, F., Cordoba, A., de Mendivil, J. R. G., & Garitagoitia, J. R. Knot resolution algorithm and its performance evaluation. In Proceedings of the Conference on Parallel, Distributed and Network-Based Processing, IEEE (Page: 227 Year of Publication: 2003).
  19. Lee, S. Fast detection and resolution of generalized distributed deadlocks. Proceedings of the10th Euromicro Workshop on Parallel, Distributed and Network-based Processing, IEEE, (Page: 429 Year of Publication: 2002).
  20. Cordoba, A., Fariña, F., Garitagoitia, J. R., de Mendivil, J. R. G., & Villadangos, J. A low communication cost algorithm for distributed deadlock detection and resolution. Proceedings of the Eleventh Euromicro Conference on Parallel, Distributed and Network-Based Processing, IEEE, (Page: 235 Year of Publication: 2003).
  21. Mitchell, D. P., & Merritt, M. J. A distributed algorithm for deadlock detection and resolution. In Proceedings of the third annual ACM symposium on Principles of distributed computing , ACM, (Page: 282Year of Publication: 1984).
  22. M. Roesler,W. Burkhard, A. Resolution of deadlocks in object-oriented distributed systems. Computers, IEEE Transactions on, Vol. 38, n. 8, pp. 1212-1224, 1989.
  23. Hashemzadeh, M., Farajzadeh, N., & Haghighat, A. T. Optimal detection and resolution of distributed deadlocks in the generalized model. In Proceedings of the 14th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing,IEEE, (Page: 4-pp Year of Publication: 2006).
  24. J. T. Leung., E. K.Lai, On minimum cost recovery from system deadlock. IEEE Transactions on Computers, Vol. 28, n. 9, pp. 671-677, 1979.
  25. V. Geetha, N. Sreenath, Performance Analysis of Victim Selection Algorithms in Distributed Systems and Proposal of Weight Based Resolution Strategy. International Journal of Computer Science, Vol. 2, n. 4, pp. 40-44, 2012.
  26. Schruben, L. W. Deadlock detection and avoidance in cluster tools. In Proceedings of the 1999 International Conference on Semiconductor Manufacturing Operational Modeling and Simulation, (Page: 31 Year of Publication: 1999).
  27. Weikum, G., & Vossen, G. Transactional information systems. ACM, 2002
  28. P. Chahar, S.Dalal, Deadlock Resolution Techniques: An Overview.International Journal of Scientific and Research Publications, Vol. 3, n. 7, pp. 5-1, 2013.
  29. Lin, X., Orlowska, M. E., & Zhang, Y. An optimal victim selection algorithm for removing global deadlocks in multidatabase systems. Proceedings In TENCON'94. IEEE Region 10's Ninth Annual International Conference. Theme: Frontiers of Computer Technology, (Page: 501 Year of Publication: 1994).
  30. Lin, X., & Chen, J. . An optimal deadlock resolution algorithm in multidatabase systems. Proceedings in the International Conference on In Parallel and Distributed Systems IEEE, (Page: 516 Year of Publication: 1996).
  31. Sapra, P., Kumar, S., & Rathy, R. K. Deadlock Detection and Recovery in Distributed Databases. International Journal of Computer Applications, Vol. 73, n. 1, pp. 32-36, 2013.
  32. R. Agrawal, M. J. Carey, L. W. McVoy, The performance of alternative strategies for dealing with deadlocks in database management systems. IEEE Transactions on Software Engineering, Vol. SE-13, n. 12, pp. 1348-1363, 1987.
  33. Alom, M., Henskens, F., & Hannaford, M. Deadlock Detection Views of Distributed Database. Proceedings in the Sixth International Conference on Information Technology: New Generations,IEEE, (Page: 730 Year of Publication: 2009).
  34. Al Shayeji, M. H., Fairouz, A., & Samrajesh, M. D. An Enhanced Distributed Deadlock Detection and Recovery in Process Networks. International Journal of Computer and Electrical Engineering, Vol. 4, n. 3, pp. 298-302, 2012.
  35. Sinha, M. K., & Natarajan, N. A priority based distributed deadlock detection algorithm.  IEEE Transactions on Software Engineering, Vol. 1, pp. 67-80, 1985.
  36. Chen, S., & Ling, Y. Stochastic analysis of distributed deadlock scheduling. In Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing, (Page: 265 Year of Publication: 2005).
  37. S. Lee, Fast, centralized detection and resolution of distributed deadlocks in the generalized model. IEEE Transactions on Software Engineering, Vol. 30, n. 9, pp. 561-573, 2004.
  38. A. J. A. Husain, New Roll-Up Operator for Non-Additive Numeric Measure Summarization. Contemporary Engineering Sciences, Vol. 6, n. 8, pp. 393 - 402, 2013.
Index Terms

Computer Science
Information Sciences

Keywords

Goal Programming Deadlock Recovery Process Termination Termination Cost.

Powered by PhDFocusTM