Partially Decentralized Passive Replication Algorithm 


Vol. 12,  No. 6, pp. 507-514, Dec.  2005
10.3745/KIPSTA.2005.12.6.507


PDF
  Abstract

This paper presents a partially decentralized passive replication algorithm for deterministic servers in message-passing distributed systems. The algorithm allows any backup server, not necessarily the primary server, to take responsibility for processing its received client request and coordinating with the other replica servers after obtaining the delivery sequence number of the request from the primary. Thanks to this desirable feature, the algorithm with conventional load balancing techniques can efficiently avoid extreme load conditions on the primary. Therefore, it can provide better scalability of deterministic and replicated server systems than traditional passive replication algorithms. Simulation results indicate that the proposed algorithm can reduce 16.5%~52.3% of the average response time of a client request compared with the traditional ones.

  Statistics
  Cite this article

[IEEE Style]

J. H. Ahn, "Partially Decentralized Passive Replication Algorithm," The KIPS Transactions:PartA, vol. 12, no. 6, pp. 507-514, 2005. DOI: 10.3745/KIPSTA.2005.12.6.507.

[ACM Style]

Jin Ho Ahn. 2005. Partially Decentralized Passive Replication Algorithm. The KIPS Transactions:PartA, 12, 6, (2005), 507-514. DOI: 10.3745/KIPSTA.2005.12.6.507.

Forms

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)

Old Journals

Indexing

All publications of TKIPS is indexed in DOI, EBSCO, Google Scholar, Crossref, and CrossCheck.

TKIPS is also selected as the Journal for Accreditation by NRF (National Research Foundation of Korea).

Related Journals