Högskolan i Skövde

his.sePublikationer
Ändra sökning
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • apa-cv
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Virtual Full Replication by Adaptive Segmentation
Högskolan i Skövde, Institutionen för kommunikation och information. Högskolan i Skövde, Forskningscentrum för Informationsteknologi. (Distribuerade realtidssystem (DRTS), Distributed Real-Time Systems)ORCID-id: 0000-0001-7106-0025
Högskolan i Skövde, Institutionen för kommunikation och information. Högskolan i Skövde, Forskningscentrum för Informationsteknologi. (Distribuerade realtidssystem (DRTS), Distributed Real-Time Systems)ORCID-id: 0000-0002-6662-9034
University of Virginia, USA.
2007 (Engelska)Ingår i: 13th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA 2007): Proceedings, IEEE, 2007, s. 327-337Konferensbidrag, Publicerat paper (Refereegranskat)
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.

Ort, förlag, år, upplaga, sidor
IEEE, 2007. s. 327-337
Serie
IEEE Symposium on Embedded Systems for Real-Time Multimedia, ISSN 2325-1271, E-ISSN 2325-1301
Forskningsämne
Teknik; Distribuerade realtidssystem (DRTS)
Identifikatorer
URN: urn:nbn:se:his:diva-2121DOI: 10.1109/RTCSA.2007.72ISI: 000250109000039Scopus ID: 2-s2.0-46449133901ISBN: 978-0-7695-2975-2 (tryckt)ISBN: 0-7695-2975-5 (tryckt)OAI: oai:DiVA.org:his-2121DiVA, id: diva2:32397
Konferens
13th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA 2007), 21-24 August 2007, Daegu, South Korea
Tillgänglig från: 2008-06-03 Skapad: 2008-06-03 Senast uppdaterad: 2020-09-18Bibliografiskt granskad

Open Access i DiVA

Fulltext saknas i DiVA

Övriga länkar

Förlagets fulltextScopus

Person

Mathiason, GunnarAndler, Sten F.

Sök vidare i DiVA

Av författaren/redaktören
Mathiason, GunnarAndler, Sten F.
Av organisationen
Institutionen för kommunikation och informationForskningscentrum för Informationsteknologi

Sök vidare utanför DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetricpoäng

doi
isbn
urn-nbn
Totalt: 1923 träffar
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • apa-cv
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf