TY - GEN
T1 - Brief announcement
T2 - 21st Annual Symposium on Parallelism in Algorithms and Architectures, SPAA'09
AU - Kentros, Sotirios
AU - Kiayias, Aggelos
AU - Nicolaou, Nicolas
AU - Shvartsman, Alexander A.
N1 - DBLP License: DBLP's bibliographic metadata records provided through http://dblp.org/ are distributed under a Creative Commons CC0 1.0 Universal Public Domain Dedication. Although the bibliographic metadata records are provided consistent with CC0 1.0 Dedication, the content described by the metadata records is not. Content may be subject to copyright, rights of privacy, rights of publicity and other restrictions.
PY - 2009
Y1 - 2009
N2 - This paper investigates the feasibility of implementing atmost-once access semantics in a model where a collection of actions is to be performed by failure-prone, asynchronous shared-memory processes. We introduce the At-Most-Once problem for performing a set of n jobs using m processors, and we define the notion of efficiency for such protocols, called effectiveness, that allows the classification of algorithms solving the problem. The effectiveness for an at-most-once implementation is the number of jobs safely completed by the implementation, expressed as a function of the number of jobs n, the number of processes m, and the number of process crashes f. We prove a lower bound of n - f on the effectiveness of any algorithm. We then present two process solutions that offer a trade off between work and space complexity. Finally, we generalize a two-process solution for the multi-process setting using a hierarchical algorithm that achieves effectiveness of n - log m · o(n), coming reasonably close, asymptotically, to the corresponding lower bound.
AB - This paper investigates the feasibility of implementing atmost-once access semantics in a model where a collection of actions is to be performed by failure-prone, asynchronous shared-memory processes. We introduce the At-Most-Once problem for performing a set of n jobs using m processors, and we define the notion of efficiency for such protocols, called effectiveness, that allows the classification of algorithms solving the problem. The effectiveness for an at-most-once implementation is the number of jobs safely completed by the implementation, expressed as a function of the number of jobs n, the number of processes m, and the number of process crashes f. We prove a lower bound of n - f on the effectiveness of any algorithm. We then present two process solutions that offer a trade off between work and space complexity. Finally, we generalize a two-process solution for the multi-process setting using a hierarchical algorithm that achieves effectiveness of n - log m · o(n), coming reasonably close, asymptotically, to the corresponding lower bound.
KW - At-most-once semantics
KW - Shared memory
UR - http://www.scopus.com/inward/record.url?scp=70449631682&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=70449631682&partnerID=8YFLogxK
U2 - 10.1145/1583991.1584003
DO - 10.1145/1583991.1584003
M3 - Conference contribution
AN - SCOPUS:70449631682
SN - 9781605586069
T3 - Annual ACM Symposium on Parallelism in Algorithms and Architectures
SP - 43
EP - 44
BT - SPAA'09 - Proceedings of the 21st Annual Symposium on Parallelism in Algorithms and Architectures
Y2 - 11 August 2009 through 13 August 2009
ER -