• DocumentCode
    2503347
  • Title

    Parallel multiple search

  • Author

    Wen, Zhaofang

  • Author_Institution
    Dept. of Comput Sci., Old Dominion Univ., Norfolk, VA, USA
  • fYear
    1991
  • fDate
    30 Apr-2 May 1991
  • Firstpage
    114
  • Lastpage
    119
  • Abstract
    Two sequences of items sorted in increasing order are given: a sequence A of size n and a sequence B of size m. It is required to determine, for every item of A, the smallest item of B (if one exists) that is larger than it. The paper presents two parallel algorithms for the problem. The first algorithm requires O(logm+logn) time using n processors on an EREW PRAM. On an EREW PRAM with p (p⩽min{m, n}) processors, the second algorithm runs in O(logn+p/n) time when m⩽n, or in O(logm+p/n logn/2m) time when m>n. The second algorithm is optimal
  • Keywords
    computational complexity; parallel algorithms; search problems; EREW PRAM; parallel algorithms; parallel multiple search; Computational modeling; Computer science; Concurrent computing; Databases; Information retrieval; Merging; Office automation; Parallel algorithms; Phase change random access memory; Search problems;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Parallel Processing Symposium, 1991. Proceedings., Fifth International
  • Conference_Location
    Anaheim, CA
  • Print_ISBN
    0-8186-9167-0
  • Type

    conf

  • DOI
    10.1109/IPPS.1991.153765
  • Filename
    153765
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2503347