Manuscript Details - IJARW1247

ManuScript Details
Paper Id: IJARW1247
Title: DEADLOCK AVOIDANCE STRATEGY IN CONCURRENT PROCESSING
Published in: International Journal Of All Research Writings
Publisher: IJARW
ISSN: 2582-1008
Volume / Issue: Volume 1 Issue 11
Pages: 7
Published On: 5/30/2020 8:22:28 PM      (MM/dd/yyyy)
Main Author Details
Name: Khin Po
Institute: University of Computer Studies, (Mandalay)
Co - Author Details
Author Name Author Institute
May Thu Naing University of Computer Studies(Mandalay)
Abstract
Research Area: Computer Science & Engineering
KeyWord: Keywords- Deadlock, Deadlock prevention, Deadlock detection, Deadlock avoidance, Banker’s algorithm
Abstract: Deadlock can be defined as the permanent blocking of a set of processes that either compete for the system resources or communicate with each other. All deadlock involve conflicting needs for resources by two or more processes. A common example is the traffic deadlock. The blockage is perment unless the OS takes some extraordinary action, such as killing me or more processes or forcing one or more processes to backtrack. There are three general approaches to dealing with the deadlock: prevention, detection and avoidance. This paper presents the banker’s algorithm that used in deadlock avoidence strategy.
Citations
Copy and paste a formatted citation or use one of the links to import into a bibliography manager and reference.

IEEE
Khin Po, May Thu Naing, "DEADLOCK AVOIDANCE STRATEGY IN CONCURRENT PROCESSING", International Journal Of All Research Writings, vol. 1, no. 11, pp. 210-216, 2020.
MLA Khin Po, May Thu Naing "DEADLOCK AVOIDANCE STRATEGY IN CONCURRENT PROCESSING." International Journal Of All Research Writings, vol 1, no. 11, 2020, pp. 210-216.
APA Khin Po, May Thu Naing (2020). DEADLOCK AVOIDANCE STRATEGY IN CONCURRENT PROCESSING. International Journal Of All Research Writings, 1(11), 210-216.
DEADLOCK AVOIDANCE STRATEGY IN CONCURRENT PROCESSING
Number Of Downloads - 3


Last downloaded on 25/07/2020
DEADLOCK AVOIDANCE STRATEGY IN CONCURRENT PROCESSING

Search On Google

Feel free to visit our FAQ section. You can also send us an email here or give us a call on +91 8347459448.