Thread-safe implementations of a stack are Stack and ConcurrentLinkedDeque.
The Stack class represents a Last In First Out (LIFO) stack of objects. It extends the Vector class with several operations that allow a vector to be treated as a stack. Every method of Stack is synchronized. Creating a Stack is as simple as the following:
Stack<Integer> stack = new Stack<>();
A ConcurrentLinkedDeque implementation can be used as a Stack (LIFO) via its push() and pop() methods:
Deque<Integer> stack = new ConcurrentLinkedDeque<>();
For better performance, prefer ConcurrentLinkedDeque over Stack.
The code bundled to this book comes with an application for each of the preceding collections meant to span several threads in order to reveal their thread-safe character.