Towards a cost model for distributed and replicated data stores

Stockinger, Heinz; Stockinger, Kurt; Schikuta, Erich; Willers, Ian

doi:10.1109/empdp.2001.905075

Cited by 35 publications

(18 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A number of researchers have taken a software component oriented approach to the problem, by describing the services and middleware interactions which should exist in order to support OLAP [16,18,19]. In [20,21], Niemi et.…”

Section: Related Workmentioning

confidence: 99%

“…In order to make scheduling decisions, the resource optimizer should have knowledge of the processor and disk speeds of all of the computational and storage resources at its site, and can poll the machines to get their respective loads. Our basic scheduling approach is similar to that of other data-intensive computational Grid schedulers [15,16,17] in that it models execution time on the various available resources and chooses the cheapest option. The difference is in the details of the cost modeling as described in the above equations, which are specific to OLAP queries which can be evaluated in many possible ways using different views.…”

mentioning

confidence: 99%

See 1 more Smart Citation

The OLAP-Enabled Grid: Model and Query Processing Algorithms

Lawrence

Rau-Chaplin

2006

20th International Symposium on High-Performance Computing in an Advanced Collaborative Environment (HPCS'06)

View full text Add to dashboard Cite

show abstract

Section: Related Workmentioning

confidence: 99%

mentioning

confidence: 99%

The OLAP-Enabled Grid: Model and Query Processing Algorithms

Lawrence

Rau-Chaplin

2006

20th International Symposium on High-Performance Computing in an Advanced Collaborative Environment (HPCS'06)

View full text Add to dashboard Cite

show abstract

“…In our approach, asynchronous individual decisions are taken by data items regarding replication, migration or deletion, so that high availability is preserved and dynamic load balancing is performed. Also, in [26], a cost model is defined for the factors that affect data and application migration for minimizing latency in replying queries. Data is migrated towards the application or the application towards the data based on their respective costs that depends on various aspects, such as query load, replicas placement and network and storage availability.…”

Section: Related Workmentioning

confidence: 99%

A self-organized, fault-tolerant and scalable replication scheme for cloud storage

Bonvin

Papaioannou

Aberer

2010

Proceedings of the 1st ACM Symposium on Cloud Computing

109

View full text Add to dashboard Cite

Failures of any type are common in current datacenters, partly due to the higher scales of the data stored. As data scales up, its availability becomes more complex, while different availability levels per application or per data item may be required. In this paper, we propose a self-managed key-value store that dynamically allocates the resources of a data cloud to several applications in a costefficient and fair way. Our approach offers and dynamically maintains multiple differentiated availability guarantees to each different application despite failures. We employ a virtual economy, where each data partition (i.e. a key range in a consistent-hashing space) acts as an individual optimizer and chooses whether to migrate, replicate or remove itself based on net benefit maximization regarding the utility offered by the partition and its storage and maintenance cost. As proved by a game-theoretical model, no migrations or replications occur in the system at equilibrium, which is soon reached when the query load and the used storage are stable. Moreover, by means of extensive simulation experiments, we have proved that our approach dynamically finds the optimal resource allocation that balances the query processing overhead and satisfies the availability objectives in a cost-efficient way for different query rates and storage requirements. Finally, we have implemented a fully working prototype of our approach that clearly demonstrates its applicability in real settings.

show abstract

“…For the exchanges, combinatorial auctions are employed where winner determination is tricky, as opposed to our straightforward decision making approach. Also, in [16], a cost model is defined for the factors that affect data and application migration for minimizing latency in replying queries. Data is migrated towards the application or the application towards the data based on their respective costs that depends on various aspects, such as query load, replicas placement and network and storage availability.…”

Section: Related Workmentioning

confidence: 99%

Dynamic cost-efficient replication in data clouds

Bonvin

Papaioannou

Aberer

2009

Proceedings of the 1st Workshop on Automated Control for Datacenters and Clouds

View full text Add to dashboard Cite

Hardware failures in current data centers are common partly due to the higher data scales supported. Data replication is the common approach for improving availability. However, mostly static replication approaches have been proposed, i.e. the number of replicas and their locations are fixed. Moreover, the geographical diversity of data locations has not explicitly been considered. In this paper, we propose a costefficient replication scheme across data centers that dynamically adapts the number of replicas employed per partition to the query load, while maintaining availability guarantees in case of failures. Our approach employs a virtual economy that is experimentally proved in a simulated environment to achieve load balancing among data servers at the minimum cost.

show abstract

Towards a cost model for distributed and replicated data stores

Cited by 35 publications

References 7 publications

The OLAP-Enabled Grid: Model and Query Processing Algorithms

The OLAP-Enabled Grid: Model and Query Processing Algorithms

A self-organized, fault-tolerant and scalable replication scheme for cloud storage

Dynamic cost-efficient replication in data clouds

Contact Info

Product

Resources

About