Using data partitioning to implement a parallel assembler
Howard P. Katseff · 1988
A technique for implementing algorithms on a multiprocessor computer system is data partitioning, in which input data for a problem is partitioned among many processors that cooperate to solve the problem. This paper demonstrates that data partitioning is a good method for implementing an assembler on a message-passing multiprocessor system: it yields a speedup exceeding a factor of 6 with eight processors. We compare several alternative methods for distributing program text and sharing global information among the processors executing the assembler: operations that are important for a variety of applications implemented with data partitioning.