Next Article in Journal
A Spatial-Temporal-Semantic Neural Network Algorithm for Location Prediction on Moving Objects
Next Article in Special Issue
A Flexible Pattern-Matching Algorithm for Network Intrusion Detection Systems Using Multi-Core Processors
Previous Article in Journal / Special Issue
DNA Paired Fragment Assembly Using Graph Theory
Article Menu

Export Article

Open AccessArticle
Algorithms 2017, 10(2), 38; doi:10.3390/a10020038

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

1
Graduate School of Engineering, Hiroshima University, 1-4-1 Kagamiyama, Higashi-Hiroshima,Hiroshima, 739-8527, Japan
2
Graduate School of Information Science and Technology, Osaka University, 1-4, Yamadaoka, Suita, Osaka,565-0871, Japan
*
Author to whom correspondence should be addressed.
Received: 27 January 2017 / Revised: 14 March 2017 / Accepted: 22 March 2017 / Published: 24 March 2017
(This article belongs to the Special Issue Networks, Communication, and Computing)
View Full-Text   |   Download PDF [265 KB, uploaded 27 March 2017]

Abstract

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 controlling the system in such a way that the number of processes that can execute their critical sections at a time is at least li and at most ki among its neighboring processes and Pi itself. We propose the first solution for the generalized local (li, |Ni| + 1)-critical section problem (i.e., the generalized local li-mutual inclusion problem). Additionally, we show the relationship between the generalized local (li, ki)-critical section problem and the generalized local (|Ni| + 1 − ki, |Ni| + 1 − li)-critical section problem. Finally, we propose the first solution for the generalized local (li, ki)-critical section problem for arbitrary (li, ki), where 0 ≤ li < ki + |Ni| + 1 for each process Pi. View Full-Text
Keywords: critical section; mutual exclusion; mutual inclusion critical section; mutual exclusion; mutual inclusion
This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. (CC BY 4.0).

Scifeed alert for new publications

Never miss any articles matching your research from any publisher
  • Get alerts for new papers matching your research
  • Find out the new papers from selected authors
  • Updated daily for 49'000+ journals and 6000+ publishers
  • Define your Scifeed now

SciFeed Share & Cite This Article

MDPI and ACS Style

Kamei, S.; Kakugawa, H. An Asynchronous Message-Passing Distributed Algorithm for the Generalized Local Critical Section Problem. Algorithms 2017, 10, 38.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Algorithms EISSN 1999-4893 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top