Virtual Full Replication by Adaptive Segmentation
2007 (English)In: Proc. 13th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA 2007), Los Alamitos, California, USA: IEEE Computer Society , 2007, 327-336 p.Conference paper (Refereed)
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
Los Alamitos, California, USA: IEEE Computer Society , 2007. 327-336 p.
Computer and Information Science
IdentifiersURN: urn:nbn:se:liu:diva-28195ISBN: 0-7695-2975-5ISBN: 978-0-7695-2975-2OAI: oai:DiVA.org:liu-28195DiVA: diva2:248855