Optimal mapping of irregular finite element domains to parallel processorsMapping the solution domain of n-finite elements into N-subdomains that may be processed in parallel by N-processors is an optimal one if the subdomain decomposition results in a well-balanced workload distribution among the processors. The problem is discussed in the context of irregular finite element domains as an important aspect of the efficient utilization of the capabilities of emerging multiprocessor computers. Finding the optimal mapping is an intractable combinatorial optimization problem, for which a satisfactory approximate solution is obtained here by analogy to a method used in statistical mechanics for simulating the annealing process in solids. The simulated annealing analogy and algorithm are described, and numerical results are given for mapping an irregular two-dimensional finite element domain containing a singularity onto the Hypercube computer.
Document ID
19880057663
Acquisition Source
Legacy CDMS
Document Type
Conference Paper
Authors
Flower, J. (Jet Propulsion Lab., California Inst. of Tech. Pasadena, CA, United States)
Otto, S. (Jet Propulsion Lab., California Inst. of Tech. Pasadena, CA, United States)
Salama, M. (California Institute of Technology Jet Propulsion Laboratory, Pasadena, United States)
Date Acquired
August 13, 2013
Publication Date
January 1, 1987
Subject Category
Computer Systems
Meeting Information
Meeting: Parallel computations and their impact on mechanics