Work

Partitioning programs for parallel execution

Year: 1988

Type: conference-paper

Abstract: The ability of parallel computers to execute multiple instruction streams (tasks) simultaneously gives rise to the problem of partitioning a program into a set of tasks that can be assigned to different processors. The degree to which parallelism can be exploited, the amount of overhead involved during parallel execution of a program and a number of other factors depend directly on partitioning. A good partitioning scheme must take into account all these factors. In this paper we present algorithms to compute optimal partitions in diverse models of the problem. Both directed and undirected graph representations of a parallel program are considered. For some instances of the problem where practical optimal schemes are not possible we suggest simple and efficient heuristics. Finally, a polynomial time algorithm to compute optimal partitions for chains is given.

Source: International Conference on Supercomputing

DOI: 10.1145/55364.55386

Authors: M. Girkar, C. Polychronopoulos

Institutions: University of Illinois Urbana-Champaign, University of Illinois System

Language: English

Topic: Parallel Computing and Optimization Techniques

Subfield: Hardware and Architecture

Field: Computer Science

Domain: Physical Sciences

Open Access status: bronze

Funders: National Science Foundation, U.S. Department of Energy

Award: Cedar System Prototype