Abstract: A method is provided for scrubbing information stored in a data storage system where the information is stored as a plurality of encoded fragments across multiple storage devices. The method includes maintaining on a first storage device a list of metadata entries corresponding to values that are stored in the data storage system at an At Maximum Redundancy (AMR) state, verifying that encoded fragments associated with each of the metadata entries are stored on a second storage, verifying that a corresponding metadata entry is stored on the first storage device for each encoded fragment that is stored on the second storage device, and scheduling for recovery any missing encoded fragments and/or any missing metadata entry.

Abstract: Systems and methods for fine-grained sparing in non-volatile memories are disclosed. A system may include a memory having a plurality of blocks, a plurality of tags and a plurality of spared lines, wherein each of the tags corresponds to one of the plurality of spared lines, and table having a plurality of machine addresses, wherein each machine address corresponds to a sparing area for each of the blocks of the plurality of blocks. Methods of operation a fine-grained sparing system are also disclosed.

Abstract: Embodiments include methods, apparatus, and systems for retrieving data from multiple locations in storage systems. One embodiment includes a method that determines that data is stored in multiple locations remote to a computer, estimates a latency to retrieve the data from the multiple locations, and requests the data from the plural locations.

Abstract: A hard disk drive includes a storage surface, a motor, a read/write had, and a number of regions into which the storage surface is divisible. Data is writable to and data is readable from the storage surface. The motor is to rotate the storage surface at a variable speed. The read/write head is to write data to and read data from the storage surface while the storage surface is rotated by the motor. Each region corresponds to a different speed at which the storage surface is rotated for the read/write head to write data to and read data from the region.

Abstract: A method for dynamically partitioning a B-tree data structure, includes: determining if the B-tree data structure requires a partition; establishing a midpoint of the B-tree data structure; migrating from a beginning of the B-tree data structure to the midpoint of the B-tree data structure to a first B-tree data structure; migrating from the midpoint of the B-tree data structure to an end of the B-tree data structure to a second B-tree data structure; and allowing normal operations on the B-tree data structure during migration.

Abstract: A multiple level integrated circuit includes a plurality of circuits, which are associated with different levels of the integrated circuit and are adapted to propagate a signal among the circuits. The signal has one of multiple states and the states include a first state that indicates circuit selection. The plurality of circuits are adapted to alter the signal as the signal propagates among the circuits to regulate which circuit of the plurality of circuits responds to the first state.

Abstract: Example methods, apparatus, and articles of manufacture to access memory are disclosed. A disclosed example method involves receiving at least one runtime characteristic associated with accesses to contents of a memory page and dynamically adjusting a memory fetch width for accessing the memory page based on the at least one runtime characteristic.

Abstract: Example methods, systems, and apparatus to dynamically select between memory error detection and memory error correction are disclosed herein. An example system includes a buffer, to store a flag settable to a first value to indicate that a memory page is to store error protection information to detect but not correct errors in the memory page. The flag is settable to a second value to indicate that the error protection information is to detect and correct errors for the memory page. The example system includes a memory controller to receive a request based on the flag to enable error detection without correction for the memory page when the flag is set to the first value, and to enable error detection and correction for the memory page when the flag is set to the second value.

Abstract: A method for determining priority of recovery for a RAID implementation includes detecting a first failure of the RAID implementation; detecting a second failure of the RAID implementation; assigning a first priority to the first failure and a second priority to the second failure; and setting the priority of the recovery based on the first priority and the second priority.

Abstract: A method for inserting a file in a search tree (B-tree) implemented on a file system, includes: (a) in response to a current node being a root node or an internal node, determining a child node; (b) repeating (a) until a leaf node is detected; (c) in response to a number of leaf nodes at a level of the leaf node exceeding an upper limit of files or a number of child nodes of a current node exceeding an upper limit of sub-directories, balancing the level of the leaf node or child nodes; and (d) inserting the file at the level of the leaf node.

Abstract: A method and a corresponding apparatus provide for remapping for wear leveling of a memory. The method is implemented as logic and includes the steps of receiving a memory operation, the memory operation including a logical memory address; dividing the logical address into a logical block address portion, a logical line address portion, and a logical subline address portion; translating the logical block address portion into a physical block address; selecting a line remap key; applying the line remap key to the logical line address portion to produce a physical line address; producing a physical subline address portion; and combining the physical block, line, and subline address portions to produce a physical address for the memory operation.

Abstract: A system includes a number of hard disk drives and a controller. Each hard disk drive is selected from a number of different hard disk drive types. Each hard disk drive type has a different speed at which the hard disk drives of the hard disk drive type rotate to read and write data. At least one of the hard disk drives is of a different hard disk drive type than at least one other of the hard disk drives. The controller, responsive to a request to write particular data to the hard disk drives, is to select a given hard disk drive of the hard disk drives based on a type of the particular data, and is to write the particular data to the given hard disk drive.

Abstract: A method of recovering a value in a data storage system includes maintaining a list of entries corresponding to values that have been inserted into the data storage system, determining whether the values are at an At Maximum Redundancy (AMR) state, and if not, the converging the values to the AMR state.

Abstract: A navigation device comprises a display, a data storage element, a passenger sensor, and a processor. The display may communicate routing data to a driver of a vehicle. The data storage element may store cartographic data including high-occupancy vehicle (HOV) lane data. The passenger sensor may sense a number of passengers in the vehicle. The processor may be coupled with the display and the data storage element and may be configured to receive the number of sensed passengers in the vehicle, determine if the vehicle is eligible to travel through one or more HOV lanes based on the number of sensed passengers and HOV lane data, determine a route that includes the one or more HOV lanes if the vehicle is eligible to travel in the one or more HOV lanes, and provide a visual indication of the route to be shown on the display.

Abstract: Systems and methods for fine-grained sparing in non-volatile memories art disclosed. A system may include a memory having a plurality of blocks, a plurality of tags and a plurality of spared lines, wherein each of the tags corresponds to one of the plurality of spared lines, and table having a plurality of machine addresses, wherein each machine address corresponds to a sparing area for each of the blocks of the plurality of blocks. Methods of operation a fine-grained sparing system are also disclosed.

Abstract: Mapping long names in a filesystem is disclosed. An example method includes hashing a long file name, and storing a file with the hashed file name. Another example method includes splitting a long file name into at least two parts, and encoding the at least two parts of the long file name as directory structures in the filesystem.

Abstract: A method for dynamically partitioning a B-tree data structure, includes: determining if the B-tree data structure requires a partition; establishing a midpoint of the B-tree data structure; migrating from a beginning of the B-tree data structure to the midpoint of the B-tree data structure to a first B-tree data structure; migrating from the midpoint of the B-tree data structure to an end of the B-tree data structure to a second B-tree data structure; and allowing normal operations on the B-tree data structure during, migration.

Abstract: A multi-geography cloud storage system includes a first data center, with a first key-lookup server to access a first lookup table; and a first fragment server to store data or meta data associated with keys; and a second data center, with a second key-lookup server to access a second lookup table; and a second fragment server to store data associated with the keys; and a storage device to store a redundancy specification.

Abstract: A method for determining priority of recovery for a RAID implementation includes detecting a first failure of the RAID implementation; detecting a second failure of the RAID implementation; assigning a first priority to the first failure and a second priority to the second failure; and setting the priority of the recovery based on the first priority and the second priority.

Abstract: A method for inserting a file in a search tree (B-tree) implemented on a file system, includes: (a) in response to a current node being a root node or an internal node, determining a child node; (b) repeating (a) until a leaf node is detected; (c) in response to a number of leaf nodes at a level of the leaf node exceeding an upper limit of files or a number of child nodes of a current node exceeding an upper limit of sub-directories, balancing the level of the leaf node or child nodes; and (d) inserting the file at the level of the leaf node.