Abstract
An adaptive algorithm, whose step complexity adjusts to the number of active processes, is attractive for distributed systems with a highly-variable number of processes. The cornerstone of many adaptive algorithms is an adaptive mechanism to collect up-to-date information from all participating processes. To date, all known collect algorithms either have non-linear step complexity or they are impractical because of unrealistic memory overhead.
This paper presents new randomized collect algorithms with asymptotically optimal O(k) step complexity and polynomial memory overhead only. In addition we present a new deterministic collect algorithm which beats the best step complexity for previous polynomial-memory algorithms.
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
Preview
Unable to display preview. Download preview PDF.
References
Afek, Y., Merritt, M.: Fast, wait-free (2k - 1)-renaming. In: Proceedings of the 18th Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 105–112 (1999)
Afek, Y., Strupp, G., Touitou, D.: Long-lived Adaptive Collect with Applications. In: Proceedings of the 40th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 262–272. IEEE Computer Society Press, Los Alamitos (1999)
Afek, Y., Strupp, G., Touitou, D.: Long-lived and adaptive splitters and applications, vol. 15, pp. 444–468 (2002)
Afek, Y., Stupp, G., Touitou, D.: Long-lived and adaptive atomic snap-shot and immediate snapshot. In: Proceedings of the 19th Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 71–80 (2000)
Anderson, J., Kim, Y.-J., Herman, T.: Shared-memory mutual exclusion: Major research trends since 1986. Distributed Computing 16, 75–110 (2003)
Attiya, H., Bortnikov, V.: Adaptive and efficient mutual exclusion. Distributed Computing 15(3), 177–189 (2002)
Attiya, H., Fouren, A.: Algorithms Adaptive to Point Contention. Journal of the ACM (JACM) 50(4), 444–468 (2003)
Attiya, H., Fouren, A., Gafni, E.: An adaptive collect algorithm with applications. Distributed Computing 15(2), 87–96 (2002)
Guerraoui, R.: Indulgent algorithms. In: Proceedings of the 19th Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 289–297 (2000)
Guerraoui, R., Raynal, M.: A generic framework for indulgent consensus. In: Proceedings of the 23rd International Conference on Distributed Computing Systems (ICDCS), pp. 88–95 (2003)
Herlihy, M.: Wait-free synchronization. ACM Transactions on Programming Languages and Systems 13(1), 124–149 (1991)
Jayanti, P., Tan, K., Toueg, S.: Time and space lower bounds for nonblocking implementations. SIAM Journal on Computing 30(2), 438–456 (2000)
Kim, Y.-J., Anderson, J.: A time complexity bound for adaptive mutual exclusion. In: Welch, J.L. (ed.) DISC 2001. LNCS, vol. 2180, pp. 1–15. Springer, Heidelberg (2001)
Moir, M., Anderson, J.H.: Wait-free algorithms for fast, long-lived renaming. Science of Computer Programming 25(1), 1–39 (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Attiya, H., Kuhn, F., Wattenhofer, M., Wattenhofer, R. (2004). Efficient Adaptive Collect Using Randomization. In: Guerraoui, R. (eds) Distributed Computing. DISC 2004. Lecture Notes in Computer Science, vol 3274. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30186-8_12
Download citation
DOI: https://doi.org/10.1007/978-3-540-30186-8_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23306-0
Online ISBN: 978-3-540-30186-8
eBook Packages: Springer Book Archive