Performance improved data storage and method
A data storage system and data technology, applied in information storage, memory system, static memory, etc., can solve the problems of inability to obtain performance advantages and full performance cannot be fully implemented.
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment
[0095] The RAM footprint of this embodiment is very small compared to the cache size. In the case of BlockSize (block length) of 8. Each register entry is 7 bytes. Thus the track occupies less than 1 byte per cache sector in bytes used for the cache table. The size of the hash table is a balance between expected lookup table performance and required memory. In general, computational performance depends on the length of hash tables and linked lists. The memory trace can be calculated as follows. The byte size of the hash table is twice the number of items (up to 64K items). The buffer table size is equal to (7 bytes x LineSize x number of lines).
[0096] Consider a 5400rpm removable hard drive as a non-limiting example of a storage system. A single family of cache lines located near the center of the data region (MD) is chosen to minimize the HDD seek distance. For this disk drive, there are 416 sectors per track on the MD. Each track will have 2 cache lines with 208 s...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 