Time-space optimal parallel set operations

Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications Pub Date : 1990-03-07 DOI:10.1109/PARBSE.1990.77137

Xiaojun Guan, M. A. Langston

引用次数: 1

Abstract

The authors present parallel algorithms for the elementary binary set operations that, given an EREW PRAM (exclusive-read, exclusive-write parallel random-access memory) with k processors, operate on two sorted lists of total length n in O(n/k+log n) time and O(k) extra space, and are thus time-space optimal for any fixed value of k>

查看原文本刊更多论文

时空最优并行集运算

本文给出了具有k个处理器的EREW PRAM(独占读、独占写并行随机存取存储器)在O(n/k+log n)时间和O(k)额外空间内对两个总长度为n的排序表进行运算的基本二值集并行算法，并且对于k>的任何固定值都是时空最优的。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications

自引率

0.00%

发文量