The week's pick
Random Articles
Reseach Article
Speeding up Searching in B-cloud System
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 69 - Number 1 |
| Year of Publication: 2013 |
| Authors: Shawgi Mahmoud, Hua Wang, Ke Zhou |
10.5120/11804-7445
|
Shawgi Mahmoud, Hua Wang, Ke Zhou . Speeding up Searching in B-cloud System. International Journal of Computer Applications. 69, 1 ( May 2013), 7-13. DOI=10.5120/11804-7445
Abstract
With the enormous growth in data amount day by day storage demands have been imposed crucial requirements for data center, where data access plays essential role in estimation of data storage systems effectiveness. For that, there were a lot of efforts have been done to speed up searching in huge storage systems. Deduplication, one of the latest technologies in storage systems world, is founded on the principle of eliminating duplicates among data. Although this technology led to reduce vast amount of redundant data, still the matter of accessing speed of this huge amount of data is a critical problem. In this research a simple method was proposed to speed up searching in B-Cloud system by adopting Least Recently Used dual cache LRU which is able to save vast amount of time and speed up accessing time clearly. The Least Recently Used dual cache is based on the principle that elements that have been frequently demanded in the last few queries will probably be frequently demanded again in the next few times. The experiments results have shown that back up/recovery time decreased with the size of data and there is clear enhancement in both recovery and back up time (where back up time decreased 15. 67% with 16KB dual cache size and 34. 14% with 8MB dual cache size and recovery time decreased 15. 69% with 16KB dual cache size and 32. 3% with 8MB dual cache size), which led to enhance enormously the overall system performance.
References
- G. Peng, et al. , "Backup data storage system technology research and analysis," in Computer security, 2003, pp. 71-72
- X. He, et al. , "NDMP-based block-level backup/recovery method and its implementation," in Jisuanji Gongcheng/ Computer Engineering, 2007, pp. 82-84
- R. F. I. Specification, "Data-Over-Cable Service Interface Specifications," in SP—RFIv2. 0 ?, ed, 1999, pp. 1-58
- W. K. Kuo, et al. , "Improved priority access, bandwidth allocation and traffic scheduling for DOCSIS cable networks," in Broadcasting, IEEE Transactions on, 2003, pp. 371-382
- B. Debnath, et al. , "ChunkStash: speeding up inline storage deduplication using flash memory," 2010, pp. 16-16
- R. Bez, et al. , "Introduction to flash memory," in Proceedings of the IEEE, 2003, pp. 489-502
- N. Shivakumar and H. Garcia-Molina, "Finding near-replicas of documents on the web," in The World Wide Web and Databases, 1999, pp. 204-212
- C. Policroniades and I. Pratt, "Alternatives for detecting redundancy in storage systems data," 2004, pp. 6-6
- M. W. Storer, et al. , "Secure data deduplication," 2008, pp. 1-10
- G. H. Forman, et al. , "Data de-duplication," 2007, pp. 1-3
- S. Podlipnig and L. Böszörmenyi, "A survey of web cache replacement strategies," in ACM Computing Surveys (CSUR), 2003, pp. 374-398
- J. Czebotar. (2011, Jan 14). LRU Cache in C with uthash. Available:http://jehiah. cz/a/uthash
- Grund D and Reineke J, "Estimating the performance of cache replacement policies", in MEMOCODE, IEEE Computer Society,2008, pp. 101–112
- Kendell A. Chilton," Methods and apparatus for accessing a doubly linked list in a data storage ",Patent No US 6,941,308 BI,6 sep ,2005 ,pp,1-19
Index Terms
Keywords