Efficient simulations between concurrent-read concurrent-write pram models-Reference-Cited by-同舟云学术

Efficient simulations between concurrent-read concurrent-write pram models

Published: Issue: Volume: Page:231-239
ISSN:
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Chlebus B. S.,Diks K.,Hagerup T.,Radzik T.

Publisher

Springer-Verlag

Link

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

Reference10 articles.

1. F.E. Fich, F. Meyer auf der Heide, and A. Wigderson, Lower bounds for parallel random-access machines with unbounded shared memory, Advances in Computing Research, 1986.

2. F.E. Fich, P.L. Ragde, and A. Wigderson, Relations between concurrent-write models of parallel computation, in Proceedings, 3rd Annual ACM Symposium on Principles of Distributed Computing, 1984, pp. 179–189 (to appear in SIAM J. Computing)

3. F.E. Fich, P.L. Ragde, and A. Wigderson, Simulations among concurrent-write PRAMs, manuscript, 1986, to appear in Algorithmica.

4. S. Fortune, and J. Wyllie, Parallelism in random access machines, in Proceedings, 10th Annual ACM Symposium on Theory of Computing, San Diego, Calif., 1978, pp. 114–118.

5. L. Goldschlager, A universal interconnection pattern for parallel computers, J. ACM 29 (1982), 1073–1086.

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

1. Partially effective randomization in simulations between ARBITRARY and COMMON PRAMs;Journal of Parallel and Distributed Computing;2004-03

2. Efficient PRAM simulation on a distributed memory machine;Algorithmica;1996-10

3. Simulations between different models of parallel computers;Fundamentals of Computation Theory;1993

4. Leaders election without conflict resolution rule;LATIN '92;1992

5. Methods for realizing a priority bus system;Systems and Computers in Japan;1992