Search
3 articles for “Deadlock handling”
-
Breaking Deadlocks: A Novel Method for Dynamic Deadlock Resolution in Concurrent Systems
Abstract: It is known that deadlock is one of the major challenges in concurrent systems, as sometimes this deadlock may lead to system failure as well as performance degradation. Traditional deadlock handling methods, for example, deadlock detection and prevention, have several limitations for systems that have a dynamic nature in which the structure of the system and the resource requirements change over time. In this article, we present a novel technique …
Published in Journal of Advances in Shell Programming · Vol. 10, Issue 3, 2023 · pp. 29–35 Read article
-
Developing Operating System Simulation Software for Windows Based System by C# .NET Framework and an Android Application by JAVA and XML
Abstract: AbstractThe academic course named operating system (OS) is very important for undergraduate students in computer science and engineering (CSE) related discipline. In this course, the teachers mainly deliver lectures on the fundamentals issues of OS, process scheduling, paging, deadlocks handling etc. In this paper, windows OS based desktop simulation software has been developed with a view to coordinating the teachers and students to conduct the OS course interactively. Also, the …
Published in Journal of Operating Systems Development & Trends · Vol. 4, Issue 1, 2017 · pp. 9–18 Read article
-
A Review of Locking Protocols for Concurrency Control in Parallel Databases
Abstract: In modern database systems, many transactions may run at the same time. When several users try to access the same data or update the data simultaneously, then it creates a problem such as inconsistency data, lost updates or misinformation and may lead to conflicts between the transactions and deadlocks. To avoid these types of issues and maintain the correctness of the database, concurrency control protocols are mainly used. This paper …
Published in Journal of Advanced Database Management & Systems · Vol. 13, Issue 2, 2026 Read article