各种锁的实现代码

1.可能导出死锁，串行没问题

class LockOne implements Lock {

private boolean[] flag = new boolean[2];

public void lock() {

  flag[i] = true;

  while (flag[j]) {}

 }

2.保证互斥，串行有问题

public class LockTwo implements Lock {

 private int victim;

 public void lock() {

  victim = i;

  while (victim == i) {};

 }

 

 public void unlock() {}

}

3.Peterson’s Algorithm  结合上面所有

public void lock() {

 flag[i] = true;

 victim  = i;

 while (flag[j] && victim == i) {};

}

public void unlock() {

 flag[i] = false;

}

4.The Filter Algorithm for n Threads  每次只有一个线程留在本层

class Filter implements Lock {

   int[] level;  // level[i] for thread i

   int[] victim; // victim[L] for level L

 

  public Filter(int n) {

  level  = new int[n];

  victim = new int[n];

  for (int i = 1; i < n; i++) {

      level[i] = 0;

  }}

…

}

 

5.Test-and-Set

public class AtomicBoolean {

 boolean value;

  

 public synchronized boolean getAndSet(boolean newValue) {

   boolean prior = value;

   value = newValue;

   return prior;

 }

}

6.Test-and-set Lock

class TASlock {

 AtomicBoolean state =

  new AtomicBoolean(false);

 

 void lock() {

  while (state.getAndSet(true)) {}

 }

 

 void unlock() {

  state.set(false);

 }}

7.Test-and-test-and-set Lock

class TTASlock {

 AtomicBoolean state =

  new AtomicBoolean(false);

 

 void lock() {

  while (true) {

   while (state.get()) {}

   if (!state.getAndSet(true))

    return;

 }

}

8.Exponential Backoff Lock

public class Backoff implements lock {

 public void lock() {

  int delay = MIN_DELAY;

  while (true) {

   while (state.get()) {}

   if (!lock.getAndSet(true))

    return;

   sleep(random() % delay);

   if (delay < MAX_DELAY)

    delay = 2 * delay;

 }}}  

9.Anderson Queue Lock

public lock() {

 mySlot = next.getAndIncrement();

 while (!flags[mySlot % n]) {};

 flags[mySlot % n] = false;

}

 

public unlock() {

 flags[(mySlot+1) % n] = true;

}  

10.CLH Queue Lock

class CLHLock implements Lock {

 AtomicReference<Qnode> tail;

 ThreadLocal<Qnode> myNode

    = new Qnode();

 public void lock() {

  Qnode pred

    = tail.getAndSet(myNode);

  while (pred.locked) {}

 }}