Partially decentralized passive replication protocol for deterministic servers

JinHo Ahn, Sung-Gi Min, ChongSun Hwang

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

In this paper, we present a partially decentralized passive replication protocol designed for deterministic servers in message passing systems. This protocol allows each backup to take responsibility for processing its received client request and coordinating with the other replica servers after obtaining the delivery order of the request from the primary. Due to this feature, the protocol with conventional load balancing techniques can avoid extreme load conditions on the primary. Therefore, the protocol promises better scalability at the expense of more complex recovery procedure compared with traditional protocols. The simulation results indicate that the average response time of a client request can be reduced up to 52.3% by using the proposed protocol instead of the traditional ones.

Original languageEnglish
Title of host publicationProceedings of the International Conference on Parallel Processing Workshops
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages290-297
Number of pages8
Volume2002-January
ISBN (Print)0769516807
DOIs
Publication statusPublished - 2002
EventInternational Conference on Parallel Processing Workshops, ICPPW 2002 - Vancouver, Canada
Duration: 2002 Aug 182002 Aug 21

Other

OtherInternational Conference on Parallel Processing Workshops, ICPPW 2002
CountryCanada
CityVancouver
Period02/8/1802/8/21

Fingerprint

Decentralized
Replication
Servers
Server
Network protocols
Message passing
Message Passing
Replica
Load Balancing
Response Time
Resource allocation
Scalability
Extremes
Computer systems
Recovery
Processing
Simulation

ASJC Scopus subject areas

  • Software
  • Mathematics(all)
  • Hardware and Architecture

Cite this

Ahn, J., Min, S-G., & Hwang, C. (2002). Partially decentralized passive replication protocol for deterministic servers. In Proceedings of the International Conference on Parallel Processing Workshops (Vol. 2002-January, pp. 290-297). [1039743] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ICPPW.2002.1039743

Partially decentralized passive replication protocol for deterministic servers. / Ahn, JinHo; Min, Sung-Gi; Hwang, ChongSun.

Proceedings of the International Conference on Parallel Processing Workshops. Vol. 2002-January Institute of Electrical and Electronics Engineers Inc., 2002. p. 290-297 1039743.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Ahn, J, Min, S-G & Hwang, C 2002, Partially decentralized passive replication protocol for deterministic servers. in Proceedings of the International Conference on Parallel Processing Workshops. vol. 2002-January, 1039743, Institute of Electrical and Electronics Engineers Inc., pp. 290-297, International Conference on Parallel Processing Workshops, ICPPW 2002, Vancouver, Canada, 02/8/18. https://doi.org/10.1109/ICPPW.2002.1039743
Ahn J, Min S-G, Hwang C. Partially decentralized passive replication protocol for deterministic servers. In Proceedings of the International Conference on Parallel Processing Workshops. Vol. 2002-January. Institute of Electrical and Electronics Engineers Inc. 2002. p. 290-297. 1039743 https://doi.org/10.1109/ICPPW.2002.1039743
Ahn, JinHo ; Min, Sung-Gi ; Hwang, ChongSun. / Partially decentralized passive replication protocol for deterministic servers. Proceedings of the International Conference on Parallel Processing Workshops. Vol. 2002-January Institute of Electrical and Electronics Engineers Inc., 2002. pp. 290-297
@inproceedings{dceb901e069f4dc990b24e8d32b2ba17,
title = "Partially decentralized passive replication protocol for deterministic servers",
abstract = "In this paper, we present a partially decentralized passive replication protocol designed for deterministic servers in message passing systems. This protocol allows each backup to take responsibility for processing its received client request and coordinating with the other replica servers after obtaining the delivery order of the request from the primary. Due to this feature, the protocol with conventional load balancing techniques can avoid extreme load conditions on the primary. Therefore, the protocol promises better scalability at the expense of more complex recovery procedure compared with traditional protocols. The simulation results indicate that the average response time of a client request can be reduced up to 52.3{\%} by using the proposed protocol instead of the traditional ones.",
author = "JinHo Ahn and Sung-Gi Min and ChongSun Hwang",
year = "2002",
doi = "10.1109/ICPPW.2002.1039743",
language = "English",
isbn = "0769516807",
volume = "2002-January",
pages = "290--297",
booktitle = "Proceedings of the International Conference on Parallel Processing Workshops",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - GEN

T1 - Partially decentralized passive replication protocol for deterministic servers

AU - Ahn, JinHo

AU - Min, Sung-Gi

AU - Hwang, ChongSun

PY - 2002

Y1 - 2002

N2 - In this paper, we present a partially decentralized passive replication protocol designed for deterministic servers in message passing systems. This protocol allows each backup to take responsibility for processing its received client request and coordinating with the other replica servers after obtaining the delivery order of the request from the primary. Due to this feature, the protocol with conventional load balancing techniques can avoid extreme load conditions on the primary. Therefore, the protocol promises better scalability at the expense of more complex recovery procedure compared with traditional protocols. The simulation results indicate that the average response time of a client request can be reduced up to 52.3% by using the proposed protocol instead of the traditional ones.

AB - In this paper, we present a partially decentralized passive replication protocol designed for deterministic servers in message passing systems. This protocol allows each backup to take responsibility for processing its received client request and coordinating with the other replica servers after obtaining the delivery order of the request from the primary. Due to this feature, the protocol with conventional load balancing techniques can avoid extreme load conditions on the primary. Therefore, the protocol promises better scalability at the expense of more complex recovery procedure compared with traditional protocols. The simulation results indicate that the average response time of a client request can be reduced up to 52.3% by using the proposed protocol instead of the traditional ones.

UR - http://www.scopus.com/inward/record.url?scp=84954474052&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84954474052&partnerID=8YFLogxK

U2 - 10.1109/ICPPW.2002.1039743

DO - 10.1109/ICPPW.2002.1039743

M3 - Conference contribution

AN - SCOPUS:84954474052

SN - 0769516807

VL - 2002-January

SP - 290

EP - 297

BT - Proceedings of the International Conference on Parallel Processing Workshops

PB - Institute of Electrical and Electronics Engineers Inc.

ER -