Abstract
We present a new long-lived, efficient, adaptive collect algorithm. Namely, our algorithm adapts to \(\mathcal{K}\)-contention – it has the property that if during an operation the interval contention k exceeds a predetermined constant \(\mathcal{K}\) the step complexity is O(N). If, it falls below \(\mathcal{K}\), the processors executions will eventually have adaptive step complexity of O(k 3). Moreover, for \(\mathcal{K}\) such that \(\mathcal{K}^3 \leq N\) our algorithm requires only O(N 2) shared memory registers.
An extended abstract of this paper appears in the Proceedings of the DPNA 2005 (IEEE-ICPADS 2005) workshop.
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
Afek, Y., Stupp, G., Touitou, D.: Long-lived adaptive collect with applications. In: Proc. of the 40th Ann. Symp. on Foundations of Computer Science, October 1999, pp. 262–272 (1999)
Attiya, H., Fouren, A.: Algorithms adaptive to point contention. J. ACM 50(4), 444–468 (2003)
Attiya, H., Fouren, A., Gafni, E.: An adaptive collect algorithm with applications. Distributed Computing 15(2), 87–96 (2002)
Attiya, H., Kuhn, F., Wattenhofer, M., Wattenhofer, R.: Efficient Adaptive Collect using Randomization. In: Guerraoui, R. (ed.) DISC 2004. LNCS, vol. 3274, pp. 159–173. Springer, Heidelberg (2004)
Lamport, L.: A fast mutual exclusion algorithm. ACM Transactions on Computer Systems 5(1), 1–11 (1987)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Englert, B. (2005). An Efficient Long-Lived Adaptive Collect Algorithm. In: Fraigniaud, P. (eds) Distributed Computing. DISC 2005. Lecture Notes in Computer Science, vol 3724. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11561927_48
Download citation
DOI: https://doi.org/10.1007/11561927_48
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29163-3
Online ISBN: 978-3-540-32075-3
eBook Packages: Computer ScienceComputer Science (R0)