非阻塞Stack

非阻塞版本相对于基于锁的版本有几个性能优势。首先，它用硬件的原生形态代替 JVM 的锁定代码路径，从而在更细的粒度层次上（独立的内存位置）进行同步，失败的线程也可以立即重试，而不会被挂起后重新调度。更细的粒度降低了争用的机会，不用重新调度就能重试的能力也降低了争用的成本。即使有少量失败的 CAS 操作，这种方法仍然会比由于锁争用造成的重新调度快得多。

public class ConcurrentStack<E> {
	public AtomicReference<Node<E>> head = new AtomicReference<Node<E>>();

	public void push(E value) {
		Node<E> newHead = new Node<E>(value);
		Node<E> oldHead ;
		do {
			oldHead = head.get();
			newHead.next = oldHead;
		} while(!head.compareAndSet(oldHead, newHead));
	}

	public E pop() {
		Node<E> newHead;
		Node<E> oldHead;
		do {
			oldHead = head.get();
			if (oldHead == null) 
                return null;
			newHead = oldHead.next;
		} while(!head.compareAndSet(oldHead, newHead));

		return oldHead.value;
	}

	static class Node<E>{
		final E value;
		Node<E> next;
		public Node(E value) {
			this.value = value;
		}
	}
}

public class SynchronizedStack<E> {
	public Node<E> head;

	public synchronized void push(E value) {
		Node<E> newHead = new Node<E>(value);
		Node<E> oldHead ;
		oldHead = head;
		newHead.next = oldHead;
		head = newHead;
	}

	public synchronized E pop() {
		Node<E> newHead;
		Node<E> oldHead = head;
		if (oldHead == null) 
            return null;
		newHead = oldHead.next;
		head = newHead;

		return oldHead.value;
	}

	static class Node<E>{
		final E value;
		Node<E> next;
		public Node(E value) {
			this.value = value;
		}
	}
}

参考：[url=http://www.ibm.com/developerworks/cn/java/j-lo-lockfree/index.html]Java 下实现锁无关数据结构[/url]