Fill the Synchronisation Table

Question

Synchronisation Mechanism	Mutal Exclusion	Progress	Bounded Waiting	Deadlock	Remarks
Lock Variable
Strict Alternation
Peterson's Solution
Dekker's Algorithm
Test and Set Lock
SWAP
Fetch And Add / Test And Add

Answer 1

Condition for Synchronization mechanism divided into 2 Parts

1)Primary

     a) Mutual Exclusion

     b) Progress

2)Secondary

    a)Bounded waiting time

A) Lock variable does not provide

    a) ME(because many process can access the CS)

Thus as it fails primary requirement of synchronization we don't go for others.

B) Strict alteration provides

   a) ME(Only two process solution)

   b)BW(First have to enter the then second)

   c)not progress(Other process has to enter into cs to enable the cs for other process)

   d)free from dead lock (Only two process)

C) Peterson's Algorithm provides

   a) ME(Two process solution)

    b) Progress

    c) BW

    d) free from deadlock

D) Dekker's algorithm provides

    a) ME

    b) Progress

    c)BW

    d) free from Deadlock

E) Test and Set provides

     a) ME

      b) Progress

      c) free from deadlock

Comments

TSL

Suffers from deadlock and priority inversion, don't they ?
How about Bounded Waiting?

Do you have any comments about SWAP Instruction, Fetch and Add  ??

---

There is a problem of Priority inversion in case of priorities of the processes.

Some times it called as Live lock or spine lock .

I will give u the general scenario i.e free from deadlock

SWAP instruction provides the

a) Mutual Exclusion

b) Progress

But it needs hardware support and these operations are atomic.

---

What is the difference between live lock and dead lock ?

---

http://stackoverflow.com/questions/6155951/whats-the-difference-between-deadlock-and-livelock

---

Thx :)

---

@pC

I think strict alternation & dekker's are same. Aren't they ? Any ref. indicating they are different.