Billiard quorums on the grid

Divyakant Agrawal, Ömer Eǧecioǧlu, Amr El Abbadi

Research output: Contribution to journalArticle

13 Citations (Scopus)

Abstract

Maekawa considered a simple but suboptimal grid based quorum generation scheme in which N sites in a network are logically organized in the form of a √N × √N grid, and the quorum sets are row-column pairs. Even though the quorum size 2√N of the grid scheme is twice as large as finite projective plane based optimal size quorums, it has the advantage of being simple and geometrically evident. In this paper we construct grid based quorums which use a modified grid, and paths that resemble billiard ball paths instead of horizontal and vertical line segments of rows and columns in the grid scheme. The size of these quorums is √2√N. The construction and its properties are geometrically evident as in the case of Maekawa's grid, and the quorum sets can be generated efficiently.

Original languageEnglish
Pages (from-to)9-16
Number of pages8
JournalInformation Processing Letters
Volume64
Issue number1
Publication statusPublished - 14 Oct 1997
Externally publishedYes

    Fingerprint

Keywords

  • Coterie
  • Distributed system
  • Mutual exclusion
  • Quorum

ASJC Scopus subject areas

  • Computational Theory and Mathematics

Cite this

Agrawal, D., Eǧecioǧlu, Ö., & El Abbadi, A. (1997). Billiard quorums on the grid. Information Processing Letters, 64(1), 9-16.