Hagit Attiya
Amotz Bar-Noy
- 1.K. Abrahamson, On Achieving Consensus Using a Shared Memory, Proc. 7th A CM Syrup. on Principles of Dis~. Computing, pp. 291-302, 1988. Google Scholar
Digital Library
- 2.Y. Afek, H. Attiya, D. Dolev, E. Gafni, M. Merritt and N. Shavit, Atomic Snapshots of Shared Memory, to appear, Proc. 9th A CM Syrup. on Principles of Distr. Computing, 1990. Google ScholarDigital Library
- 3.Y. Afek, B. Awerbuch and E. Gafni, Applying Static Network Protocols to Dynamic Networks, Proc. 28th IEEE Syrup. on Foundations of Comp. Science, pp. 358-369, 1987.Google ScholarDigital Library
- 4.Y. Afek, D. Dolev, E. Gafni, M. Merritt and N. Shavit, A Bounded First-In First- Enabled-Solution to the t-Exclusion Problem, manuscript.Google Scholar
- 5.Y. Afek and E. Gafni, End-to-End Communication in Unreliable Networks, Proc. 7th ACM Syrup. on Principles of Dist. Computing, pp. 131-147, 1983. Google ScholarDigital Library
- 6.Y. Afek and E. Gafni, Bootstrap Network Re~ynchronization: An Efficient Technique for End-to- End Communication, manuscript.Google Scholar
- 7.J. I-I. Anderson, Composite Registers, to appear in Proc. 9th A CM Syrup. on Principles of Distr. Computing, 1990. Google ScholarDigital Library
- 8.J. Aspnes and M. tterlihy, Fast Randomized Consensus Using Shared Memory, Journal of Algorithms, September 1990, to appear. Google ScholarDigital Library
- 9.J. Aspnes and M. P. Herlihy, Wait-Free Data Structures in the Asynchronous PRAM model, to appear in Proc. 2rid A CM Symp. on Parallel Algorithms and Architectures, July 1990, Crete, Greece. Google ScholarDigital Library
- 10.H. Attiya, A. B~-Noy, D. Dolev, D. Koller, D. Peleg and R. Reischulc, Achievable Cases in an Asynchronous Environment, Proc. 28th IEEE Syrup. on Foundations of Comp. Science, pp. 337-346, 1987.Google ScholarDigital Library
- 11.It. Attiya, D. Dolev and N. Shavit, Bounded Polynomial Randomized Consensus, Proc. 8th A CM Syrup. on Principles of Dist. Computing, pp. 281-293, 1989. Google ScholarDigital Library
- 12.B. Awerbuch, Optimal Distributed Algorithms for Minimum Weight Spanning Tree, Counting, Leader Election and Related Problems, Proc. 19th A CM Syrup. on Theory of Computing, pp. 230-240, 1987. Google ScholarDigital Library
- 13.B. Awerbuch, Y. Mansour and N. Shavit, Polynomial End-To-End Communication, Proc. 30th IEEE Syrup. on Foundations of Comp. Science, pp. 358-363, 1989.Google ScholarDigital Library
- 14.A. Bar~Noy and D. Dolev, Shared-Memory vs. Message-Passing in an Asynchronous Distributed Environment, Proc. 8th ACM Syrup. on Principles of Dist. Computing, pp. 307-318, 1989. Google ScholarDigital Library
- 15.M. Ben-Or, Another Advantage of Free Choice: Completely Asynchronous Agreement Protocols, Proc. 2nd ACM Syrup. on Principles of Dist. Computing, pp. 27-30, 1983. Google ScholarDigital Library
- 16.J. E. Burns and G. L. Peterson, The Ambiguity of Choosing, Proc. 8th A CM Syrup. on Principles of Dist. Computing, pp. 145-157, 1989. Google ScholarDigital Library
- 17.B. Chor, A. Israeli and M. Li, On Processor Coordination Using Asynchronous Hardware, Proc. 6th ACM Syrup. on Principles of Dist. Computing, pp. 86-97, 1987. Google ScholarDigital Library
- 18.B. Chor, M. Merritt and D. Shmoys, Simple Constant-Time Consensus Protocols in P~ealistic Failure Models, Proc. 4th ACM Syrup. on Principles of Dist. Computing, pp. 152-160, 1985. Google ScholarDigital Library
- 19.B. Chor and L. Moscovici, Solvability in Asynchronous Environments, Proc. 30th IEEE Syrup. on Foundations of Comp. Science, pp. 422-427, 1989.Google ScholarDigital Library
- 20.E. W. Dijkstra and C. S. Scholten, Termination Detection for Diffusing Computations, Information Processing Letters, Vol. 1, No. 1, pp. 1-4, August 1980.Google Scholar
- 21.D. Dolev, E. Gafni and N. Shavit, Toward a Non- Atomic Era: &Exclusion as a Test Case, Proc. 20th A CM Syrup. on Theory of Computation, pp. 78-92, 1988. Google ScholarDigital Library
- 22.D. Dolev and N. Shavit, unpublished manuscript, July 1987. Appears in {13}.Google Scholar
- 23.D. Dolev and N. Shavit, Bounded Concurrent Time-Stamp Systems are Constructible, Proc. 21st ACM Syrup. on Theory of Computing, pp. 454-466, 1989. Google ScholarDigital Library
- 24.C. Dwork, D. Shmoys and L. Stockmeyer, Flipping Persuasively in Constant Expected Time, Proc. 27th IEEE Syrup. on Foundations of Computer Science, pp. 222-232, 1986.Google ScholarDigital Library
- 25.P. Feldman, private communication.Google Scholar
- 26.J.A. Feldman and A. Nigam, A Model and Proof Technique for Message-Based Systems, SIAM J. on Computing, Vol. 9, No. 4 (November 1980), pp. 768-784.Google Scholar
- 27.S. G. Finn, Resynch Procedures and a Fail-Safe Network Protocol, IEEE Trans. Comm., COM- 27 pp. 840-845, 1979.Google ScholarCross Ref
- 28.M. :i. Fischer, N. A. Lynch and M.S. Paterson, Impossibility of Distributed Consensus with one Faulty Processor, Journal of the A CM, Vol. 32, pp. 374-382, 1985. Google ScholarDigital Library
- 29.M.P. Herlihy, Impossibility and Universality Resuits for Wait-Free Synchronization, in Proc. 7~h A CM Symposium on Principles of Distributed Computing, pages 276-290, August 1988. Google ScholarDigital Library
- 30.A. Israeli and M. Li, Bounded Time-stamps, Proc. 28~h IEEE Syrup. on Foundations of Comp. Science, pp. 371-382, 1987.Google Scholar
- 31.L. Lamport, On Interproeess Communication, Part I and iI, Distributed Computing, Vol. 1, No. 2, pp. 77-101, 1986.Google ScholarCross Ref
- 32.M. Li, J. Tromp and P. Vitanyi, How to Share Concurrent Wait-Free Variables, Report CS- R8916, CWI, Amsterdam, April 1989. Earlier version in proc. 16th In~erna~ionM Col. on Automata, Languages ~md Programming, Lecture Notes in Computer Science #372, pp. 488-505, 1989. Google ScholarDigital Library
- 33.G. L. Peterson and James E. Burns, Concurrent Beading While Writing II: The Multi-writer Case, Proc. 28th IEEE Syrup. on Foundations of Comp. Science, pp. 383-392, 1987.Google Scholar
- 34.U. Vishkin, A Distributed Orientation Algorithm, IEEE Trans. on Information Theory, June 1983.Google Scholar
- 35.P. Vitanyi and B. Awerbuch, Atomic Shared Register Access by Asynchronous Hardware, Proc. 27th IEEE Syrup. on Foundations of Comp. Science, pp. 233-243, 1986.Google ScholarDigital Library
Index Terms
- Sharing memory robustly in message-passing systems
Recommendations
Shared Memory vs. Message Passing: The COMOPS Benchmark Experiment
This paper presents the comparison of the COMOPS benchmark performance in MPI and shared memory on four different shared memory platforms: the DEC AlphaServer 8400/300, the SGI Power Challenge, the SGI Origin2000, and the HP-Convex Exemplar SPP1600. The ...
Performance of hybrid message-passing and shared-memory parallelism for discrete element modeling
SC '00: Proceedings of the 2000 ACM/IEEE conference on SupercomputingThe current trend in HPC hardware is towards clusters of shared-memory (SMP) compute nodes. For applications developers the major question is how best to program these SMP clusters. To address this we study an algorithm from Discrete Element Modeling, ...
Shared Memory vs. Message Passing: the COMOPS Benchmark Experiment
HICSS '98: Proceedings of the Thirty-First Annual Hawaii International Conference on System Sciences-Volume 7 - Volume 7This paper presents the comparison of the COMOPS benchmark performance in MPI and shared memory on three different shared memory platforms: the DEC AlphaServer8400/300, the SGI PowerChallenge, and the HP-Convex Exemplar SPP1600. The paper also ...
Comments