| 000 | 03296nas|a2200385 i 4500 | ||
|---|---|---|---|
| 005 | 20260818171218.0 | ||
| 008 | 260799s1998 th uzm rtt 00| a1eng d | ||
| 035 | _a.b11756123 | ||
| 099 | 9 | _aAIT Thesis no.CS-98-9 | |
| 100 | 1 | _aDavaasambuu, Davaajargal | |
| 245 | 1 | 0 | _aParallel image processing algorithm for convex exemplar SPP system |
| 260 |
_aBangkok : _bAsian Institute of Technology, _c1998 |
||
| 300 | _a50 p. | ||
| 490 | 1 |
_aThesis ; _vno. CS-98-9 |
|
| 500 | _aA thesis submitted in partial fulfillment of the requirements for the degree of Master of Engineering, School of Advanced Technologies | ||
| 502 | _aThesis (M.Eng.) - Asian Institute of Technology, 1998 | ||
| 520 | _aParallel Processing has an advantage over traditional supercomputers in price I performance I speed and it comprises algorithms, computer architecture, programming tools, and performance analysis. The objective of this study is to propose an efficient parallel algorithm for image matching computation on the Convex Exemplar SPP System. Three new parallel algorithms are proposed which are the improvement on each other and implemented in Convex MPICH message-passing environment. The most efficient proposed parallel algorithm is called the Parallel Help-Load Balancing Improved Algorithm and the reasons for the efficiency are computational power of the system, reduced communication in the parallel algorithm, the processors help each other, and proportional amount of data is distributed during the load balancing process. To evaluate the performance of the new efficient parallel algorithm, this study discusses the normalized performances of the proposed load balancing strategies, how system workload affects the performance of parallel algorithm, and compares the performances between the proposed efficient parallel algorithm and shared memory parallel algorithm. Results of study are categorized in the following order. First, this study presents the efficient parallel algorithm for image matching computation on Convex Exemplar in Convex MPICH. Second, results indicate that the Parallel Help-Load Balancing Improved Algorithm is the most efficient when the program is computation intensive. Finally, it is determined that the efficiency depends on system workload and its balancing. | ||
| 650 | 0 | _aParallel processing (Electronic computers) | |
| 700 | 1 |
_aYulu Qi, _eChairperson |
|
| 700 | 1 |
_aBatanov, Dentcho N., _eExamination Committee |
|
| 700 | 1 |
_aZhang, Jianguo, _eExamination committee |
|
| 710 | 2 |
_aJapan - Asian Development Bank, _eScholarship donor |
|
| 810 | 2 |
_aAsian Institute of Technology. _tThesis ; _vno. CS-98-9 |
|
| 856 |
_3Full-Text _uhttp://203.159.5.9/ait-thesis/detail.php?q=B13251 |
||
| 907 |
_a.b11756123 _bmnait _cy |
||
| 902 | _a240418 | ||
| 998 |
_b0 _c990726 _dm _ea _fy _g0 |
||
| 945 | _lmnait | ||
| 945 | _lmnarc | ||
| 942 | _c22 | ||
| 942 | _c40 | ||
| 909 |
_aBarcode : 30050120686414 _bCREATED : 2014-12-02 _cRECORD # : i12763731 _dLPATRON : 0 _eLCHKIN : - _f# RENEWALS : 0 _g# OVERDUE : 0 _hIUSE3 : 0 _iTOT CHKOUT : 0 _jTOT RENEW : 0 |
||
| 909 |
_aBarcode : 30050120355333 _bCREATED : 2016-06-15 _cRECORD # : i13037857 _dLPATRON : 0 _eLCHKIN : - _f# RENEWALS : 0 _g# OVERDUE : 0 _hIUSE3 : 0 _iTOT CHKOUT : 0 _jTOT RENEW : 0 |
||
| 999 |
_c85462 _d85462 |
||