期刊論文
| 學年 | 82 |
|---|---|
| 學期 | 1 |
| 出版（發表）日期 | 1994-01-01 |
| 作品名稱 | An efficient algorithm for managing a parallel heap |
| 作品名稱（其他語言） | |
| 著者 | Das, Sajal K.; 洪文斌; Horng, Wen-bing; Moon, Gyo S. |
| 單位 | 淡江大學資訊工程學系 |
| 出版者 | Taylor & Francis |
| 著錄名稱、卷期、頁數 | Parallel Algorithms and Applications 4(3-4), pp.281-299 |
| 摘要 | We design a cost-optimal algorithm for managing a parallel heap on an exclusive-read exclusive-write (EREW), parallel random access machine (PRAM) model. We also analyze the time and space complexities of our algorithm, which efficiently employs p processors in the range 1 ≤ p ≤ n, where n is the maximum number of items in the parallel heap. It is assumed that a delete-think-insert cycle is repeatedly performed, and each processor requires an arbitrary but the same amount of time (called the think time) for processing an item which in turn generates at most two new items. The use of a global data structure for each level of the heap helps reduce the working memory space required. The time complexity for deleting p items of the highest priority from the parallel heap is O(logp), while that for inserting at most 2p new items is O(logn). With or without incorporating the think time, the speedup of our algorithm is shown to be linear, i.e. O(p). Hence this algorithm is an improvement in time over the one proposed by Deo and Prasad [5, 6]. |
| 關鍵字 | Data structure;EREW PRAM;heap;parallel algorithm;priority queue;linear speedup |
| 語言 | en |
| ISSN | 1744-5760 |
| 期刊性質 | 國內 |
| 收錄於 | |
| 產學合作 | |
| 通訊作者 | |
| 審稿制度 | 否 |
| 國別 | TWN |
| 公開徵稿 | |
| 出版型式 | ,電子版 |
| 相關連結 |
機構典藏連結 ( http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/45406 ) |