[{“box”:0,”content”:”
n
n
- n t
n
Daniel Matthias, Z.L. Patricia, E.O. Taylor
[/foreach]
n
n
n
- [foreach 286] [if 1175 not_equal=””]n t
- Lecturer, Student, Student, Department of Computer Science, Rivers State University, Department of Computer Science, Rivers State University, Department of Computer Science, Rivers State University, Port Harcourt, Port Harcourt, Port Harcourt, Nigeria, Nigeria, Nigeria
n[/if 1175][/foreach]
n
Abstract
nWhen the demand for a system resource exceeds the system’s capacity, deadlock, an operating system problem, results. The problem of deadlock frequently causes a distributed database’s performance to lag. This research critically examined two types of deadlock problems that have an impact on a distributed database’s performance. Transaction control and transaction location deadlock difficulties were the specific challenges that the article specifically addressed. In this paper, deadlock prevention techniques for distributed database systems were suggested. The suggested system was developed utilizing MySQL, Hyper-text Pre-processor, and Object-Oriented Analysis and Design Methodology (OOADM). Based on the deadlock management and control approaches known as hold and wait and mutual exclusion, the suggested system was able to accept two requests for system resources and then give the required system resource. The suggested system model outperforms the current system in terms of speed, accuracy, and deadlock avoidance, according to the performance evaluation of both systems. This paper used pre-defined parameters to illustrate the outcomes and performance assessment of the existing and new systems for deadlock management and control. Programs for both systems were run before compiling the findings for both models. The pre-defined parameters for both models include the number of executed iterations, the quantity of resources sought per iteration, the quantity of deadlock control strategies employed, and the quantity of concurrent requests granted depending on deadlock avoidance. For a distributed database system, this work also contributed deadlock prevention strategies.
n
Keywords: Deadlock, Distributed Databases, Algorithm, Performance, Operating System
n[if 424 equals=”Regular Issue”][This article belongs to International Journal of Algorithms Design and Analysis Review(ijadar)]
n
n
n
n
n
nn
nn[if 992 equals=”Open Access”] Full Text PDF[else] nvar fieldValue = “[user_role]”;nif (fieldValue == ‘indexingbodies’) {n document.write(‘Full Text PDF‘);n }nelse if (fieldValue == ‘administrator’) { document.write(‘Full Text PDF‘); }nelse if (fieldValue == ‘ijadar’) { document.write(‘Full Text PDF‘); }n else { document.write(‘ ‘); }n [/if 992] [if 379 not_equal=””]nn
Browse Figures
n
n[/if 379]n
References
n[if 1104 equals=””]n
1. Cleland-Huang J, Chambers T, Zudaire S, Chowdhury MT, Agrawal A, Vierhauser M. Human- Machine Teaming with small Unmanned Aerial Systems in a MAPE-K Environment. ACM Transactions on Autonomous and Adaptive Systems. 2023.
2. Viloria A, Lezama OB, Mercado-Caruzo N. Unbalanced data processing using oversampling: machine learning. Procedia Computer Science. 2020 Jan 1;175:108–13.
3. Borri E, Tafone A, Romagnoli A, Comodi G. A preliminary study on the optimal configuration and operating range of a “microgrid scale” air liquefaction plant for Liquid Air Energy Storage. Energy Conversion and Management. 2017 Jul 1;143:275–85. 4. Apt KR, Olderog ER. Fifty years of Hoare’s logic. Formal Aspects of Computing. 2019 Dec;31:751–807.
5. Wang B, Gong Y, Ying B, Cheng B. Association of initial serum total calcium concentration with mortality in critical illness. BioMed Research International. 2018 Jun 26;2018.
6. Duato J, Lysne O, Pang R, Pinkston TM. A theory for deadlock-free dynamic network reconfiguration. IEEE Transactions on Parallel and Distributed Systems. 2003.
7. Rezende D, Danihelka I, Gregor K, Wierstra D. One-shot generalization in deep generative models. In International conference on machine learning 2016 Jun 11 (pp. 1521–1529). PMLR.
8. Sethi S, Rout A, Mishra D. An effective and scalable AODV for wireless ad hoc sensor networks. International Journal of Computer Applications. 2010 Aug;975:8887.
9. Jinsong, Zhan, Guo YN, Liu CL. A Deadlock Prevention Using Adjacency Matrix on Dining Philosophers Problem. Applied Mechanics and Materials. 2011 Oct 1;121:1191.
10. Rangarajan L. Bi-level dimensionality reduction methods using feature selection and feature extraction. International Journal of Computer Applications. 2010 Jul;4(2):33–38.
11. han JS, Guo YN, Liu CL. RETRACTED: A Deadlock Prevention Using Adjacency Matrix on Dining Philosophers Problem. Applied Mechanics and Materials. 2012 Jan 20;121:1191–5.
12. Endley MJ, Karim K. Effects of Focused Written Feedback and Revision in the Development of Explicit and Implicit Knowledge in EFL Writing. Language Teaching Research Quarterly. 2022;30:32–49.
nn[/if 1104][if 1104 not_equal=””]n
- [foreach 1102]n t
- [if 1106 equals=””], [/if 1106][if 1106 not_equal=””],[/if 1106]
n[/foreach]
n[/if 1104]
nn
nn[if 1114 equals=”Yes”]n
n[/if 1114]
n
n
n
International Journal of Algorithms Design and Analysis Review
n
n
n
n
n
n
| Volume | 01 |
| Issue | 02 |
| Received | September 5, 2023 |
| Accepted | September 20, 2023 |
| Published | October 4, 2023 |
n
n
n
n
n[/foreach]
n[/if 1190] [if 1177 not_equal=””]n
n
n[/foreach]
n[/if 1177]
n
n
n
n function myFunction2() {n var x = document.getElementById(“browsefigure”);n if (x.style.display === “block”) {n x.style.display = “none”;n }n else { x.style.display = “Block”; }n }n document.querySelector(“.prevBtn”).addEventListener(“click”, () => {n changeSlides(-1);n });n document.querySelector(“.nextBtn”).addEventListener(“click”, () => {n changeSlides(1);n });n var slideIndex = 1;n showSlides(slideIndex);n function changeSlides(n) {n showSlides((slideIndex += n));n }n function currentSlide(n) {n showSlides((slideIndex = n));n }n function showSlides(n) {n var i;n var slides = document.getElementsByClassName(“Slide”);n var dots = document.getElementsByClassName(“Navdot”);n if (n > slides.length) { slideIndex = 1; }n if (n (item.style.display = “none”));n Array.from(dots).forEach(n item => (item.className = item.className.replace(” selected”, “”))n );n slides[slideIndex – 1].style.display = “block”;n dots[slideIndex – 1].className += ” selected”;n }n n function myfun() {n x = document.getElementById(“editor”);n y = document.getElementById(“down”);n z = document.getElementById(“up”);n if (x.style.display == “none”) {n x.style.display = “block”;n }n else {n x.style.display = “none”;n }n if (y.style.display == “none”) {n y.style.display = “block”;n }n else {n y.style.display = “none”;n }n if (z.style.display == “none”) {n z.style.display = “block”;n }n else {n z.style.display = “none”;n }n }n function myfun2() {n x = document.getElementById(“reviewer”);n y = document.getElementById(“down2”);n z = document.getElementById(“up2”);n if (x.style.display == “none”) {n x.style.display = “block”;n }n else {n x.style.display = “none”;n }n if (y.style.display == “none”) {n y.style.display = “block”;n }n else {n y.style.display = “none”;n }n if (z.style.display == “none”) {n z.style.display = “block”;n }n else {n z.style.display = “none”;n }n }n”}]