Representing shared data on distributed-memory parallel computers-Reference-Cited by-同舟云学术

Representing shared data on distributed-memory parallel computers

Published:1996-04 Issue:2 Volume:29 Page:111-156
ISSN:0025-5661
Container-title:Mathematical Systems Theory
language:en
Short-container-title:Math. Systems Theory

Author:

Herley K. T.

Publisher

Springer Science and Business Media LLC

Subject

Computational Theory and Mathematics,General Mathematics,Theoretical Computer Science,Computational Theory and Mathematics,Theoretical Computer Science

Link

http://link.springer.com/content/pdf/10.1007/BF01305311.pdf

Reference27 articles.

1. H. Alt, T. Hagerup, K. Mehlhorn, and F. P. Preparata. Deterministic simulation of idealized parallel computers on more realistic ones.SIAM Journal on Computing, 16(5):808–835, November 1987.

2. M. Ajtai, J. Komlós, and E. Szemerédi. AnO(n logn) sorting network.Proceedings of the 15thAnnual Symposium on the Theory of Computing, Boston, Massachusetts, pages 1–9, April 1983. See alsoCombinatorica 3(1):1–19, 1983.

3. G. Baudet and D. Stevenson. Optimal sorting algorithms for parallel computers.IEEE Transactions on Computers, 27(1):84–87, January 1978.

4. M. L. Fredman, J. Komlós, and E. Szemerédi. Storing a sparse table withO(1) worst case access time.Journal of the ACM, 31(3):538–544, July 1984.

5. T. Hagerup. A lower bound for the emulation of PRAM memories on processor networks. Technical Report 13/1990, Fachbereich 14, Informatik, Universität des Saarlandes, June 1990.

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

1. A GENERAL PRAM SIMULATION SCHEME FOR CLUSTERED MACHINES;International Journal of Foundations of Computer Science;2003-12

2. Implementing Shared Memory on Mesh-Connected Computers and on the Fat-Tree;Information and Computation;2001-03

3. DETERMINISTIC BRANCH-AND-BOUND ON DISTRIBUTED MEMORY MACHINES;International Journal of Foundations of Computer Science;1999-12

4. Deterministic branch-and-bound on distributed memory machines;Lecture Notes in Computer Science;1999

5. The complexity of deterministic PRAM simulation on distributed memory machines;Theory of Computing Systems;1997-06