Author:
Meyer auf der Heide Friedhelm,Pham Hieu Thien
Publisher
Springer Berlin Heidelberg
Reference12 articles.
1. A. Aggarwal. Optimal bounds for finding maximum on array of processors with k global buses. IEEE Trans. on Comp., C-35:62–64, Jan. 1986.
2. S. H. Bokhari. Finding maximum on an array processor with a global bus. IEEE Trans. on Comp., C-33:133–139, Feb. 1984.
3. A. Bar-Noy and D. Peleg. Square meshes are not always optimal. In ACM Symp. on Parallel Algorithms and Architectures, pages 138–147, 1989.
4. S. Cook, C. Dwork, and R. Reischuk. Upper and lower bounds for parallel random access machines without simultaneous writes. SIAM Journal on Comp., 15(1):87–97, 1986.
5. F. Fich, F. Meyer auf der Heide, and A. Wigderson. Lower bounds for parallel random access machines with unbounded shared memory. In F. P. Preparata, editor, Advances in Computing Research, volume 4 of Parallel and Distributed Computing, 1987.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. GOSSIPING IN BUS INTERCONNECTION NETWORKS;Parallel Algorithms and Applications;1996-01
2. Broadcasting in bus interconnection networks;Parallel Processing: CONPAR 94 — VAPP VI;1994