In this paper, a parallel algorithm for all nearest smallers problem without using doubly logarithmic tree is described. It is shown that using only O (log log n) time routines for merging and prefix minima, we can easily get an O (log log n) time parallel algorithm for the all Nearest Smallers problem.