INFORMATION BROADCASTING BY EXCLUSIVE-READ PRAMS-Reference-Cited by-同舟云学术

INFORMATION BROADCASTING BY EXCLUSIVE-READ PRAMS

Published:1994-06 Issue:01n02 Volume:04 Page:159-169
ISSN:0129-6264
Container-title:Parallel Processing Letters
language:en
Short-container-title:Parallel Process. Lett.

Author:

BEAME PAUL¹,KUTYŁOWSKI MIROSŁAW²,KIK MARCIN²

Affiliation:

1. Dept. of Computer Science and Engineering, FR-35 University of Washington, Seattle, Washington 98195, USA

2. Institute of Computer Science, University of Wroclaw, Przesmyckiego 20, PL-51–151 Wroclaw, Poland

Abstract

We consider the problem of copying information stored initially in a single memory cell by Exclusive Read Exclusive Write Parallel Random Access Machines (EREW PRAMs). We prove lower bounds for this problem and present algorithms matching them tightly (in many cases up to an additive constant). The bounds presented depend on the number of cells used and size of information copied. The lower bounds apply also to functions where a change of a single argument influences the output in many memory locations.

Publisher

World Scientific Pub Co Pte Lt

Subject

Hardware and Architecture,Theoretical Computer Science,Software

Link

https://www.worldscientific.com/doi/pdf/10.1142/S012962649400017X

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Gossiping and broadcasting versus computing functions in networks;Discrete Applied Mathematics;2004-03

2. Switching Networks for Generating Random Permutations;Network Theory and Applications;2001

3. The Queue-Read Queue-Write PRAM Model: Accounting for Contention in Parallel Algorithms;SIAM Journal on Computing;1998-01

4. Fast integer merging on the EREW PRAM;Algorithmica;1997-01

5. Gossiping and broadcasting versus computing functions in networks;Lecture Notes in Computer Science;1997