By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Meyer, J.W. ; Tech. Inf. 2, Tech. Univ. Hamburg-Harburg, Germany

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

Published in:

Tools with Artificial Intelligence, 1993. TAI '93. Proceedings., Fifth International Conference on

Date of Conference:

8-11 Nov 1993