Boosting locality in multi-version partial data replication

João A. Silva; João M. Lourenço; Hervé Paulino

doi:10.1145/2695664.2695851

Boosting locality in multi-version partial data replication

João A. Silva, João M. Lourenço, Hervé Paulino

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

2 Citations (Scopus)

Abstract

Partial data replication protocols for transactional distributed systems present a high scalability potential, but suffer from a shortcoming of the utmost importance: data access locality. In a partial data replication setting, performance can be boosted by serving transactional read operations locally and preventing the expensive overhead of inter-node communication. In this paper we address this concern by proposing a generic caching mechanism directed towards multi-version partial data replication protocols and illustrate its application in a specific protocol, namely SCORe. Experimental results corroborate the effectiveness of the proposed caching mechanism in read-dominated workloads, where it clearly improves the system's overall throughput. Copyright is held by the owner/author(s).

Original language	English
Title of host publication	2015 Symposium on Applied Computing, SAC 2015
Publisher	ACM - Association for Computing Machinery
Pages	1309-1314
Number of pages	6
ISBN (Electronic)	9781450331968
DOIs	https://doi.org/10.1145/2695664.2695851
Publication status	Published - 13 Apr 2015
Event	30th Annual ACM Symposium on Applied Computing, SAC 2015 - Salamanca, Spain Duration: 13 Apr 2015 → 17 Apr 2015

Conference

Conference	30th Annual ACM Symposium on Applied Computing, SAC 2015
Country/Territory	Spain
City	Salamanca
Period	13/04/15 → 17/04/15

Keywords

Cache
Concurrency control
Distributed systems
Multi-version
Partial data replication

Access to Document

10.1145/2695664.2695851

Cite this

@inproceedings{abb702d51d1748c5b56b47daa5fa9724,

title = "Boosting locality in multi-version partial data replication",

abstract = "Partial data replication protocols for transactional distributed systems present a high scalability potential, but suffer from a shortcoming of the utmost importance: data access locality. In a partial data replication setting, performance can be boosted by serving transactional read operations locally and preventing the expensive overhead of inter-node communication. In this paper we address this concern by proposing a generic caching mechanism directed towards multi-version partial data replication protocols and illustrate its application in a specific protocol, namely SCORe. Experimental results corroborate the effectiveness of the proposed caching mechanism in read-dominated workloads, where it clearly improves the system's overall throughput. Copyright is held by the owner/author(s).",

keywords = "Cache, Concurrency control, Distributed systems, Multi-version, Partial data replication",

author = "Silva, \{Jo{\~a}o A.\} and Louren{\c c}o, \{Jo{\~a}o M.\} and Herv{\'e} Paulino",

year = "2015",

month = apr,

day = "13",

doi = "10.1145/2695664.2695851",

language = "English",

pages = "1309--1314",

booktitle = "2015 Symposium on Applied Computing, SAC 2015",

publisher = "ACM - Association for Computing Machinery",

address = "United States",

note = "30th Annual ACM Symposium on Applied Computing, SAC 2015 ; Conference date: 13-04-2015 Through 17-04-2015",

}

TY - GEN

T1 - Boosting locality in multi-version partial data replication

AU - Silva, João A.

AU - Lourenço, João M.

AU - Paulino, Hervé

PY - 2015/4/13

Y1 - 2015/4/13

N2 - Partial data replication protocols for transactional distributed systems present a high scalability potential, but suffer from a shortcoming of the utmost importance: data access locality. In a partial data replication setting, performance can be boosted by serving transactional read operations locally and preventing the expensive overhead of inter-node communication. In this paper we address this concern by proposing a generic caching mechanism directed towards multi-version partial data replication protocols and illustrate its application in a specific protocol, namely SCORe. Experimental results corroborate the effectiveness of the proposed caching mechanism in read-dominated workloads, where it clearly improves the system's overall throughput. Copyright is held by the owner/author(s).

AB - Partial data replication protocols for transactional distributed systems present a high scalability potential, but suffer from a shortcoming of the utmost importance: data access locality. In a partial data replication setting, performance can be boosted by serving transactional read operations locally and preventing the expensive overhead of inter-node communication. In this paper we address this concern by proposing a generic caching mechanism directed towards multi-version partial data replication protocols and illustrate its application in a specific protocol, namely SCORe. Experimental results corroborate the effectiveness of the proposed caching mechanism in read-dominated workloads, where it clearly improves the system's overall throughput. Copyright is held by the owner/author(s).

KW - Cache

KW - Concurrency control

KW - Distributed systems

KW - Multi-version

KW - Partial data replication

UR - https://www.scopus.com/pages/publications/84955516521

UR - https://apps.webofknowledge.com/full_record.do?product=WOS&search_mode=GeneralSearch&qid=8&SID=T1GCErLrt7UvYiwBkKL&page=1&doc=3

U2 - 10.1145/2695664.2695851

DO - 10.1145/2695664.2695851

M3 - Conference contribution

AN - SCOPUS:84955516521

SP - 1309

EP - 1314

BT - 2015 Symposium on Applied Computing, SAC 2015

PB - ACM - Association for Computing Machinery

T2 - 30th Annual ACM Symposium on Applied Computing, SAC 2015

Y2 - 13 April 2015 through 17 April 2015

ER -

Boosting locality in multi-version partial data replication

Abstract

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this