Parallel multiple search

Parallel multiple search

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 algor...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
1. Verfasser: Zhaofang Wen
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Computational modeling
Computer science
Concurrent computing
Information retrieval
Merging
Office automation
Parallel algorithms
Phase change random access memory
Search problems
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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
DOI:10.1109/IPPS.1991.153765