A programming paradigm for distributed-memory computers
Silvia A. Crivelli, Elizabeth R. Jessup · University of North Texas Digital Library (University of North Texas) · 1992
One of the problems that arises in programming a multicomputer is the effective partitioning of the work into tasks and the assigning of those tasks to the processors. We will present a programming paradigm as a method of structuring the algorithms, allowing us to identify and separate programming phases. This paradigm allows us to develop a general software tool for dynamically allocating work to the processors while hiding many details of load balancing. Our paradigm consists of four phases: partitioning the work, mapping the tasks into the processors connected by some virtual topology, running the application program, and embedding the virtual architecture into the actual machine. The paradigm applies to diverse problems and to a variety of multiprocessors without significant reprograming. We will use the multisection method for computing eigenvalues to show how this tool works.