Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged resource-allocation-graph-algorithm
0
votes
0
answers
1
OPERATING SYSTEM GALVIN DEADLOCK
In the deadlock chapter, in resource allocation graph algorithm, it is given that detecting a cycle takes O(n^2) operations... But we can find cycle in O(n+m) operations, using DFS. Why they have not considered this.. or if they have considered, what am I missing. Or is it that they have given worst case time assuming #edges(i.e; m)=n(n-1)/2 which would give O(n^2)?
In the deadlock chapter, in resource allocation graph algorithm, it is given that detecting a cycle takes O(n^2) operations... But we can find cycle in O(n+m) operations,...
aambazinga
252
views
aambazinga
asked
Aug 2, 2018
Operating System
operating-system
deadlock-prevention-avoidance-detection
resource-allocation-graph-algorithm
cycle-detection
+
–
To see more, click for the
full list of questions
or
popular tags
.
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register