research-article

On the family of critical section problems

Author:

Hirotsugu KakugawaAuthors Info & Claims

Information Processing Letters, Volume 115, Issue 1

Pages 28 - 32

https://doi.org/10.1016/j.ipl.2014.08.012

Published: 01 January 2015 Publication History

Abstract

A unified framework is proposed for mutual exclusion, mutual inclusion and such what we call critical section problem.Critical section problem is characterized by a pair of integers.The family of critical section problems is closed under complement operation. Mutual exclusion is a fundamental process synchronization problem in concurrent systems. In this paper, we propose a unified framework for mutual exclusion, k-mutual exclusion, mutual inclusion, -mutual inclusion and such, what we call critical section problem. Then, we show that critical section problem is characterized by a pair of integers.

References

[1]

Edgar W. Dijkstra, Solution of a problem in concurrent programming control, Commun. ACM, 8 (September 1965) 569.

Digital Library

Google Scholar

[2]

Rob R. Hoogerwoord, An implementation of mutual inclusion, Inf. Process. Lett., 23 (August 1986) 77-80.

Digital Library

Google Scholar

[3]

Hirotsugu Kakugawa, Mutual inclusion in asynchronous message passing distributed systems, submitted for publication.

Google Scholar

[4]

Hirotsugu Kakugawa, Satoshi Fujita, Masafumi Yamashita, Tadashi Ae, Availability of k-coterie, IEEE Trans. Comput., 42 (1993) 553-558.

Digital Library

Google Scholar

Cited By

View all

Kamei SKakugawa H(2016)An Asynchronous Message-passing Distributed Algorithm for the Generalized Local Critical Section ProblemProceedings of the Fifth International Conference on Network, Communication and Computing10.1145/3033288.3033341(203-207)Online publication date: 17-Dec-2016
https://dl.acm.org/doi/10.1145/3033288.3033341
Kakugawa H(2015)Self-stabilizing distributed algorithm for local mutual inclusionInformation Processing Letters10.1016/j.ipl.2015.01.008115:6(562-569)Online publication date: 1-Jun-2015
https://dl.acm.org/doi/10.1016/j.ipl.2015.01.008

Recommendations

An Asynchronous Message-passing Distributed Algorithm for the Generalized Local Critical Section Problem
ICNCC '16: Proceedings of the Fifth International Conference on Network, Communication and Computing

This paper discusses the generalized local version of critical section problems including mutual exclusion, mutual inclusion, k-mutual exclusion and l-mutual inclusion. When a pair of numbers (li, ki) is given for each process Pi, it is the problem of ...
Word-Size RMR Tradeoffs for Recoverable Mutual Exclusion
PODC '23: Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing

We present tradeoffs between RMR complexity and memory word size for recoverable mutual exclusion (RME) algorithms using arbitrary synchronization primitives. Assuming that each memory location stores w bits, we show that n-process mutual exclusion ...
A mutual exclusion algorithm with optimally bounded bypasses

Peterson's algorithm [G.L. Peterson, Myths about the mutual exclusion problem, Inform. Process. Lett. 12 (3) (1981) 115-116] for mutual exclusion has been widely studied for its elegance and simplicity. In Peterson's algorithm, each process has to cross ...

Comments

Information & Contributors

Information

Published In

Information Processing Letters Volume 115, Issue 1

January 2015

74 pages

ISSN:0020-0190

Issue’s Table of Contents

Publisher

Elsevier North-Holland, Inc.

United States

Publication History

Published: 01 January 2015

Author Tags

Qualifiers

Research-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 15 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Kamei SKakugawa H(2016)An Asynchronous Message-passing Distributed Algorithm for the Generalized Local Critical Section ProblemProceedings of the Fifth International Conference on Network, Communication and Computing10.1145/3033288.3033341(203-207)Online publication date: 17-Dec-2016
https://dl.acm.org/doi/10.1145/3033288.3033341
Kakugawa H(2015)Self-stabilizing distributed algorithm for local mutual inclusionInformation Processing Letters10.1016/j.ipl.2015.01.008115:6(562-569)Online publication date: 1-Jun-2015
https://dl.acm.org/doi/10.1016/j.ipl.2015.01.008

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

References

Cited By

Recommendations

An Asynchronous Message-passing Distributed Algorithm for the Generalized Local Critical Section Problem

Word-Size RMR Tradeoffs for Recoverable Mutual Exclusion

A mutual exclusion algorithm with optimally bounded bypasses

Comments

Information

Published In

Publisher

Publication History

Author Tags

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations