A comparison of optimization heuristics for the data mapping problem
Nikos Chrisochoides, Nashat Mansour, Geoffrey C. Fox, Cornell Theory Center. Advanced Computing Research Institute
Cornell Theory Center, Cornell University, 1995 - Mathematics - 26 pages
What people are saying - Write a review
We haven't found any reviews in the usual places.
0Ftyp 64 processors allocation phase average and maximum block partitioning communication cost components computational load Cornell Theory Center cost function data distribution data mapping algorithms data mapping problem distributed memory domain E. X. Houstis evaluation execution Figure G. C. Fox Genetic Algorithm Geoffrey Fox geometry graph partitioning GGP and RSB graph contraction heuristics hypercube interface nodes iterative PDE solvers iterative solvers J. R. Rice Laplacian matrix linear system load balance loosely synchronous machine-dependent machine-independent mapping solution mass centers maximum number Memory Computing mesh node MIMD minimization multicomputer nCUBE neural network neural network algorithm number of interface number of nodes objective function parallel iterative PDE Partial Differential Equations partitioning algorithm PDE computations PDE operator perturbation physical optimization algorithms PxQ algorithm random Recursive Spectral Bisection remapping respect to seven RSB GGP XX simulated annealing single-phase iterative PDE six data mapping spin STRD-DEV subdomains submesh connectivity temperature Wei Yuan workload X. P. Chrisochoides