Patent application number | Description | Published |
20110043387 | DATA COMPRESSION USING A NESTED HIERACHY OF FIXED PHRASE LENGTH STATIC AND DYNAMIC DICTIONARIES - The present invention describes lossless data compression/decompression methods and systems. A random access memory (RAM) operates as a static dictionary and includes commonly used strings/symbols/phrases/words. An input buffer operates as a dynamic dictionary and includes input strings/phrases/symbols/words. A set-associative cache memory operates as a hash table, and includes pointers pointing to the commonly used strings/symbols/phrases/words in the static dictionary and/or pointing to one or more of the input strings/phrases/symbols/words in the dynamic dictionary. Alternatively, the set-associative cache memory combines the dynamic dictionary, the static dictionary and the hash table. When encountering a symbol/phrase/string/word in the static or dynamic dictionary in an input stream, a compressor logic or module places a pointer pointing to the symbol/phrase/string/word at a current location on the output stream. The hash table may include phrases/symbols/strings/words and/or pointers pointing to phrases/symbols/strings/words. | 02-24-2011 |
20140075086 | DURABLE TRANSACTIONS WITH STORAGE-CLASS MEMORY - A method for conducting memory transactions includes receiving a transaction. The steps of the received transaction are performed in a memory buffer. A state of the memory buffer cache lines is set as pending and unstored while the transaction is in progress. After all steps have been successfully performed, the state of the memory buffer cache lines are changed to complete and unstored. When it is determined that the memory buffer cache lines are to be written to the non-volatile main memory, the contents is written to the non-volatile main memory. The state of the memory buffer cache lines are then changed to complete and stored. When the memory buffer cache lines are in the complete and unstored state, access to modify their content is restricted. | 03-13-2014 |
20140075122 | DURABLE TRANSACTIONS WITH STORAGE-CLASS MEMORY - A system for conducting memory transactions includes a non-volatile main memory and a memory buffer including a plurality of cache lines. Each of the cache lines includes content and one or more bits signifying whether a memory transaction corresponding to the content of the cache line has been performed to completion and whether the content of the cache line matches content of a corresponding location of the non-volatile main memory. When the one or more bits of a cache line of the plurality of cache lines signifies that the transaction has been performed to completion and the content of the cache line does not match the content of the corresponding location of the non-volatile memory, access to modify the content of the cache line is restricted until the content of the cache line is written to the corresponding location of the non-volatile main memory. | 03-13-2014 |
Patent application number | Description | Published |
20090172468 | METHOD FOR PROVIDING DEFERRED MAINTENANCE ON STORAGE SUBSYSTEMS - A set of disks in a plurality of disk arrays are configured to have one or more spare partitions. Upon detecting a faulty disk in a faulty array, the method involves the steps of: (a) migrating data in the faulty array containing the faulty disk to one or more spare partitions; (b) reconfiguring the faulty array to form a new array without the faulty disk; (c) migrating data from one or more spare partitions in the set of disks to the reconfigured new array; (d) monitoring to identify when overall spare capacity falls below a predetermined threshold; and when the predetermined threshold is exceeded, scheduling a service visit for replacement of the failed disks. | 07-02-2009 |
20090177918 | STORAGE REDUNDANT ARRAY OF INDEPENDENT DRIVES - A computer implemented method, apparatus, and computer usable program product for managing redundant array of independent drives. In response to a failure of a hard disk in a first RAID array, the process calculates an amount of free capacity available across a set of remaining hard disks in the first RAID array. The set of remaining hard disks comprises every hard disk associated with the first RAID array except the failed disk. In response to a determination that the amount of free capacity is sufficient to re-create the first RAID array at a same RAID level, the process reconstructs the first RAID array using an amount of space in the set of remaining drives utilized by the first RAID array and the free capacity to form a new RAID array without utilizing a spare hard disk. | 07-09-2009 |
20090287901 | SYSTEM AND METHOD FOR CONTENT REPLICATION DETECTION AND ELIMINATION IN MAIN MEMORY - A system and method for effectively increasing the amount of data that can be stored in the main memory of a computer, particularly, by a hardware enhancement of a memory controller apparatus that detects duplicate memory contents and eliminates duplicate memory contents wherein the duplication and elimination are performed by hardware without imposing any penalty on the overall performance of the system. | 11-19-2009 |
20140164828 | CONSISTENCY OF DATA IN PERSISTENT MEMORY - Consistency of data stored in persistent memory is maintained using separate commit and harden operations for a transaction. A transaction is committed with a processing device, the committing including marking an end of an atomic operation on a modified object from the transaction, creating a new copy of the modified object, and storing a mapping of the modified object to the new copy of the modified object in a recorded log. A checksum identifying the modified object is created and stored in the recorded log. The transaction is hardened by storing the modified object and the recorded log from cache into persistent memory. | 06-12-2014 |
20140195719 | INSTANTANEOUS SAVE/RESTORE OF VIRTUAL MACHINES WITH PERSISTENT MEMORY - A computer implemented method creates a snapshot of a logical volume of a computer. The computer stores a system state of the computer in persistent memory. The computer flushes a cash of the computer. The computer identifies a preceding snapshot. Responsive to identifying the preceding snapshot, the computer hardens changes occurring after the preceding snapshot. The computer then switches from a first indirection table to a second indirection table. | 07-10-2014 |
20140195721 | INSTANTANEOUS SAVE/RESTORE OF VIRTUAL MACHINES WITH PERSISTENT MEMORY - A computer implemented method creates a snapshot of a logical volume of a computer. The computer stores a system state of the computer in persistent memory. The computer flushes a cash of the computer. The computer identifies a preceding snapshot. Responsive to identifying the preceding snapshot, the computer hardens changes occurring after the preceding snapshot. The computer then switches from a first indirection table to a second indirection table. | 07-10-2014 |
20140289468 | LIGHTWEIGHT PRIMARY CACHE REPLACEMENT SCHEME USING ASSOCIATED CACHE - One aspect provides a method including: responsive to a request for data and a miss in both a first cache and a second cache, retrieving the data from memory, the first cache storing at least a subset of data stored in the second cache; inferring from information pertaining to the first cache a replacement entry in the second cache; and responsive to inferring from information pertaining to the first cache a replacement entry in the second cache, replacing an entry in the second cache with the data from memory. Other aspects are described and claimed. | 09-25-2014 |
20140289477 | LIGHTWEIGHT PRIMARY CACHE REPLACEMENT SCHEME USING ASSOCIATED CACHE - One aspect provides an apparatus including: at least one processor; and a computer readable storage medium having computer readable program code embodied therewith and executable by the at least one processor, the computer readable program code including: computer readable program code configured to, responsive to a request for data and a miss in both a first cache and a second cache, retrieve the data from memory, the first cache storing at least a subset of data stored in the second cache; computer readable program code configured to infer from information available from the first cache a replacement entry in the second cache; and computer readable program code configured to, responsive to inferring from information available from the first cache a replacement entry in the second cache, replace an entry in the second cache with the data from memory. Other aspects are described and claimed. | 09-25-2014 |