379 views
0 votes
0 votes
A computer science student assigned to work on deadlocks thinks of the following brilliant way to eliminate deadlocks. When a process requests a resource, it specifies a time limit. If the process blocks because the resource is not available, a timer is started. If the time limit is exceeded, the process is released and allowed to run again. If you were the professor, what grade would you give this proposal and why?

Please log in or register to answer this question.

Related questions

251
views
0 answers
0 votes
admin asked Oct 30, 2019
251 views
Local Area Networks utilize a media access method called CSMA/CD, in which stations sharing a bus can sense the medium and detect transmissions as well as ... you suggest a solution to this anomaly?Can starvation occur with this scenario?
218
views
0 answers
0 votes
admin asked Oct 30, 2019
218 views
Assume two processes are issuing a seek command to reposition the mechanism to access the disk and enable a read command. Each process is interrupted before ... or a livelock? What methods would you recommend to handle the anomaly?
519
views
1 answers
0 votes
admin asked Oct 30, 2019
519 views
Explain the differences between deadlock, livelock, and starvation.
265
views
0 answers
0 votes
admin asked Oct 30, 2019
265 views
Main memory units are preempted in swapping and virtual memory systems. The processor is preempted in time-sharing environments. Do you think that these ... handle resource deadlock or for other purposes? How high is their overhead?