A new metric for self-organizing feature maps allows mapping of arbitrary parallel programs

A modification of Kohonen's (1982) self-organizing feature maps offers solutions for a wide range of graph mapping problems. This is reached by replacing the Euclidian metric of the target space by a new metric. A sample implementation for mapping parallel programs onto processor networks demonstrates the properties of this method.