  Search pattern experienced by the processor to search an element in secondary
storage devices follows a random sequence. Formally, it is a random walk and
its modeling is crucial in studying performance metrics like memory access
time. In this paper, we first model the random walk using extended Fibonacci
series. Our simulation is done on a parallel computing model (PRAM) with EREW
strategy. Three search primitives are proposed under parallel computing model
and each primitive is thoroughly tested on an array of size $10^7$ with the
size of random walk being $10^4$. Our findings reveal that search primitive
with pointer jumping is better than the other two primitives. Our key
contribution lies in modeling random walk as an extended Fibonacci series
generator and simulating the same with various search primitives.
