Abstract: In a method for processing cache data of a computing device, a storage space of the storage device is divided into sections, and a section number of each data block in the storage device is determined according one of the sections in the storage device which each data block belongs to. A field is added for each data block in the storage device to record a section number of each data block in the storage device. When the cache data in the cache memory requires to be written back to the storage device, cache data with the section number is searched from all of the cache data in the cache memory to be written back to a corresponding section in the storage device.

Abstract: In a method for processing cache data of a computing device, a storage space of the storage device is divided into sections, and a section number of each data block in the storage device is determined according one of the sections in the storage device which each data block belongs to. A field is added for each data block in the storage device to record a section number of each data block in the storage device. When the cache data in the cache memory requires to be written back to the storage device, cache data with the section number is searched from all of the cache data in the cache memory to be written back to a corresponding section in the storage device.

Abstract: A data caching system applied in an electronic device is provided. The electronic device includes a processor, a cache, a main storage. Data stored in the cache is assigned with a weight value to present times that the data has been read. The data caching system includes a receiving module receiving requests for reading data from the processor. A reading module reads data according to the reading requests, and determines whether a requested data is stored in the cache. A weight value calculating module calculates the weight value, of the requested data that is stored in the cache. The weight value calculating module plus one to the weight value of the requested data when the requested data is read. If the cache is full, the data whose weight value is equal to zero is randomly selected to be cleared from the cache to release space.

Abstract: A storage device includes a casing, non-hot-pluggable hard disks, and an operating portion. The casing includes a fringe area next to an exterior of the casing, and a central area in an interior of the casing. The non-hot-pluggable hard disks are positioned at the central area of the casing, and the hot-pluggable slots are positioned at the fringe area of the casing. The operating portion is located at the fringe area. Hot-pluggable slots are defined in the operating portion and are adapted for insertion of hot-pluggable hard disks therein. The disclosure also provides a related method storage device disk replacement, and a related data transmission method for storage device disk replacement.

Abstract: A rotating parity redundant array of independent disk (RAID) and a method for storing parity of the same are provided. The rotating parity RAID comprises a first˜a third disk. The first disk has A1˜Am blocks for storing A1˜Am data respectively. The second disk has B1˜Bm blocks for storing B1˜Bm data respectively. The third disk has C1˜Cm blocks for storing C1˜Cm data respectively. The Cn+k data is an nth parity data obtained from the An data and the Bn data. The Bn+k+1 data is an (n+1)th parity data obtained from the Cn+1 data and the An+1 data. The An+k+2 data is an (n+2)th parity data obtained from the Bn+2 data and the Cn+2 data.

Abstract: A rotating parity redundant array of independent disk (RAID) and a method for storing parity of the same are provided. The rotating parity RAID comprises a first˜a third disk. The first disk has A1˜Am blocks for storing A1˜Am data respectively. The second disk has B1˜Bm blocks for storing B1˜Bm data respectively. The third disk has C1˜Cm blocks for storing C1˜Cm data respectively. The Cn+k data is an nth parity data obtained from the An data and the Bn data. The Bn+k+1 data is an (n+1)th parity data obtained from the Cn+1 data and the An+1 data. The An+k+2 data is an (n+2)th parity data obtained from the Bn+2 data and the Cn+2 data.