his.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Virtual Full Replication by Adaptive Segmentation
University of Skövde, School of Humanities and Informatics. University of Skövde, The Informatics Research Centre.
University of Skövde, School of Humanities and Informatics. University of Skövde, The Informatics Research Centre.
University of Virginia.
2007 (English)In: 13th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA 2007), IEEE Computer Society, 2007, 327-337 p.Conference paper, (Refereed)
Abstract [en]

We propose virtual full replication by adaptive segmentation (ViFuR-A), and evaluate its ability to maintain scalability in a replicated real-time database. With full replication and eventual consistency, transaction timeliness becomes independent of network delays for all transactions. However, full replication does not scale well, since all updates must be replicated to all nodes, also when data is needed only at a subset of the nodes. With virtual full replication that adapts to actual data needs, resource usage can be bounded and the database can be made scalable. We propose a scheme for adaptive segmentation that detects new data needs and adapts replication. The scheme includes an architecture, a scalable protocol and a replicated directory service that together maintains scalability. We show that adaptive segmentation bounds the required storage at a significantly lower level compared to static segmentation, for a typical workload where the data needs change repeatedly. Adaptation time can be kept constant for the workload when there are sufficient resources. Also, the storage is constant with an increasing amount of nodes and linear with an increasing rate of change to data needs.

Place, publisher, year, edition, pages
IEEE Computer Society, 2007. 327-337 p.
Research subject
Technology
Identifiers
URN: urn:nbn:se:his:diva-2121DOI: 10.1109/RTCSA.2007.72ISI: 000250109000039Scopus ID: 2-s2.0-46449133901ISBN: 978-0-7695-2975-2 OAI: oai:DiVA.org:his-2121DiVA: diva2:32397
Available from: 2008-06-03 Created: 2008-06-03 Last updated: 2013-03-18

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Mathiason, GunnarAndler, Sten F
By organisation
School of Humanities and InformaticsThe Informatics Research Centre

Search outside of DiVA

GoogleGoogle Scholar

Altmetric score

Total: 1445 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf