Article

Solving the at-most-once problem with nearly optimal effectiveness

Authors:

Sotirios Kentros,

Aggelos KiayiasAuthors Info & Claims

ICDCN'12: Proceedings of the 13th international conference on Distributed Computing and Networking

Pages 122 - 137

https://doi.org/10.1007/978-3-642-25959-3_9

Published: 03 January 2012 Publication History

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 <InlineEquation ID="IEq1"><InlineMediaObject><ImageObject FileRef="978-3-642-25959-3_9_Chapter_TeX2GIF_IEq1.gif" Format="GIF" Color="BlackWhite" Type="Linedraw" Rendition="HTML"/></InlineMediaObject> <EquationSource Format="TEX">$m = \mathrm{O}(\sqrt[3+\epsilon]{n/\log n})$</EquationSource> </InlineEquation> 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 <InlineEquation ID="IEq2"><InlineMediaObject><ImageObject FileRef="978-3-642-25959-3_9_Chapter_TeX2GIF_IEq2.gif" Format="GIF" Color="BlackWhite" Type="Linedraw" Rendition="HTML"/></InlineMediaObject> <EquationSource Format="TEX">$m=\mathrm{O}(\sqrt[3+\epsilon]{n/\log n})$</EquationSource> </InlineEquation> .

References

[1]

Anderson, R. J., Woll, H.: Algorithms for the certified write-all problem. SIAM J. Computing 26(5), 1277-1283 (1997)

Digital Library

[2]

Attiya, H., Bar-Noy, A., Dolev, D., Peleg, D., Reischuk, R.: Renaming in an asynchronous environment. J. ACM 37(3), 524-548 (1990)

Digital Library

[3]

Birrell, A. D., Nelson, B. J.: Implementing remote procedure calls. ACM Trans. Comput. Syst. 2(1), 39-59 (1984)

Digital Library

[4]

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)

Digital Library

[5]

Chlebus, B. S., Kowalski, D. R.: Cooperative asynchronous update of shared memory. In: STOC, pp. 733-739 (2005)

Digital Library

[6]

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)

Digital Library

[7]

Fischer, M. J., Lynch, N. A., Paterson, M. S.: Impossibility of distributed consensus with one faulty process. J. ACM 32(2), 374-382 (1985)

Digital Library

[8]

Fitzi, M., Nielsen, J. B., Wolf, S.: How to share a key. In: Allerton Conference on Communication, Control, and Computing (2007)

[9]

Goldman, K. J., Lynch, N. A.: Modelling shared state in a shared action model. In: Logic in Computer Science, pp. 450-463 (1990)

[10]

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)

Digital Library

[11]

Herlihy, M.: Wait-free synchronization. ACM Transactions on Programming Languages and Systems 13, 124-149 (1991)

Digital Library

[12]

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)

Digital Library

[13]

Kanellakis, P.C., Shvartsman, A. A.: Fault-Tolerant Parallel Computaion. Kluwer Academic Publishers (1997)

Digital Library

[14]

Kentros, S., Kiayias, A.: Solving the at-most-once problem with nearly optimal effectiveness. CoRR, abs/1107.2990 (2011)

[15]

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)

Digital Library

[16]

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)

Digital Library

[17]

Lamport, L.: The part-time parliament. ACM Trans. Comput. Syst. 16(2), 133-169 (1998)

Digital Library

[18]

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)

Digital Library

[19]

Lin, K.-J., Gannon, J. D.: Atomic remote procedure call. IEEE Trans. Softw. Eng. 11(10), 1126-1135 (1985)

Digital Library

[20]

Liskov, B.: Distributed programming in argus. Commun. ACM 31(3), 300-312 (1988)

Digital Library

[21]

Liskov, B., Shrira, L., Wroclawski, J.: Efficient at-most-once messages based on synchronized clocks. ACM Trans. Comput. Syst. 9(2), 125-142 (1991)

Digital Library

[22]

Lynch, N., Tuttle, M.: An introduction to input/output automata. In: CWI-Quarterly, pp. 219-246 (1989)

[23]

Lynch, N. A.: Distributed Algorithms. Morgan Kaufmann Publishers (1996)

Digital Library

[24]

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)

Digital Library

[25]

Spector, A. Z.: Performing remote operations efficiently on a local computer network. Commun. ACM 25(4), 246-260 (1982)

Digital Library

[26]

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)

Cited By

Delporte-Gallet CFauconnier HGafni ELosa G(2018)The Assignment ProblemProceedings of the 19th International Conference on Distributed Computing and Networking10.1145/3154273.3154303(1-9)Online publication date: 4-Jan-2018
https://dl.acm.org/doi/10.1145/3154273.3154303
Kentros SKari CKiayias A(2012)The strong at-most-once problemProceedings of the 26th international conference on Distributed Computing10.1007/978-3-642-33651-5_27(386-400)Online publication date: 16-Oct-2012
https://dl.acm.org/doi/10.1007/978-3-642-33651-5_27

Recommendations

A work-optimal deterministic algorithm for the asynchronous certified write-all problem
PODC '03: Proceedings of the twenty-second annual symposium on Principles of distributed computing

In their SIAM J. on Computing paper [27] from 1992, Martel et al. posed a question for developing a work-optimal deterministic asynchronous algorithm for the fundamental load-balancing and synchronization problem called Certified Write-All. In this ...
Solving the at-most-once problem with nearly optimal effectiveness
PODC '11: Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing

We present and analyze a wait-free deterministic algorithm for solving the at-most-once problem: how m fail-prone processes perform asynchronously n tasks at most once using shared memory. Our algorithmic strategy provides for the first time nearly ...
(Nearly) sample-optimal sparse Fourier transform
SODA '14: Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete algorithms

We consider the problem of computing a k-sparse approximation to the discrete Fourier transform of an n-dimensional signal. Our main result is a randomized algorithm that computes such an approximation using O(k log n(log log n)^O(1)) signal samples in ...

Comments

Information & Contributors

Information

Published In

cover image Guide Proceedings

ICDCN'12: Proceedings of the 13th international conference on Distributed Computing and Networking

January 2012

548 pages

ISBN:9783642259586

Editors:
Luciano Bononi
Department of Computer Science, University of Bologna, Mura Anteo Zamboni 7, Bologna, Italy
,
Ajoy K. Datta
School of Computer Science, University of Nevada, Mura Anteo Zamboni 7, Las Vegas, NV, Italy
,
Stéphane Devismes
Laboratoire VERIMAG, Centre Equation, Université Joseph Fourier de Grenoble, 2 Avenue de Vignate, Gières, NV, France
,
Archan Misra
School of Information Systems, Singapore Management University, 80 Stamford Road, Singapore, NV, Singapore

Sponsors

The Hong Kong Polytechnic: The Hong Kong Polytechnic University
K.C. Wong Education Foundation: K.C. Wong Education Foundation

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 03 January 2012

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

2
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 09 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

Delporte-Gallet CFauconnier HGafni ELosa G(2018)The Assignment ProblemProceedings of the 19th International Conference on Distributed Computing and Networking10.1145/3154273.3154303(1-9)Online publication date: 4-Jan-2018
https://dl.acm.org/doi/10.1145/3154273.3154303
Kentros SKari CKiayias A(2012)The strong at-most-once problemProceedings of the 26th international conference on Distributed Computing10.1007/978-3-642-33651-5_27(386-400)Online publication date: 16-Oct-2012
https://dl.acm.org/doi/10.1007/978-3-642-33651-5_27

View Options

View options

Media

Figures

Other

Tables

View Table of Contents