An efficient algorithm for managing a parallel heap

doi:10.1080/10637199408915469

淡江大學機構典藏 > 工學院 > 資訊工程學系暨研究所 > 期刊論文 > Item 987654321/45406

請使用永久網址來引用或連結此文件: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/45406

題名:	An efficient algorithm for managing a parallel heap
作者:	Das, Sajal K.;洪文斌;Horng, Wen-bing;Moon, Gyo S.
貢獻者:	淡江大學資訊工程學系
關鍵詞:	Data structure;EREW PRAM;heap;parallel algorithm;priority queue;linear speedup
日期:	1994-01-01
上傳時間:	2010-03-26 19:13:29 (UTC+8)
出版者:	Taylor & Francis
摘要:	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].
關聯:	Parallel Algorithms and Applications 4(3-4), pp.281-299
DOI:	10.1080/10637199408915469
顯示於類別:	[資訊工程學系暨研究所] 期刊論文

文件中的檔案:

沒有與此文件相關的檔案.

在機構典藏中所有的資料項目都受到原著作權保護.

TAIR相關文章

資料載入中.....