Fast rehashing in PRAM emulations

In PRAM emulations, universal hashing is a well-known method for distributing the address space among memory modules. However, if the memory access patterns of an application often result in high module congestion, it is necessary to rehash by choosing another hash function and redistributing data on the fly. For the case of linear hash functions h(x) - ax mod m, we present an algorithm to rehash an address space of size m on a p processor PRAM emulation in time O(m/p + log p). The algorithm requires O(log m) words of local storage per processor.<
>