English  |  正體中文  |  简体中文  |  Items with full text/Total items : 55184/89457 (62%)
Visitors : 10662942      Online Users : 17
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    Please use this identifier to cite or link to this item: http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/45406


    Title: An efficient algorithm for managing a parallel heap
    Authors: Das, Sajal K.;洪文斌;Horng, Wen-bing;Moon, Gyo S.
    Contributors: 淡江大學資訊工程學系
    Keywords: Data structure;EREW PRAM;heap;parallel algorithm;priority queue;linear speedup
    Date: 1994-01-01
    Issue Date: 2010-03-26 19:13:29 (UTC+8)
    Publisher: Taylor & Francis
    Abstract: 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].
    Relation: Parallel Algorithms and Applications 4(3-4), pp.281-299
    DOI: 10.1080/10637199408915469
    Appears in Collections:[資訊工程學系暨研究所] 期刊論文

    Files in This Item:

    There are no files associated with this item.

    All items in 機構典藏 are protected by copyright, with all rights reserved.


    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library & TKU Library IR teams. Copyright ©   - Feedback