Suppose the computer has an atomic compare and swapinstruction which has the fol

Question

Suppose the computer has an atomic compare and swapinstruction which has the following effect: CSW (a, b, c): < if (a == c)        { c = b; return (0);}     else        { a = c; return (1);} > a, b and c are integers Develop a solution to the critical section problem for nprocesses using CSW. Ignore the eventual entry property andexplain how your solutin works. Suppose the computer has an atomic compare and swapinstruction which has the following effect: CSW (a, b, c): < if (a == c)        { c = b; return (0);}     else        { a = c; return (1);} > a, b and c are integers Develop a solution to the critical section problem for nprocesses using CSW. Ignore the eventual entry property andexplain how your solutin works.

Explanation / Answer

Dear, Critical section problem for n-processes using Compare andSwap CSW (a, b, c):    if (a == c)        { c = b; return (0);}     else        { a = c; return (1);} a, b and c are integers CSW (a, b, c):    if (a == c)        { c = b; return (0);}     else        { a = c; return (1);} a, b and c are integers Acquire_mutex(lock)   // before entering criticalsection {     boolean status;     do       status = CSW ( lock,false, true);     while ( status == false );    CRITICAL SECTION } Release_mutex(lock) // after existing criticalsection
{      lock = false ; } I hope this will helps you!!!!!!!!!!!!!

Related Questions

Navigate

• Browse (All)
• Browse S
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.