Parallel image processing algorithm for convex exemplar SPP system (Record no. 85462)
[ view plain ]
| 000 -LEADER | |
|---|---|
| fixed length control field | 03296nas|a2200385 i 4500 |
| 005 - DATE AND TIME OF LATEST TRANSACTION | |
| control field | 20260818171218.0 |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION | |
| fixed length control field | 260799s1998 th uzm rtt 00| a1eng d |
| 035 ## - SYSTEM CONTROL NUMBER | |
| System control number | .b11756123 |
| 099 #9 - LOCAL FREE-TEXT CALL NUMBER (OCLC) | |
| Classification number | AIT Thesis no.CS-98-9 |
| 100 1# - MAIN ENTRY--PERSONAL NAME | |
| Personal name | Davaasambuu, Davaajargal |
| 245 10 - TITLE STATEMENT | |
| Title | Parallel image processing algorithm for convex exemplar SPP system |
| 260 ## - PUBLICATION, DISTRIBUTION, ETC. | |
| Place of publication, distribution, etc. | Bangkok : |
| Name of publisher, distributor, etc. | Asian Institute of Technology, |
| Date of publication, distribution, etc. | 1998 |
| 300 ## - PHYSICAL DESCRIPTION | |
| Extent | 50 p. |
| 490 1# - SERIES STATEMENT | |
| Series statement | Thesis ; |
| Volume/sequential designation | no. CS-98-9 |
| 500 ## - GENERAL NOTE | |
| General note | A thesis submitted in partial fulfillment of the requirements for the degree of Master of Engineering, School of Advanced Technologies |
| 502 ## - DISSERTATION NOTE | |
| Dissertation note | Thesis (M.Eng.) - Asian Institute of Technology, 1998 |
| 520 ## - SUMMARY, ETC. | |
| Summary, etc. | Parallel 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 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name entry element | Parallel processing (Electronic computers) |
| 700 1# - ADDED ENTRY--PERSONAL NAME | |
| Personal name | Yulu Qi, |
| Relator term | Chairperson |
| 700 1# - ADDED ENTRY--PERSONAL NAME | |
| Personal name | Batanov, Dentcho N., |
| Relator term | Examination Committee |
| 700 1# - ADDED ENTRY--PERSONAL NAME | |
| Personal name | Zhang, Jianguo, |
| Relator term | Examination committee |
| 710 2# - ADDED ENTRY--CORPORATE NAME | |
| Corporate name or jurisdiction name as entry element | Japan - Asian Development Bank, |
| Relator term | Scholarship donor |
| 810 2# - SERIES ADDED ENTRY--CORPORATE NAME | |
| Corporate name or jurisdiction name as entry element | Asian Institute of Technology. |
| Title of a work | Thesis ; |
| Volume/sequential designation | no. CS-98-9 |
| 856 ## - ELECTRONIC LOCATION AND ACCESS | |
| Materials specified | Full-Text |
| Uniform Resource Identifier | <a href="http://203.159.5.9/ait-thesis/detail.php?q=B13251">http://203.159.5.9/ait-thesis/detail.php?q=B13251</a> |
| 907 ## - LOCAL DATA ELEMENT G, LDG (RLIN) | |
| a | .b11756123 |
| b | mnait |
| c | y |
| 902 ## - LOCAL DATA ELEMENT B, LDB (RLIN) | |
| a | 240418 |
| 998 ## - LOCAL CONTROL INFORMATION (RLIN) | |
| Operator's initials, OID (RLIN) | 0 |
| Cataloger's initials, CIN (RLIN) | 990726 |
| First date, FD (RLIN) | m |
| -- | a |
| -- | y |
| -- | 0 |
| 945 ## - LOCAL PROCESSING INFORMATION (OCLC) | |
| l | mnait |
| 945 ## - LOCAL PROCESSING INFORMATION (OCLC) | |
| l | mnarc |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) | |
| Koha item type | 22-AIT Thesis (Replacement) |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) | |
| Koha item type | 40-Archives |
| 909 ## - LOCAL ITEMS USED | |
| Barcode | Barcode : 30050120686414 |
| CREATED | CREATED : 2014-12-02 |
| RECORD Id | RECORD # : i12763731 |
| LPATRON | LPATRON : 0 |
| LCHKIN | LCHKIN : - |
| RENEWALS | # RENEWALS : 0 |
| -- | # OVERDUE : 0 |
| -- | IUSE3 : 0 |
| -- | TOT CHKOUT : 0 |
| -- | TOT RENEW : 0 |
| 909 ## - LOCAL ITEMS USED | |
| Barcode | Barcode : 30050120355333 |
| CREATED | CREATED : 2016-06-15 |
| RECORD Id | RECORD # : i13037857 |
| LPATRON | LPATRON : 0 |
| LCHKIN | LCHKIN : - |
| RENEWALS | # RENEWALS : 0 |
| -- | # OVERDUE : 0 |
| -- | IUSE3 : 0 |
| -- | TOT CHKOUT : 0 |
| -- | TOT RENEW : 0 |
| Withdrawn status | Lost status | Damaged status | Not for loan | Home library | Current library | Shelving location | Date acquired | Cost, normal purchase price | Total checkouts | Full call number | Barcode | Date last seen | Copy number | Price effective from | Koha item type |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| Available for Loans | Asian Institute of Technology Library | Asian Institute of Technology Library | AIT Publications | 18/08/2026 | 50.00 | AIT Thesis no.CS-98-9 | 30050120686414 | 18/08/2026 | 3 | 18/08/2026 | 22-AIT Thesis (Replacement) | ||||
| Available for Loans | Asian Institute of Technology Library | Asian Institute of Technology Library | Archives | 18/08/2026 | AIT Thesis no.CS-98-9 | 30050120355333 | 18/08/2026 | 18/08/2026 | 40-Archives |

AI Search