Abstract
We present and analyze a wait-free deterministic algorithm for solving the at-most-once problem: how m shared-memory fail-prone processes perform asynchronously n tasks at most once. Our algorithmic strategy provides for the first time nearly optimal effectiveness, which is a measure that expresses the total number of tasks completed in the worst case. The effectiveness of our algorithm equals n − 2m + 2. This is up to an additive factor of m close to the known effectiveness upper bound n − m + 1 over all possible algorithms and improves on the previously best known deterministic solutions that have effectiveness only n − logm ·o(n). We also present an iterated version of our algorithm that for any \(m = \mathrm{O}(\sqrt[3+\epsilon]{n/\log n})\) is both effectiveness-optimal and work-optimal, for any constant ε > 0. We then employ this algorithm to provide a new algorithmic solution for the Write-All problem which is work optimal for any \(m=\mathrm{O}(\sqrt[3+\epsilon]{n/\log n})\).
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
Anderson, R.J., Woll, H.: Algorithms for the certified write-all problem. SIAM J. Computing 26(5), 1277–1283 (1997)
Attiya, H., Bar-Noy, A., Dolev, D., Peleg, D., Reischuk, R.: Renaming in an asynchronous environment. J. ACM 37(3), 524–548 (1990)
Birrell, A.D., Nelson, B.J.: Implementing remote procedure calls. ACM Trans. Comput. Syst. 2(1), 39–59 (1984)
Chaudhuri, S., Coan, B.A., Welch, J.L.: Using adaptive timeouts to achieve at-most-once message delivery. Distrib. Comput. 9(3), 109–117 (1995)
Chlebus, B.S., Kowalski, D.R.: Cooperative asynchronous update of shared memory. In: STOC, pp. 733–739 (2005)
Di Crescenzo, G., Kiayias, A.: Asynchronous Perfectly Secure Communication Over One-Time Pads. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 216–227. Springer, Heidelberg (2005)
Fischer, M.J., Lynch, N.A., Paterson, M.S.: Impossibility of distributed consensus with one faulty process. J. ACM 32(2), 374–382 (1985)
Fitzi, M., Nielsen, J.B., Wolf, S.: How to share a key. In: Allerton Conference on Communication, Control, and Computing (2007)
Goldman, K.J., Lynch, N.A.: Modelling shared state in a shared action model. In: Logic in Computer Science, pp. 450–463 (1990)
Groote, J., Hesselink, W., Mauw, S., Vermeulen, R.: An algorithm for the asynchronous write-all problem based on process collision. Distributed Computing 14(2), 75–81 (2001)
Herlihy, M.: Wait-free synchronization. ACM Transactions on Programming Languages and Systems 13, 124–149 (1991)
Hillel, K.C.: Multi-sided shared coins and randomized set-agreement. In: Proc. of the 22nd ACM Symp. on Parallel Algorithms and Architectures (SPAA 2010), pp. 60–68 (2010)
Kanellakis, P.C., Shvartsman, A.A.: Fault-Tolerant Parallel Computaion. Kluwer Academic Publishers (1997)
Kentros, S., Kiayias, A.: Solving the at-most-once problem with nearly optimal effectiveness. CoRR, abs/1107.2990 (2011)
Kentros, S., Kiayias, A., Nicolaou, N., Shvartsman, A.A.: At-Most-Once Semantics in Asynchronous Shared Memory. In: Keidar, I. (ed.) DISC 2009. LNCS, vol. 5805, pp. 258–273. Springer, Heidelberg (2009)
Kowalski, D.R., Shvartsman, A.A.: Writing-all deterministically and optimally using a nontrivial number of asynchronous processors. ACM Transactions on Algorithms 4(3) (2008)
Lamport, L.: The part-time parliament. ACM Trans. Comput. Syst. 16(2), 133–169 (1998)
Lampson, B.W., Lynch, N.A., Sogaard-Andersen, J.F.: Correctness of at-most-once message delivery protocols. In: Proc. of the IFIP TC6/WG6.1 6th International Conference on Formal Description Techniques (FORTE 1993), pp. 385–400. North-Holland Publishing Co. (1994)
Lin, K.-J., Gannon, J.D.: Atomic remote procedure call. IEEE Trans. Softw. Eng. 11(10), 1126–1135 (1985)
Liskov, B.: Distributed programming in argus. Commun. ACM 31(3), 300–312 (1988)
Liskov, B., Shrira, L., Wroclawski, J.: Efficient at-most-once messages based on synchronized clocks. ACM Trans. Comput. Syst. 9(2), 125–142 (1991)
Lynch, N., Tuttle, M.: An introduction to input/output automata. In: CWI-Quarterly, pp. 219–246 (1989)
Lynch, N.A.: Distributed Algorithms. Morgan Kaufmann Publishers (1996)
Malewicz, G.: A work-optimal deterministic algorithm for the certified write-all problem with a nontrivial number of asynchronous processors. SIAM J. Comput. 34(4), 993–1024 (2005)
Spector, A.Z.: Performing remote operations efficiently on a local computer network. Commun. ACM 25(4), 246–260 (1982)
Watson, R.W.: The delta-t transport protocol: Features and experience. In: Proc. of the 14th Conf. on Local Computer Networks, pp. 399–407 (1989)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kentros, S., Kiayias, A. (2012). Solving the At-Most-Once Problem with Nearly Optimal Effectiveness. In: Bononi, L., Datta, A.K., Devismes, S., Misra, A. (eds) Distributed Computing and Networking. ICDCN 2012. Lecture Notes in Computer Science, vol 7129. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25959-3_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-25959-3_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-25958-6
Online ISBN: 978-3-642-25959-3
eBook Packages: Computer ScienceComputer Science (R0)