返回Google圖書搜尋

Parallel Binary Search with Delayed Read Conflicts

出版	Queen's University of Kingston. Department of Computing and Information Science, 1989
URL	http://books.google.com.hk/books?id=wPyXHAAACAAJ&hl=&source=gbs_api

註釋Abstract: "Given two sorted arrays, A (of size n) and B (of size m) where n [less than or equal to] m, it is required to determine for every element A, its position within B.A parallel algorithm is presented to solve this problem on the exclusive-read exclusive-write parallel random access machine (EREW PRAM). The algorithm uses p processors and runs in [formula] time. When [formula] and [formula], with 0