ANALYSIS OF AN ASYNCHRONOUS PRAM ALGORITHM

被引：0

作者：

RAGDE, P

机构：

[1] Department of Computer Science, University of Waterloo, Waterloo

来源：

INFORMATION PROCESSING LETTERS | 1991年 / 39卷 / 05期

关键词：

COMPUTATIONAL COMPLEXITY; PARALLEL ALGORITHMS; COMPOSITION OF ASSOCIATIVE FUNCTIONS; ASYNCHRONOUS PRAM;

D O I：

10.1016/0020-0190(91)90024-C

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

We consider the asynchronous PRAM model of Martel, Park. and Subramoniam and show that the computation of the n-way composition of any associative function requires expected work O(n log* n) with n/log n processors.

引用

页码：253 / 256

页数：4