Performance of a multiprocessor for Applicative programs

Applicative programming Languages provide opportunities for parallel processing without requiring the programmer to be concerned with explicit synchronization of portions of the computation. We present a computational model of a multiprocessor which executes applicative programs, and we analyze the expected performance of the model via simulation. As the number of processors is doubled, elapsed execution time is nearly halved, until system bottlenecks occur. An alternative model is proposed which alleviates these bottlenecks. The basis of the second model is an interconnection switch which is characterized by log(n) access time and n log(n) cost.