The k-segment stack is a relaxed stack implemented as a stack of array segments of size k. Theses segments are operated on in lifo order, but without internal ordering within the segments (leading to k out-of-order relaxation).
The design is from the k-stack from the paper Quantitative relaxation of concurrent data structures, and the implementation is from the evaluation of the first 2D paper.
Adones Rukundo