Table of Contents Author Guidelines Submit a Manuscript
Journal of Electrical and Computer Engineering
Volume 2015 (2015), Article ID 242086, 8 pages
http://dx.doi.org/10.1155/2015/242086
Research Article

A Bit String Content Aware Chunking Strategy for Reduced CPU Energy on Cloud Storage

1College of Computer Science, South-Central University for Nationalities, Wuhan, Hubei 430074, China
2School of Information Engineering, Wuhan Technology and Business University, Wuhan, Hubei 430065, China
3School of Foreign Languages, Huazhong University of Science and Technology, Wuhan, Hubei 430074, China

Received 11 May 2015; Accepted 30 July 2015

Academic Editor: Lu Liu

Copyright © 2015 Bin Zhou et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. J. Gantz and D. Reinsel, “Extracting value from chaos,” IDC IVIEW, 2011, http://www.emc.com/collateral/analyst-reports/idc-extracting-value-from-chaos-ar.pdf. View at Google Scholar
  2. Gartner, Meeting the DC Power and Cooling Challenges, 2008.
  3. NRDC, “Report to congress on server and data center energy efficiency,” 2013, http://www.nrdc.org/.
  4. J. Sweeney, “Reducing data centers power and energy consumption: saving money and go green,” 2008.
  5. W. Tschudi, T. Xu, D. Sartor et al., Energy Efficient Data Center, California Energy Commission, Berkeley, Calif, USA, 2004.
  6. J. Hamilton, “Cooperative expendable micro-slice servers (CEMS): low cost, low power servers for internet-scale services,” in Proceedings of the 4th Biennial Conference on Innovative Data Systems Research (CIDR '09), pp. 1–8, Asilomar, Calif, USA, 2009.
  7. S. Y. Jin, Research on some key issues for resource management in green virtualized data center [Ph.D. thesis], University of Electronic Science and Technology of China, Chengdu, China, 2012.
  8. G. Lu, Y. Jin, and D. H. C. Du, “Frequency based chunking for data de-duplication,” in Proceedings of the 18th Annual IEEE/ACM International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS '10), pp. 287–296, IEEE, August 2010. View at Publisher · View at Google Scholar · View at Scopus
  9. H. M. Jung, S. Y. Park, J. G. Lee, and Y. W. Ko, “Efficient data deduplication system considering file modification pattern,” International Journal of Security and Its Applications, vol. 6, no. 2, pp. 421–426, 2012. View at Google Scholar · View at Scopus
  10. Y. Wang, C. C. Tan, and N. Mi, “Using elasticity to improve inline data deduplication storage systems,” in Proceedings of the 7th IEEE International Conference on Cloud Computing (CLOUD '14), pp. 785–792, IEEE, Anchorage, Alaska, USA, June-July 2014. View at Publisher · View at Google Scholar
  11. A. Muthitacharoen, B. Chen, and D. Mazières, “A low-bandwidth network files system,” in Proceedings of the Symposium on Operating Systems Principles (SOSP '01), pp. 174–187, ACM Press, 2001.
  12. M. O. Rabin, Fingerprinting by Random Polynomials, Center for Research in Computing Technology, Aiken Computation Laboratory, Harvard University, Cambridge, Mass, USA, 1981.
  13. K. Eshghi and H. K. Tang, “A framework for analyzing and improving content based chunking algorithms,” Tech. Rep. HPL-2005-30R1, Hewlett-Packard Labs, 2005. View at Google Scholar
  14. D. R. Bobbarjung, S. Jagannathan, and C. Dubnicki, “Improving duplicate elimination in storage systems,” ACM Transactions on Storage, vol. 2, no. 4, pp. 424–448, 2006. View at Publisher · View at Google Scholar · View at Scopus
  15. Y. Liu, X. Ge, D. H. C. Du, and X. X. Huang, “Par-BF: a parallel partitioned Bloom filter for dynamic data sets,” in Proceedings of the International Workshop on Data Intensive Scalable Computing Systems (DISCS '14), pp. 1–8, IEEE Press, 2014. View at Publisher · View at Google Scholar
  16. N. Jain, M. Dahlin, and R. Tewari, “Taper: tiered approach for eliminating redundancy in replica synchronization,” in Proceedings of the 4th USENIX Conference on File and Storage Technologies (FAST '05), p. 21, USENIX Association Press, Berkeley, Calif, USA, 2005.
  17. J. B. Wang, Z. G. Zhao, Z. G. Xu, H. Zhang, L. Li, and Y. Guo, “I-sieve: an inline high performance deduplication system used in cloud storage,” Tsinghua Science and Technology, vol. 20, no. 1, Article ID 7040510, pp. 17–27, 2015. View at Publisher · View at Google Scholar · View at Scopus
  18. S. Robert, J. Boyer, and S. Moore, “A fast string searching algorithm,” Communications of the ACM, vol. 20, no. 10, pp. 762–772, 1977. View at Google Scholar
  19. Z. Galil and T. Aviv, “On improving the worst case running time of the Boyer-Moore string matching algorithm,” in Automata, Languages and Programming: Fifth Colloquium, Udine, Italy, July 17–21, 1978, vol. 62 of Lecture Notes in Computer Science, pp. 241–250, Springer, Berlin, Germany, 1978. View at Publisher · View at Google Scholar
  20. A. N. M. E. Rafiq, M. W. El-Kharashi, and F. Gebali, “A fast string search algorithm for deep packet classification,” Computer Communications, vol. 27, no. 15, pp. 1524–1538, 2004. View at Publisher · View at Google Scholar · View at Scopus