Parallel processing of the kohonen's self-organizing algorithm on multiprocessor system다중 컴퓨터 시스템에서 코호넨의 자율조직 알고리즘의 병렬처리

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 353
  • Download : 0
In parallel processing of the Kohonen``s self-organizing algorithm, the only bottleneck is to determine the "global winning cell" after finding the "local winning cell" in the processors. According to the communication topologies to determine the global winning cell, two parallel algorithms are shown in a multiprocessor computer implemented on common bus. The efficiency of the processor utilization is above 97\% when we employ 800 neurons for 2-D coordinates mapping of Kohonen``s algorithm using 8 processors.
Advisors
Park, Kyu-Horesearcher박규호researcher
Description
한국과학기술원 : 전기 및 전자공학과,
Publisher
한국과학기술원
Issue Date
1990
Identifier
67397/325007 / 000881103
Language
eng
Description

학위논문(석사) - 한국과학기술원 : 전기 및 전자공학과, 1990.8, [ iii, 63 p. ]

URI
http://hdl.handle.net/10203/37960
Link
http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=67397&flag=dissertation
Appears in Collection
EE-Theses_Master(석사논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0