Cramster.com - Homework Solutions, Lecture Notes, Exams, and Free Online Homework Help
Sign Up Now! Login Customer Support Cramster Blog
McAfee Secure sites help keep you safe from identity theft, credit card fraud, spyware, spam, viruses and online scams
Problem Solved.
    Home    
    Homework Help    
   Answer Board   
    Resources (Beta)    
   
You Are Here: Home > Answer Board > Computer Science > Topic: Computer Operating Systems
Member's Topic Headline:

Computer Operating Systems

Know the answer? Have a better solution? Share it.
Sign Up Now for FREE!
Join the thousands of students
getting ahead in their classes.
Member Testimonials

Question:

Advertisement:
Answer | Ask New Question | Customize Profile | Leaderboards | 
FAQ

Member's Avatar
Rookie
Karma Points: 0
Respect (40%):
Date Posted: 7/24/2008 1:00:18 PM  Status: Live
Computer Operating Systems
Course Textbook Chapter Problem
Operating Systems Operating System Concepts (7th) by Silberschatz, Galvin, Gagne N/A N/A
Question Details:
Can someone please help me?
A system has four buffers and three processes. Each process needs at most two buffers. Prove that the system is deadlock free.

Answers:

Member's Avatar
Guru
Karma Points: 2,448
Date Posted: 7/24/2008 5:37:04 PM  Status: Live
Asker's Rating: Helpful   
Response:
My opinion is, deadlock free is proved with the Coffman conditions.
 
The Coffman conditions are:
 
  • Mutual exclusion condition: a resource that cannot be used by more than one process at a time
  • Hold and wait condition: processes already holding resources may request new resources
  • No preemption condition: only a process holding a resource may release it
  • Circular wait condition: two or more processes form a circular chain where each process waits for a resource that the next process in the chain holds

    • The first condition is given, the rest three Hold and wait condition, No preemption condition and Circular wait condition do it deadlock free. Deadlock can only occur in systems where all 4 conditions hold true.
    zenmas's Comment:
    than you very much



    By reading or posting messages on these forums, you are agreeing to the Answer Board's Terms of Service and Conduct (TSC).


    About Cramster | Terms of Use | Privacy Policy | Contact Us | Press Room | Site Map | Support | Anti-Cheating Policy

    Cramster.com is not affiliated with any publisher. Book covers, title and author names appear for reference only.
    Copyright © 2008 Cramster, Inc.