Scholars Central

Review articlePublished 2014

Quorum generation algorithm based on distance repeat times limitation

Authors: Li Meian, Wang Fang, Wang Wei

Ask about this article

Abstract

Select any words in the title or abstract, or press this and choose a sentence.

A new symmetric quorum generation algorithm has been proposed in this paper to solve the problem that how to generate a symmetric quorum with the shortest length but has a smaller time complexity so that it can generate a symmetric quorum when the distributed system has a larger scale. The concept of permission total repeat expression times proposed firstly in this paper to limit the attempt times when a node inserted in the quorum. Selecting the nodes in the backup vector to insert the quorum can reduce the attempt times again. Comparing the attempt times with other quorum generation algorithms, the algorithm proposed in this paper will reduce the time complexity 10% at least and the quorum length is still the shortest as Maekawa.

Ask about this article

Answers come only from this article's title, abstract and keywords, each sentence pointing to where it comes from. Your question is sent to OpenAI to write the answer. Scholars Central does not store it.

Try:

Similar by topic

More from this journal

The newest in BioTechnology: An Indian Journal.

All its articles

Conferences in this field

Upcoming conferences in this field.

Follow

New articles from what you follow go into your email digest, once you agree to alert emails.

  • JournalBioTechnology: An Indian Journal
  • SubjectBiochemistry & Biotechnology
  • BylineArticles whose byline prints “Li Meian”
  • BylineArticles whose byline prints “Wang Fang”
  • BylineArticles whose byline prints “Wang Wei”

For authors and organisers

Publish, present and keep up with your field

Find the right journal for your paper and submit your manuscript.

Photo: Pexels