A Cache Design of Load Balancing System for Object-Based Storage

Abstract

In design of the object-based storage system, cache design of the server becomes an important guarantee for improving service quality. This paper presents a cache design of load balancing system for object-based storage, which consists of three main aspects. First, the cache update policy is proposed. The strategy considers the overall cache as a pool, consistency and accuracy of updating is ensured through the locking mechanism, while using Bloom Filter combined with the updated time series to achieve updating simplification. Secondly, the cache replacement strategy is introduced which achieving the cache replacement policy using cache spanning tree combined with cache stack. Finally, cache design model is proposed based on energy consumption. Experimental results show that the proposed cache design can improve the efficiency of cache operation in object-based storage system, while reducing energy consumption of cache operation. 132Copyright ⓒ 2015 SERSC energy consumption cache design is adopted which ensure consistency, isolation, durability and stability of cache operations to the greatest extent to obtain the best performance. Related WorksIn recent years, there are many research directions on cache design, in which the research for the study of energy consumption and cache collaborative aspects of services has become a hot research and focus.[13] The two-level structure of the disk cache management and the corresponding management algorithms is proposed to ensure the overall performance of the system under high load conditions. [14] The client and metadata server cache is designed as a whole, while the cooperative caching scheme based on the object's size, access costs and network load, can effectively improve the input-output performance of the system. [15] proposed energy-related storage cache management, offline caching algorithms by proposing energy-related greedy algorithms, online energy-related algorithms, the energy consumption of the disk.[16] proposed a local algorithm and a multi-queue management algorithm with global multi-level buffer cache hierarchy, thereby increasing the actual hit rate of second-level buffer cache. Hierarchical bloom filter arrays (HBA): A novel, scalable metadata management system for large cluster-based storage