The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
This paper analyzed the performance characteristics of classic 2Q algorithm when it was performed on mail-service workloads, and proposes an improved algorithm, called 2Q*. The simulation results show that 2Q* algorithm can outperform the other replacement algorithms, including the classic 2Q algorithm, for all the cache sizes and various mail-service workloads. To verify the simulation results in...
This paper presents a novel optimization algorithm called self-organizing potential field network (SOPFN). The SOPFN algorithm is derived from the idea of the vector potential field. In the proposed network, the neuron with the best weight is considered as the target with the attractive force, while the neuron with the worst weight is considered as the obstacle with the repulsive force. The competitive...
P-Cache to provide prioritized caching service for storage server which is used to serve multiple concurrently accessing applications with diverse access patterns and unequal importance. Given the replacement algorithm and the application access patterns, the end performance of each individual application in a shared cache is actually determined by its allocated cache resource. So, P-Cache adopts...
With popularity of different kind of search engines on WWW, it requires the backend storage system to provide better physical I/O performance to speedup the query service perceived by end users. However, existing general purpose designed replacement algorithm canpsilat performs well for the web search applications. This paper first studies the access pattern of various real-life web search workload...
Scalability, which indicates the capacity of system to support the maximal number of clients, is very important to cluster file system. But in practical applications, the bandwidth that storage devices provide doesnpsilat linearly grow with the increasing number of clients which leads to bad QoS and restricts the scalability of cluster file system. This paper analyses the bottleneck of scalability...
Absorbing the slab idea for memory management, this paper presents a novel technique for the disk storage management called a storage slab allocator. A storage slab allocator doesnpsilat discard the file layout during the process of deleting files, but reuses the free file layout while creating, thereby both block allocation and release will be speeded up. The file layout is the cached-object as the...
This paper presents a flexible two-layer buffer caching scheme to improve the performance of storage cache which is used to serve multiple concurrently accessing applications with diverse access patterns. To achieve this, the proposed scheme dynamically partitions the cache among applications. At the first layer, it uses a configurable global cache allocation policy to make adaptive cache allocations...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.