Abstract
After presenting a personal view of distributed computing (of course, being personal, this view is partial and questionable), this invited talk will address distributed computing problems that have recently received attention in the literature. For each of them, the talk presents the problem, results from the community, results from the author (and his co-authors), and questions that remain open. The following are among the topics covered in the talk.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Chaudhuri, S., Herlihy, M., Lynch, N., Tuttle, M.: Tight Bounds for k-Set Agreement. Journal of the ACM 47(5), 912–943 (2000)
Gafni, E.: Read-Write Reductions. In: Chaudhuri, S., Das, S.R., Paul, H.S., Tirthapura, S. (eds.) ICDCN 2006. LNCS, vol. 4308, pp. 349–354. Springer, Heidelberg (2006)
Gafni, E., Guerraoui, R., Pochon, B.: From a Static Impossibility to an Adaptive Lower Bound: The Complexity of Early Deciding Set Agreement. In: STOC 2005. Proc. 37th ACM Symposium on Theory of Computing, pp. 714–722. ACM Press, New York (2005)
Gafni, E., Raynal, M., Travers, C.: Test&Set, Adaptive Renaming and Set Agreement: a Guided Visit to Asynchronous Computability. In: SRDS 2007. Proc. 26th IEEE Symposium on Reliable Distributed Systems, IEEE Computer Society Press, Beijing (China) (2007), ftp://ftp.irisa.fr/techreports/2007/PI-1837.pdf
Guerraoui, R., Kapałka, M., Kouznetsov, P.: The Weakest Failure Detectors to Boost Obstruction-Freedom. In: Dolev, S. (ed.) DISC 2006. LNCS, vol. 4167, pp. 376–390. Springer, Heidelberg (2006)
Herlihy, M.P.: Wait-Free Synchronization. ACM Transactions on Programming Languages and Systems 13(1), 124–149 (1991)
Herlihy, M., Luchangco, V., Moir, M.: Obstruction-free synchronization: double-ended queues as an example. In: CDCS 2003. Proc. 23rd IEEE Int’l Conference on Distributed Computing Systems I(CDCS ’03), pp. 522–529. IEEE Computer Society Press, Los Alamitos (2003)
Mostefaoui, A., Raynal, M., Travers, C.: Narrowing Power vs Efficiency in Synchronous Set Agreement. Tech Report # 1836, IRISA, Université de Rennes (France) (2007), ftp://ftp.irisa.fr/techreports/2007/PI-1836.pdf
Raynal, M., Taubenfeld, G.: The Notion of a Timed Register and its Application to Indulgent Synchronization. In: SPAA 2007. 19th ACM Symposium on Parallel Algorithms and Architectures, pp. 200–207. ACM Press, New York (2007)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Raynal, M. (2007). A Subjective Visit to Selected Topics in Distributed Computing. In: Pelc, A. (eds) Distributed Computing. DISC 2007. Lecture Notes in Computer Science, vol 4731. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75142-7_3
Download citation
DOI: https://doi.org/10.1007/978-3-540-75142-7_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-75141-0
Online ISBN: 978-3-540-75142-7
eBook Packages: Computer ScienceComputer Science (R0)