On the signaling problem

Gal Amram

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

3 Scopus citations


Aguilera et al. introduced and solved the mailbox problem in [4], and used their mailbox algorithm to provide an efficient solution to the N-buffer problem. In the same paper, they also pointed out that both the mailbox problem and the N-buffer problem are solved by means of a more general problem: the signaling problem. The authors of [4] presented a non-blocking solution to the signaling problem, and asked whether a wait-free solution to the signaling problem exists. In our paper, we provide a positive answer to this question by introducing a bounded wait-free signaling algorithm and proving its correctness. In addition, our algorithm is more efficient than the one presented in [4] since it uses flags of smaller size. Furthermore, by using our algorithm, we provide a wait-free solution to the N-buffer problem which is more efficient than the one in [4].

Original languageEnglish
Title of host publicationDistributed Computing and Networking - 15th International Conference, ICDCN 2014, Proceedings
Number of pages22
StatePublished - 3 Feb 2014
Event15th International Conference on Distributed Computing and Networking, ICDCN 2014 - Coimbatore, India
Duration: 4 Jan 20147 Jan 2014

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume8314 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference15th International Conference on Distributed Computing and Networking, ICDCN 2014


  • distributed algorithms
  • linearizability
  • shared memory
  • synchronization

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'On the signaling problem'. Together they form a unique fingerprint.

Cite this