The goal of the list-ranking problem is to assign a rank to each record in a linked list; the rank of a record is its position relative to the last element in the list where the last element has rank zero. Each record has two fields, one for its rank and another for the address of its successor record. The address field of the last record contains its own address.

Describe an efficient p-processor EREW PRAM algorithm to solve the list-ranking problem for a list of p items stored one per location in the common memory.