Possibility and impossibility results in a shared memory environment

Acta Informatica

Volumn 33, Issue 1, 1996, Pages 1-20

  Taubenfeld, Gadi ^a   Moran, Shlomo ^b  

^a LUCENT TECHNOLOGIES   (United States)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0030533711     PISSN: 00015903     EISSN: None     Source Type: Journal    
DOI: 10.1007/s002360050034     Document Type: Article

References (22)

1. Attiya, H., Bar-Noy, A., Dolev, D., Koller, D., Peleg, D., Reischuk, R.: Achievable cases in an asynchronous environment. In Proc. 28th IEEE Symp. on Foundations of Computer Science, pp 337-346 (1987)
2. Abrahamson, K.: On achieving consensus using shared memory. In Proc. 7th ACM Symp. on Principles of Distributed Computing, pp 291-302 (1988)
3. Bar-Yehuda, R., Kutten, S., Wolfstahl, Y., Zaks, S., Making distributed spanning tree algorithms fault-resilient. In Proc. 4th Annual Symposium on Theoretical Aspects of Computer Science; Lecture Notes in Computer Science 247, pp. 222-231 (1987)
4. Biran, O., Moran, S., Zaks, S.: A combinatorial characterization of the distributed tasks which are solvable in the presence of one faulty processor. In Proc. 7th ACM Symp. on Principles of Distributed Computing, pp 263-275 (1988)
5. Bridgland, M., Watro, R.: Fault-tolerant decision making in totally asynchronous distributed systems. In Proc 6th ACM Symp. on Principles of Distributed Computing, pp 52-63 (1987)
6. Chor, B., Israeli, A., Li, M.: On processor coordination using asynchronous hardware. In Proc. 6th ACM Symp. on Principles of Distributed Computing, pp 86-97 (1987)
7. Chandy, M., Misra, J.: On the nonexistence of robust commit protocols. Manuscript, November 1985.
8. Chandy, M., and Misra, J., How processes learn. J. Distributed Computing 1, 40-52 (1986)
9. Chor, B., Moscovici, L.: Solvability in asynchronous environments. In Proc. 30th IEEE Symp. on Foundations of Computer Science, pp 422-427 (1989)
10. Dolev, D., Dwork, C., Stockmeyer, L.: On the minimal synchronism needed for distributed consensus. J. ACM 34(1) 77-97 (1987)
11. Dwork, C., Lynch, N., Stockmeyer, L.: Consensus in the presence of partial synchrony. J. ACM 35(2), 288-323 (1988)
12. Ebbinghaus, H., Flum, J., Thomas, W.: Mathematical Logic Berlin: Springer 1984
13. Fischer, M. J., Lynch, N. A., Paterson, M. S.: Impossibility of distributed consensus with one faulty process. J. ACM 32(2) 374-382 (1985)
14. Hadzilacos, V.: A knowledge theoretic analysis of atomic commitment protocols. In Proc. 6th ACM Symp. on Principles of Database Systems, pp 129-134 (1987)
15. Herlihy, P. M.: Impossibility and universality results for wait-free synchronization. In Proc. 7th ACM Symp. on Principles of Distributed Computing, pp 276-290 (1988)
16. Loui, C. M., Abu-Amara, H.: Memory requirements for agreement among unreliable asynchronous processes. Advances in Computing Research, 4: 163-183 (1988)
17. Moran S., Wolfsthal, Y.: An extended impossibility result for asynchronous complete networks. Inform. Process. Lett. 26: 141-151 (1987)
18. Taubenfeld, G.: Impossibility results for decision protocols. Technical Report 445, Technion, January 1987. Revised version appeared as Technion TR-# 506, April 1988.
19. Taubenfeld, G.: Leader election in the presence of n - 1 initial failures. Informa. Process. Lett. 33, 25-28 (1989)
20. Taubenfeld G., Katz, S., Moran, S.: Impossibility results in the presence of multiple faulty processes. Inforn. Comput. 113(2), 173-198 (1994) Also in: LNCS 405 (eds.: C. E. Veni Madhavan), Springer Verlag 1989, pp 109-120
21. Taubenfeld G., Katz, S., Moran, S.: Impossibility results in the presence of multiple faulty processes. Inforn. Comput. 113(2), 173-198 (1994) Also in: LNCS 405 (eds.: C. E. Veni Madhavan), Springer Verlag 1989, pp 109-120
22. Taubenfeld, G., Katz, S., Moran, S.: Initial failures in distributed computations. Int. J. Parallel Programming 18, 255-276 (1989)