On data staging algorithms for shared data accesses in clouds
•Download as DOCX, PDF•
0 likes•661 views
Bulk Projects For sale IEEE 2009-10-11-12-13 PAPERS AVILABLE. We are providing low cost project for final year student projects. Solved 2010 -2011 -2012 - 2013 IEEE in all the domain Mobile : 8940956123 E-Mail : ambitlick@gmail.com, INNOVATIVE TITLES ARE ALSO WELLCOME TO DO WITH US For All BE/BTech, ME/MTech, MSC/MCA/MS , and diplamo graduates PROJECT SUPPORTS & DELIVERABLES •Project Abstract •IEEE Paper •PPT / Review Details •Project Report •Working Procedure in Video •Screen Shots •Materials & Books in CD •Project Certification
![Ambit lick Solutions
Mail Id: Ambitlick@gmail.com , Ambitlicksolutions@gmail.Com
13. On Data Staging Algorithms for Shared Data Accesses in Clouds
In this paper, we study the strategies for efficiently achieving data staging and
caching on a set of vantage sites in a cloud system with a minimum cost. Unlike the
traditional research, we do not intend to identify the access patterns to facilitate the
future requests. Instead, with such a kind of information presumably known in
advance, our goal is to efficiently stage the shared data items to predetermined sites at
advocated time instants to align with the patterns while minimizing the monetary
costs for caching and transmitting the requested data items. To this end, we follow the
cost and network models in [1] and extend the analysis to multiple data items, each
with single or multiple copies. Our results show that under homogeneous cost model,
when the ratio of transmission cost and caching cost is low, a single copy of each data
item can efficiently serve all the user requests. While in multicopy situation, we also
consider the tradeoff between the transmission cost and caching cost by controlling
the upper bounds of transmissions and copies. The upper bound can be given either on
per-item basis or on all-item basis. We present efficient optimal solutions based on
dynamic programming techniques to all these cases provided that the upper bound is
polynomially bounded by the number of service requests and the number of distinct
data items. In addition to the homogeneous cost model, we also briefly discuss this
problem under a heterogeneous cost model with some simple yet practical restrictions
and present a 2-approximation algorithm to the general case. We validate our findings
by implementing a data staging solver, whereby conducting extensive simulation
studies on the behaviors of the algorithms.](https://image.slidesharecdn.com/13-130716031451-phpapp02/85/On-data-staging-algorithms-for-shared-data-accesses-in-clouds-1-320.jpg?cb=1373944526)
Recommended
Recommended
More Related Content
More from ambitlick
More from ambitlick (20)
Recently uploaded
Recently uploaded (20)
On data staging algorithms for shared data accesses in clouds
- 1. Ambit lick Solutions Mail Id: Ambitlick@gmail.com , Ambitlicksolutions@gmail.Com 13. On Data Staging Algorithms for Shared Data Accesses in Clouds In this paper, we study the strategies for efficiently achieving data staging and caching on a set of vantage sites in a cloud system with a minimum cost. Unlike the traditional research, we do not intend to identify the access patterns to facilitate the future requests. Instead, with such a kind of information presumably known in advance, our goal is to efficiently stage the shared data items to predetermined sites at advocated time instants to align with the patterns while minimizing the monetary costs for caching and transmitting the requested data items. To this end, we follow the cost and network models in [1] and extend the analysis to multiple data items, each with single or multiple copies. Our results show that under homogeneous cost model, when the ratio of transmission cost and caching cost is low, a single copy of each data item can efficiently serve all the user requests. While in multicopy situation, we also consider the tradeoff between the transmission cost and caching cost by controlling the upper bounds of transmissions and copies. The upper bound can be given either on per-item basis or on all-item basis. We present efficient optimal solutions based on dynamic programming techniques to all these cases provided that the upper bound is polynomially bounded by the number of service requests and the number of distinct data items. In addition to the homogeneous cost model, we also briefly discuss this problem under a heterogeneous cost model with some simple yet practical restrictions and present a 2-approximation algorithm to the general case. We validate our findings by implementing a data staging solver, whereby conducting extensive simulation studies on the behaviors of the algorithms.