Optimal space distributed move-to-front lists
Michael Saks, Fotios Zaharoglou · 1991
A distributed move-to-front list is a data object that abstracts a temporal ordering on a set of processes in a distributed system.We present a lower bound and a matching upper bound of @ (/og2n) bits on the space per processor needed to implement a distributed move-to-front list using single writer-multiple reader registers.