Brief announcement: At-most-once semantics in asynchronous shared memory

Sotirios Kentros, Aggelos Kiayias, Nicolas Nicolaou, Alexander A. Shvartsman

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

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.

Original languageEnglish (US)
Title of host publicationSPAA'09 - Proceedings of the 21st Annual Symposium on Parallelism in Algorithms and Architectures
Pages43-44
Number of pages2
DOIs
StatePublished - 2009
Externally publishedYes
Event21st Annual Symposium on Parallelism in Algorithms and Architectures, SPAA'09 - Calgary, AB, Canada
Duration: Aug 11 2009Aug 13 2009

Publication series

NameAnnual ACM Symposium on Parallelism in Algorithms and Architectures

Conference

Conference21st Annual Symposium on Parallelism in Algorithms and Architectures, SPAA'09
Country/TerritoryCanada
CityCalgary, AB
Period8/11/098/13/09

Keywords

  • At-most-once semantics
  • Shared memory

ASJC Scopus subject areas

  • Software
  • Theoretical Computer Science
  • Hardware and Architecture

Fingerprint

Dive into the research topics of 'Brief announcement: At-most-once semantics in asynchronous shared memory'. Together they form a unique fingerprint.

Cite this