Document Type

Technical Report

Publication Date

Spring 5-1-1975


The Multi Associative Processor is a hypothetical machine composed of eight control units and an arbitrary number of processing elements. Each control unit executes a single-instruction-stream multiple-data-stream program in conjunction with a subset of the dynamically allocatable processing elements. In this machine, the data bus interconnecting control units and processing elements is partitioned in order to decrease the hardware cost of the interconnection. In previous work, the degree of partitioning was investigated, and it was found that the processing element allocation algorithm was very critical to the performance of the system, [4]. In this paper, a basic allocation algorithm is investigated under various job loads, and then the performance is compared to three distinct algorithms that compact processing elements into smaller subsets of the partitions under varying conditions.