Perfect hash functions made parallel-Lazy functional programming on a distributed multiprocessor

A programming technique for efficient parallel search is described. The authors study a search problem for which a heuristic preprocess makes sequential execution feasible. Two key questions are addressed. (1) How can this algorithm, optimized for sequential execution, be programmed in parallel to produce significant speedup? (2) how can this be done in a purely functional language without compromising either conciseness or referential transparency? The authors describe programming techniques for efficient parallel search in a lazy and pure functional language. These techniques are applied to an illustrative example. Results of execution on a real parallel machine are given