2006•Unpublished venueRequires access

Research of mutual exclusion algorithm in distribution systems

Zeng Jiang-ming

Open publisher page 0 citations

Abstract

It′s very important to use a fair and easy implementation distributed mutual exclusion algorithm to ensure the data,1ogic and time consistency of a distributed system,and mutual exclusion is a very important issue in the distribution systems.The mutual exclusion problem(mutex) means how to solve the clash problem that one processes request to enter a critical section at the same time.Mutual exclusion between courses in distributed system are expatiated detailedly in this paper.Some kinds of algorithms are discussed and their characters are also analyzed,and finally this article gives K-mutual exclusion algorithm,and at the same time introduces satisfied condition and how to implement k-mutual exclusion algorithm.

About this research paper

What this paper is about

It′s very important to use a fair and easy implementation distributed mutual exclusion algorithm to ensure the data,1ogic and time consistency of a distributed system,and mutual exclusion is a very important issue in the distribution systems.The mutual exclusion problem(mutex) means how to solve the clash problem that one processes request to enter a critical section at the same time.Mutual exclusion between courses in distributed system are expatiated detailedly in this paper.Some kinds of algorithms are discussed and their characters are also analyzed,and finally this article gives K-mutual exclusion algorithm,and at the same time introduces satisfied condition and how to implement k-mutual exclusion algorithm.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

It′s very important to use a fair and easy implementation distributed mutual exclusion algorithm to ensure the data,1ogic and time consistency of a distributed system,and mutual exclusion is a very important issue in the distribution systems.The mutual exclusion problem(mutex) means how to solve the clash problem that one processes request to enter a critical section at the same time.Mutual exclusion between courses in distributed system are expatiated detailedly in this paper.Some kinds of algorithms are discussed and their characters are also analyzed,and finally this article gives K-mutual exclusion algorithm,and at the same time introduces satisfied condition and how to implement k-mutual exclusion algorithm.

Key concepts: Mutual exclusion, Semaphore, Critical section, Suzuki-Kasami algorithm, Mutual information, Computer science, Consistency (knowledge bases), Algorithm

Related papers

Back to paper searchBrowse research topicsOriginal source
Research of mutual exclusion algorithm in distribution systems — Research Paper | ScholarLens