List ranking is one of the fundamental techniques in parallel algorithm design. Hayashi, Nakano, and Olariu proposed a deterministic list ranking algorithm that runs in O(log* n) time and a randomized one that runs in O(1) expected time, both on a reconfigurable mesh of size n × n. In this paper we show that the same deterministic and randomized time complexities can be achieved using only O(n 1+∈) processors, where ∈ is an arbitrary positive constant < 1. To reduce the number of processors, we adopt a reconfigurable mesh of high dimensions and develop a new technique called path embedding.