A BRIDGING MODEL FOR PARALLEL COMPUTATION

被引:1921
作者
VALIANT, LG
机构
[1] Aiken Computation Laboratory, Harvard University, Cambridge
关键词
Bulksynchronous; Design; parallel model;
D O I
10.1145/79173.79181
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
The success of the von Neumann model of sequential computation is attributable to the fact that it is an efficient bridge between software and hardware: high-level languages can be efficiently compiled on to this model; yet it can be effeciently implemented in hardware. The author argues that an analogous bridge between software and hardware in required for parallel computation if that is to become as widely used. This article introduces the bulk-synchronous parallel 1990 model as a candidate for this role, and gives results quantifying its efficiency both in implementing high-level language features and algorithms, as well as in being implemented in hardware. © 1990, ACM. All rights reserved.
引用
收藏
页码:103 / 111
页数:9
相关论文
共 30 条
[1]  
AGGARWAL A, IN PRESS THEOR COMPU
[2]  
AIELLO B, 1990, UNPUB FAST ALGORITHM
[3]  
ANDERSON RJ, 1988, CRI8814 U SO CAL COM
[4]   ROUTING, MERGING, AND SORTING ON PARALLEL MODELS OF COMPUTATION [J].
BORODIN, A ;
HOPCROFT, JE .
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1985, 30 (01) :130-145
[5]  
CARTER L, 1979, J CSS, V18, P143, DOI DOI 10.1016/0022-0000(79)90044-8
[6]   PARALLEL ALGORITHMIC TECHNIQUES FOR COMBINATORIAL COMPUTATION [J].
EPPSTEIN, D ;
GALIL, Z .
ANNUAL REVIEW OF COMPUTER SCIENCE, 1988, 3 :233-283
[7]  
GIBBONS PB, 1989, 1989 P ACM S PAR ALG, P158
[8]  
GOTTLIEB A, 1983, IEEE T COMPUT, V32, P175, DOI 10.1109/TC.1983.1676201
[10]   PARALLEL HASHING - AN EFFICIENT IMPLEMENTATION OF SHARED MEMORY [J].
KARLIN, AR ;
UPFAL, E .
JOURNAL OF THE ACM, 1988, 35 (04) :876-892