http://iet.metastore.ingenta.com
1887

Mapping finite element grids onto parallel multicomputers using a self-organising map

Mapping finite element grids onto parallel multicomputers using a self-organising map

For access to this article, please select a purchase option:

Buy article PDF
$19.95
(plus tax if applicable)
Buy Knowledge Pack
10 articles for $120.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
IEE Proceedings - Computers and Digital Techniques — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

LSOM (load-balancing self-organising map), a neural network based on Kohonen's self-organising map, is proposed for the problem of mapping finite element method (FEM) grids to distributed memory parallel computers with mesh interconnection networks. The rough global ordering produced by LSOM is combined with the local refinement Kernighan–Lin algorithm (LSOM-KL) to obtain the solution. LSOM-KL achieved a load imbalance of less than 0.1% and a low number of hops, comparable to results obtained with commonly used recursive bisection methods.

References

    1. 1)
      • Simon, H.D.: `Partitioning of unstructured problems for parallel processing', Proceedings of a conference on Parallel methods on largescale structural analysis and physics applications, 1991, p. 98–106.
    2. 2)
      • B. Kernighan , S. Lin . An efficient heuristic procedure for partitioning graphs. Bell Syst. Tech. J. , 291 - 307
    3. 3)
      • Fiduccia, C.M., Mattheyses, R.M.: `A linear time heuristic for improving networkpartitions', Proceedings of 19th IEEE Design automation conference, 1982, p. 53–59.
    4. 4)
      • Hendrickson, B., Leland, R.: `A multilevel algorithm for partitioning graphs', Proceedings of Supercomputing 1995, 1995, p. 205–210.
    5. 5)
      • G.C. Fox , M. Schultz . (1988) A review of automatic load balancing and decomposition methods for thehypercube, Numerical algorithms for modern parallel computerarchitectures.
    6. 6)
      • T. Kohonen . (1995) Self-organizing maps.
    7. 7)
      • Hendrickson, B., Leland, R.: `The chaco user's guide, version 2.0', Technical report, 1995.
    8. 8)
      • D.R. Dersch , P. Tavan . Asymptotic level density in topological feature maps. IEEE Trans. Neural Netw. , 1 , 18 - 22
    9. 9)
      • H.-U. Heiss , M. Dormanns . Partitioning and mapping of parallel programs byself-organization. Concurrency, Pract. Exp. , 9 , 685 - 706
    10. 10)
      • J.W. Quittek . Optimizing parallel program execution by self-organizing maps. J. Artif. Neural Netw. , 365 - 380
    11. 11)
      • DeSieno, D.: `Adding conscience to competitive learning', Proceedings of IEEE international conference onNeural networks 1988 (ICNN 88), 1988, p. 107–112.
    12. 12)
      • S.C. Ahalt , A.K. Krishnamurty , P. Chen , D.E. Melton . Competitive learning algorithms for vector quantization. Neural Netw. , 277 - 290
    13. 13)
      • Wang, Z., Hanson, J.V.: `Competitive learning and winning-weighted competition foroptimal vector quantizer design', Proceedings of IEEE Neural networks for signal processing3 workshop 1993, 1993, p. 503–508.
    14. 14)
      • C.-H. Wu , R.E. Hodges , C.-J. Wang . Parallelizing the self-organizing feature mapon multiprocessor systems. Parallel Comput. , 821 - 832
http://iet.metastore.ingenta.com/content/journals/10.1049/ip-cdt_19981936
Loading

Related content

content/journals/10.1049/ip-cdt_19981936
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
This is a required field
Please enter a valid email address