Entries |
Document | Title | Date |
20080201540 | PRESERVATION OF INTEGRITY OF DATA ACROSS A STORAGE HIERARCHY - A method and apparatus for preservation of integrity of data across a storage hierarchy. An embodiment of a method includes verifying integrity of a memory page that is stored in primary computer memory. The memory page is swapped out of the primary computer memory to a secondary memory, wherein swapping the memory page out includes performing an integrity check of the memory page. The memory page is swapped in the primary computer memory from the secondary memory, wherein swapping in the memory page includes verifying the integrity of the memory page based at least in part on the integrity check performed for swapping out the memory page. | 08-21-2008 |
20080215833 | INFORMATION STORAGE DEVICE AND STORED DATA PROCESSING METHOD - An information storage device includes one or more semiconductor memories storing management data accompanying content data and being configured to erase data in units of one block, and a controller setting up, in the one or more semiconductor memories, a working area to temporarily store the management data and a storage area to retain all or part of the management data stored in the working area, writing the management data to the working area while monitoring the free space of the working area, moving the management data stored in the working area to the storage area when the free space of the working area falls below a prescribed value, and erasing the management data stored in the working area after the movement of the management data to the storage area. | 09-04-2008 |
20080235469 | Peak Data Retention of Signal Data In An Implantable Medical Device - Methods and apparatus for storing data records associated with an extreme value are disclosed. Signal data is stored in a first buffer of a set of buffers. If a local extreme value for the first buffer exceeds a global extreme value, signal data is stored in a second buffer of the set of buffers. This process is repeated, wrapping around and overwriting buffers until the signal data in a current buffer does not have a local extreme value that exceeds the global extreme value. When this happens, signal data may be stored in a subsequent buffer and if a local extreme value of the subsequent buffer does not exceed the global extreme value, further signal data may be stored in the subsequent buffer in a circular manner until either an instantaneous extreme value exceeds the global extreme value or the recording period ends. In an embodiment, the extreme value may be a peak value. | 09-25-2008 |
20080250213 | Computer Architecture And Method Of Operation for Multi-Computer Distributed Processing Having Redundant Array Of Independent Systems With Replicated Memory And Code Striping - Computers and other computing machines and information appliances having a modified computer architecture and program structure which enables the operation of an application program concurrently or simultaneously on a plurality of computers interconnected via a communications link or network using a special distributed runtime (DRT), and that provides for a redundant array of independent computing systems that include computer code distribution using code-striping onto the plurality of the computers or computing machines. A redundant array of independent computing systems operating in concert and code-striping features. | 10-09-2008 |
20080263293 | Method for Selectively Performing a Secure Data Erase to Ensure Timely Erasure - A method and computer program product are provided to ensure a timely secure data erase by determining an erasure deadline for each physical volume of a plurality of physical volumes and calculating a remaining time for each physical volume. The remaining time is calculated for each physical volume by comparing a current date to the erasure deadline of each physical volume respectively. The physical volumes may then be sorted based on the remaining time and the physical volume with a shortest calculated remaining time will be selectively secure data erased. | 10-23-2008 |
20080263294 | Method for Determining Allocation of Tape Drive Resources for a Secure Data Erase Process - A method and computer program product are provided to ensure a timely secure data erase by determining whether allocating an additional tape drive would improve secure data erase performance by evaluating a quantity of physical volumes to be secure data erased, a maximum queued threshold, an average time to an erasure deadline and a minimum expiration threshold. An additional tape drive is allocated for the secure data erase process when it is determined that allocating an additional tape drive would improve secure data erase performance. | 10-23-2008 |
20080263295 | Methods, apparatus, and program products for improved finalization - Apparatus, methods, and computer program products are disclosed that improve management of a dynamic memory area. One aspect is a method that reclaims memory referenced by a finalizable-object that has been instantiated from a class definition that incorporates at least one parent class and one or more class-extensions into a class hierarchy. The method includes marking for retention a related memory reachable from a reference field of the finalizable-object, and adding the finalizable-object to a finalization set for subsequent invocation of a non-trivial finalize-method. The method also determines whether the portion of the finalizable-object that includes the reference field to the related memory is a class-extension that has a finalizer-free characteristic and conditions the marking for retention on that determination. Thus, a portion the finalizable-object's related memory can be more quickly reclaimed from a dynamic memory area. | 10-23-2008 |
20080276056 | Efficient Point-To-Point Enqueue And Dequeue Communications - Systems and methods for writing and/or reading data to a point-to-point shared memory communication mechanism are provided according to embodiments disclosed herein. According to one embodiment, a determination may be made whether a first memory location in the cache of a general purpose multi-core processor includes an empty symbol. If the first memory location includes the empty symbol, then data may be placed in the first memory location in the cache. If the first memory location does not include the empty symbol, then waiting until it does. In another embodiment, a determination may be made whether a first memory location of a general purpose multi-core processor includes the empty symbol. If it does not, then data may be read from the first memory location and/or the empty symbol may be written into the first memory location. If the first memory location does include the empty symbol, then pausing. | 11-06-2008 |
20080276057 | DATA STORAGE ARRAY SCALING METHOD AND SYSTEM WITH MINIMAL DATA MOVEMENT - A method for rearranging data blocks in a data storage system when adding new storage devices to create an expanded data storage system. A temporary configuration is selected for which the exchange of one or more data blocks between the temporary configuration and the source configuration produces the destination configuration before identifying and exchanging data blocks between the temporary configuration and the source configuration to produce the destination configuration. A single data element transfer chain embodiment provides superior performance in an embodiment that maintains (does not reduce) the source array data storage efficiency at the destination array after scaling. When adding a single new device to an existing array, the required data movement is minimized and does not exceed the capacity of the new device. | 11-06-2008 |
20080282045 | Garbage collection in storage devices based on flash memories - A solution for managing a storage device based on a flash memory is proposed. A corresponding method starts with the step for mapping a logical memory space of the storage device (including a plurality of logical blocks) on a physical memory space of the flash memory (including a plurality of physical blocks, which are adapted to be erased individually). The physical blocks include a set of first physical blocks (corresponding to the logical blocks) and a set of second—or spare—physical blocks (for replacing each bad physical block that is unusable). The method continues by detecting each bad physical block. Each bad physical block is then discarded, so to prevent using the bad physical block for mapping the logical memory space. | 11-13-2008 |
20080282046 | Part information restoration method, part information management method and electronic apparatus - A part information restoration method is adapted to an electronic apparatus having first and second parts which are replaceable and are provided with a nonvolatile memory for storing part information unique to the part. The method includes storing, in a first nonvolatile memory of the first part, part information of the first part, and saving part information of the second part as a first reference information at least when replacing the second part, storing, in a second nonvolatile memory of the second part, the part information of the second part, and saving the part information of the first part as second reference information at least when replacing the first part. The method restores the first reference information in the second nonvolatile memory or restores the second reference information in the first nonvolatile memory, after replacing the first or second part. | 11-13-2008 |
20080288730 | Transactional Memory System Which Employs Thread Assists Using Address History Tables - A computing system uses specialized “Set Associative Transaction Tables” and additional “Summary Transaction Tables” to speed the processing of common transactional memory conflict cases and those which employ assist threads using an Address History Table and processes memory transactions with a Transaction Table in memory for parallel processing of multiple threads of execution by support of which an application need not be aware. Special instructions may mark the boundaries of a transaction and identify memory locations applicable to a transaction. A ‘private to transaction’ (PTRAN) tag, directly addressable as part of the main data storage memory location, enables a quick detection of potential conflicts with other transactions that are concurrently executing on another thread of said computing system. The tag indicates whether (or not) a data entry in memory is part of a speculative memory state of an uncommitted transaction that is currently active in the system. | 11-20-2008 |
20080313412 | Data control apparatus, data control method, and data control program - A data control apparatus is connected to a central processing unit that processes data and to a main storage unit that stores therein the data, and controls output of the data. The data control apparatus includes a data storage unit that stores therein data output from the central processing unit to the main storage unit and data output from the central processing unit to other central processing unit, an information addition unit that adds information indicating an output enabled state to the data when the data stored in the data storage unit is in the output enabled state, and a data output unit that outputs the data with the information added thereto by the information addition unit from oldest stored data in order of storage in the data storage unit. | 12-18-2008 |
20090019244 | Information Record/Read Apparatus - A plurality of sectors | 01-15-2009 |
20090024809 | Managing Purgeable Memory Objects - A system and method of managing purgeable memory objects includes a LIFO and/or FIFO queue for volatile memory objects, which can be emptied at a rate that matches the speed of a page queue. | 01-22-2009 |
20090024810 | Memory area management method - In a storage device, a method is provided for preventing the risk of data loss and a significant decrease of writing speed due to area shrinkage when erased erase blocks have become fewer. A process of allocating a new page includes determining whether the length of a deallocated pages list is longer than n pages. If the list length is longer, one page is allocated from the deallocated pages list. If the list length is shorter, a capacity shortage error returns. Deleting a file using an erased pages list includes determining whether a page to be processed is emptied by deleting the file. If not so, the file is deleted from the page. If so, the contents of the last page-a in occupied pages are copied to the page, the page-a is written with data for erasure, and any erase block included in the page-a is made erasable. | 01-22-2009 |
20090031095 | PURGE OPERATIONS FOR SOLID-STATE STORAGE DEVICES - A storage system that comprises multiple solid-state storage devices includes a command set that enables a host system to initiate one or more types of purge operations. The supported purge operations may include an erase operation in which the storage devices are erased, a sanitization operation in which a pattern is written to the storage devices, and/or a destroy operation in which the storage devices are physically damaged via application of a high voltage. The command set preferably enables the host system to specify how many of the storage devices are to be purged at a time during a purge operation. The host system can thereby control the amount of time, and the current level, needed to complete the purge operation. In some embodiments, the number of storage devices that are purged at a time may additionally or alternatively be selectable by a controller of the storage system. | 01-29-2009 |
20090043976 | SYSTEM AND ARTICLE OF MANUFACTURE FOR REMOVING ALIAS ADDRESSES FROM AN ALIAS ADDRESS POOL - Provided are a system and article of manufacture for removing alias addresses from an alias address pool. A plurality of alias addresses are assigned to an alias address pool, wherein the alias addresses in the alias address pool are capable of being dynamically assigned to a device to service I/O requests to the device. An operation is initiated by a process to remove a specified alias address from the alias address pool. An indicator is set to prevent additional processes from removing one alias address from the alias address pool in response to initiating the operation. The specified alias address is removed from the alias address pool. | 02-12-2009 |
20090144513 | DATABASE UPDATE METHOD - According to some embodiments a system and a method are provided to storing a plurality of data, the data comprising a plurality of original data elements and corresponding modified data elements. The plurality of original data elements may be automatically compared against editable field data in one or more editable fields that are displayed on a display screen by an application program. A determination may be made if the editable field data will be replaced and the editable field data may be replaced with the corresponding modified data elements if a determination is made to replace the editable field data. | 06-04-2009 |
20090150625 | Multistage Virtual Memory Paging System - Hierarchically paging data in a computer system wherein, when evicting a page of data from the computer system main storage, evicting the page to a first paging store (preferably NVRAM). When evicting a page of data from the first paging store, evicting the page to a second paging store (such as a disk). When the main store requires a page of data that is not in the main store and when the page of data is available in the first paging store, loading the third page of data into main store from first paging store. When the page of data is not available in the first paging store, loading the third page of data into main store from the second store. Optionally, pages of main store are saved and restored from NVRAM during a power-down, power-up sequence of events. | 06-11-2009 |
20090172317 | MECHANISMS FOR STRONG ATOMICITY IN A TRANSACTIONAL MEMORY SYSTEM - A method and apparatus for providing efficient strong atomicity is herein described. Optimized strong operations may be inserted at non-transactional read accesses to provide efficient strong atomicity. A global transaction value is copied at a beginning of a non-transational function to a local transaction value; essentially creating a local timestamp of the global transaction value. At a non-transactional memory access within the function, a counter value or version value is compared to the LTV to see if a transaction has started updating memory locations, or specifically the memory location accessed. If memory locations have not been updated by a transaction, execution is accelerated by avoiding a full set of slowpath strong atomic operations to ensure validity of data accessed. In contrast, the slowpath operations may be executed to resolve contention between a transactional and non-transaction access contending for the same memory location. | 07-02-2009 |
20090172318 | Memory control device - A memory control device that can improve the speed of a memory interface. A packet disassembly section disassembles packet data into segments and detects packet quality information. A memory management section has an address management table and manages a state in which the packet data is stored according to the packet quality information. A segment/request information disassembler disassembles the segments into data by an access unit by which memories can be written/read, and generates write requests and read requests according to the access unit. A memory access controller avoids a bank access to which is prohibited because of a bank constraint, extracts a write request or a read request corresponding to an accessible bank from the write requests or the read requests generated, and gains write/read access to the memories. | 07-02-2009 |
20090172319 | SYSTEMS AND METHODS FOR RECOVERING ELECTRONIC INFORMATION FROM A STORAGE MEDIUM - In one embodiment of the invention, a method is provided for retrieving certain electronic information previously stored on certain storage media after a threshold set in the storage retention criteria has been exceeded in an electronic information storage system that stores electronic information on storage media in accordance with a storage retention criteria is provided. The method includes storing a record in a memory associated with a system manager that assigns the storage retention criteria to the certain electronic data, designating the storage media available for overwrite after the threshold set in the storage retention policy has been exceeded, identifying the certain storage media available for overwrite, and retrieving information from the certain media after the threshold set in the storage retention policy has been exceeded. | 07-02-2009 |
20090249000 | Method and system for error correction of a storage media - A data file on a storage media is processed during playback or execution to identify unreadable data. Replacement data corresponding to the unreadable data is obtained over a communications network, and the replacement data is used to playback or execute the data file as if the data file does not contain any unreadable data. | 10-01-2009 |
20090259815 | METHOD AND SYSTEM FOR DETERMINING MULTIPLE UNUSED REGISTERS IN A PROCESSOR - An improved method, device and system are presented for selecting a predetermined number of unused registers in a processor. The method includes partitioning registers in a processor into subsets; searching each subset for an unused register; determining whether every subset includes an unused register; if so, selecting an unused register from each subset; if not, partitioning the registers into new subsets with each subset having a different combination of registers; searching each of the new subsets for an unused register; determining whether each of the new subsets includes an unused register; if so, selecting an unused register from each new subset; and if not, searching each register serially to find the predetermined number of unused registers. | 10-15-2009 |
20090271579 | Storage subsystem and storage system - Provided is a storage subsystem that can reflect, when merging storage update information and local update information, those two kinds of update information in relevant volumes without overlapping the storage update information and the local update information. When reflecting update information in a storage subsystem | 10-29-2009 |
20090287893 | METHOD FOR MANAGING MEMORY - A method is employed to manage a memory, e.g., a flash memory, including a plurality of paired pages. Each paired page includes a page and a respective risk zone. For each write command, at least one unwritten page is selected for writing new data. For each unwritten page whose risk zone includes at least one written page, each written page is copied or backed up, and the new data is written to the unwritten page. For each unwritten page whose risk zone lacks a written page, the new data is written to the unwritten page. In an embodiment, the written page is copied only if the unwritten page and the written page are operated by different write commands. | 11-19-2009 |
20090313443 | METHODS AND SYSTEM FOR SIMPLIFIED SAS ERROR RECOVERY - Methods and systems for simplified error recovery in a SAS device. A SAS device (e.g., a SAS/SSP target device such as a storage device) enhanced in accordance with features and aspects hereof NAKs a received frame that has an error and then NAKS all subsequently received frames, regardless of whether received with or without error, until the connection is closed. The second SAS device (e.g., a SAS/SSP initiator) then performs required error recovery by re-establishing a connection and re-transmitting all previously NAKed frames. The enhanced SAS thereby simplifies logic for error recovery. | 12-17-2009 |
20090313444 | SEMICONDUCTOR STORAGE APPARATUS MANAGING SYSTEM, SEMICONDUCTOR STORAGE APPARATUS, HOST APPARATUS, PROGRAM AND METHOD OF MANAGING SEMICONDUCTOR STORAGE APPARATUS - It is an object to provide a semiconductor storage apparatus managing system for implementing a semiconductor storage apparatus which can be actually utilized in place of a hard disk apparatus. | 12-17-2009 |
20090319733 | System and Method for Aggregating Transmit Completion Interrupts - Systems and methods for aggregating transmit completion interrupts for multiple packets are provided. A network device can include a buffer with multiple memory locations capable of temporarily storing a packet being transmitted across the network via the network device and nodes connected to the network device. The network device can include a high watermark for determining when to process transmit completion interrupts. If the number of packets stored in the memory exceeds the high watermark, an aggregated transmit completion interrupt for all of the packets can be processed. Otherwise, the network device waits until sufficient packets are received to reach the high watermark. | 12-24-2009 |
20100017572 | TRANSACTIONAL MEMORY SUPPORT FOR NON-COHERENT SHARED MEMORY SYSTEMS USING SELECTIVE WRITE THROUGH CACHES - A method of controlling memory operations in a transactional shared memory system having a plurality of nodes connected through an interconnect network. The method includes initiating a memory operation at a first node including a first memory controller and a transaction table where the transaction table is configured to store a list of nodes affected by the memory operation, transmitting a store request signal through the interconnect network to a second node including a second memory controller and an access table where the store request signal includes memory operation data from the first memory controller, storing memory operation data to the access table in entries corresponding to one or more memory addresses affected by the memory operation, identifying a memory conflict with one or more nodes in the list of nodes when the one or more memory addresses affected by the memory operation are also affected by one or more conflicting transactions listed in the access table, transmitting an abort signal from the second node to each of the one or more nodes corresponding to the memory conflict, and transmitting an intent to commit signal from the first node to the second node. | 01-21-2010 |
20100030981 | Method of Clustering Shared Access Hybrid Hard Drives - A method, apparatus, and article of manufacture are provided for managing a hybrid storage device based upon the properties associated therewith. The storage device includes flash memory and physical storage. Select data is written to the flash memory and is not subject to flushing to the physical storage, and select data is either written directly to the physical storage or written to the flash memory and is subject to flushing to the physical storage. | 02-04-2010 |
20100122048 | MANAGING MEMORY PAGES - A method, and corresponding software and system, is described for paging memory used for one or more sequentially-accessed data structure. The method includes providing a data structure representing an order in which memory pages are to be reused; and maintaining the data structure according to a history of access to a memory page associated with one of the sequentially-accessed data structures. A position of the memory page in the order depends on a transition of sequential access off of the memory page. | 05-13-2010 |
20100125710 | DEVICE AND METHOD FOR REWRITING MAIN MEMORY DATA - A main memory data rewriting device includes a rewrite condition analysis unit configured to analyze a rewrite condition for target data in main memory data stored in a main memory before deactivation of an information processing device, and create a first processing content to acquire environment data substituting the target data from outside of the information processing device and a second processing content to rewrite the target data to the environment data, an environment data processing unit configured to acquire the environment data according to the first processing content when the information processing device is temporarily activated at an activation time set to rewrite the target data during a deactivating period of the information processing device, and a rewrite processing unit configured to rewrite a region of a nonvolatile storage medium in which the target data is stored with the environment data according to the second processing content. | 05-20-2010 |
20100138619 | Secure Erasure of Digital Files - One or more target files are securely erased from a host storage medium such as a disk by overwriting the target files not just with “O's,” “1's” and/or random data, but also (or instead) by overwriting them with portions of other, selected, innocuous files found on the same medium. By booting the host using a secondary, preferably external mechanism, before the host operating system is allowed to load, logging of file accesses and process execution by the host OS is circumvented. Post-replacement fragmentation and defragmentation may also be used to further reduce the detectability of the erasure, and the success of the process may be evaluated using statistical analysis. | 06-03-2010 |
20100180090 | Garbage collection barrier with direct user mode traps - A computer system includes a processor; and a memory coupled to the processor, configured to provide the processor with a plurality of instructions including a set of garbage collection instructions configured to perform one or more garbage collection barrier operations and a subsequent instruction that immediately follows the garbage collection instruction; wherein the processor is configured to execute the set of garbage collection instructions, including by: evaluating a memory reference to determine a condition associated with the set of garbage collection instructions; and in the event that the condition is met, while maintaining the same privilege level, saving information that is based at least in part on the current value of a program counter, and setting the program counter to correspond to a target location that is other than the location of the subsequent instruction. | 07-15-2010 |
20100180091 | DISCARDABLE FILES - The present application includes methods and system for managing a storage device. In one implementation, a storage allocator that is present in a host or a storage device receives a request to store a file in a storage area of the storage device. The storage allocator marks the file as discardable in a file system structure associated with the storage device and updates a primary file allocation table (“FAT”) to associate a cluster chain that is allocated to the file with the file. The storage allocator additionally updates a discardable FAT or a database to reflect a physical location of the file, or may generate one or more location files that store the physical location of the file. The storage allocator then manages the storage area device based on the FAT and a discardable FAT, database, or one more location files indicating the physical location of the file. | 07-15-2010 |
20100223437 | METHOD AND SYSTEM FOR SPILLING FROM A QUEUE TO A PERSISTENT STORE - Techniques for managing memory usage of a processing system by spilling data from a memory to a persistent store based upon an evict policy are provided. A triggering event is detected. In response to the triggering event and based on the evict policy, it is determined whether data from the memory of the processing system is to be spilled to the persistent storage. The determination is made by comparing a level of free memory of the processing system with a threshold specified by the evict policy. The data is evicted from the memory. | 09-02-2010 |
20100306484 | HETEROGENEOUS STORAGE ARRAY OPTIMIZATION THROUGH EVICTION - A storage system can comprise storage devices having storage media with differing characteristics. An eviction handler can receive information regarding the state of storage media or of data stored thereon, as well as information regarding application or operating system usage, or expected usage, of data, or information regarding policy, including user-selected policy. Such information can be utilized by the eviction handler to optimize the use of the storage system by evicting data from storage media, including evicting data in order to perform maintenance on, or replace, such storage media, and evicting data to make room for other data, such as data copied to such storage media to facilitate pre-fetching or implement policy. The eviction handler can be implemented by any one or more of processes executing on a computing device, control circuitry of any one or more of the storage devices, or intermediate storage-centric devices. | 12-02-2010 |
20110040942 | SYNCHRONIZATION OF REPLICATED SEQUENTIAL ACCESS STORAGE COMPONENTS - Various embodiments for synchronization of source and replicated instances of sequential access storage components in a computing environment by a processor device are provided. A replication synchronization table (RST) is configured for the source instance. The RST is adapted for recording compacted information for at least one of a truncate and an erase operation applied on the source instance. The RST of the source instance is updated at a source component with the compacted information. The updated RST is transmitted from the source instance to the replicated instance. Based on the RST of the source instance and the RST of the replicated instance, data representative of a most recent position on the source component from which data should be transmitted to a replicated component to achieve a full synchronization is determined. | 02-17-2011 |
20110072223 | METHOD AND SYSTEM FOR MANAGING COOKIES IN WEB COMMUNICATIONS - A system and method which may allow a Web application to manage cookies and prevent important data in cookies from being arbitrarily deleted. Cookie data may be separated into a number of tiers according to their importance. When a request to write new data to a cookie is received, the tier to which the new data belongs may be determined and compared to the tier(s) of existing data in the cookie, and existing data may be deleted from the cookie to free room for the new data only when the existing data is not more important than the new data. | 03-24-2011 |
20110093672 | SYSTEMS AND METHODS FOR RECOVERING ELECTRONIC INFORMATION FROM A STORAGE MEDIUM - In one embodiment of the invention, a method is provided for retrieving certain electronic information previously stored on certain storage media after a threshold set in the storage retention criteria has been exceeded in an electronic information storage system that stores electronic information on storage media in accordance with a storage retention criteria is provided. The method includes storing a record in a memory associated with a system manager that assigns the storage retention criteria to the certain electronic data, designating the storage media available for overwrite after the threshold set in the storage retention policy has been exceeded, identifying the certain storage media available for overwrite, and retrieving information from the certain media after the threshold set in the storage retention policy has been exceeded. | 04-21-2011 |
20110145523 | ELIMINATING DUPLICATE DATA BY SHARING FILE SYSTEM EXTENTS - A hardware and/or software facility to enable emulated storage devices to share data stored on physical storage resources of a storage system. The facility may be implemented on a virtual tape library (VTL) system configured to back up data sets that have a high level of redundancy on multiple virtual tapes. The facility organizes all or a portion of the physical storage resources according to a common store data layout. By enabling emulated storage devices to share data stored on physical storage resources, the facility enables deduplication across the emulated storage devices irrespective of the emulated storage device to which the data is or was originally written, thereby eliminating duplicate data on the physical storage resources and improving the storage consumption of the emulated storage devices on the physical storage resources. | 06-16-2011 |
20110145524 | INFORMATION RECORDING MEDIUM, INFORMATION RECORDING DEVICE, INFORMATION RECORDING METHOD, INFORMATION REPRODUCING DEVICE, AND INFORMATION REPRODUCING METHOD - According to the present invention, the size of defect management information is reduced by using a top spare area | 06-16-2011 |
20110153963 | Memory Controller and Associated Control Method - A memory controller and an associated controlling method are provided. The memory controller is connected to a memory module, and includes a FIFO buffer for receiving valid data outputted from the memory module, a write pointer for indicating written data stored in the FIFO buffer, and a read pointer for indicating read data stored in the FIFO buffer. According to the controlling method, during a CAS latency of the memory module after a read command is generated, the value of the write pointer is controlled to have the same value as that of the read pointer. | 06-23-2011 |
20110167231 | Value Recycling Facility for Multithreaded Computations - Solutions to a value recycling problem facilitate implementations of computer programs that may execute as multithreaded computations in multiprocessor computers, as well as implementations of related shared data structures. Some exploitations allow non-blocking, shared data structures to be implemented using standard dynamic allocation mechanisms (such as malloc and free). Some exploitations allow non-blocking, indeed even lock-free or wait-free, implementations of dynamic storage allocation for shared data structures. In some exploitations, our techniques provide a way to manage dynamically allocated memory in a non-blocking manner without depending on garbage collection. While exploitations of solutions to the value recycling problem that we propose include management of dynamic storage allocation wherein values managed and recycled tend to include values that encode pointers, they are not limited thereto. Indeed, the techniques are more generally applicable to management of values in a multithreaded computation. For example, value recycling techniques may be exploited, in some cases, apart from dynamic storage allocation, to allow a multithreaded computation to avoid the classic ABA hazard. | 07-07-2011 |
20110208927 | VIRTUAL MEMORY - This document describes techniques and apparatuses enabling virtual memory for network-enabled computing devices. These techniques and apparatuses may enable network-enabled computing devices to avoid, or reduce the chances of, having little or no available memory. | 08-25-2011 |
20110231623 | Garbage Collection Management in a Data Storage Device - Method and apparatus for handling data in a data storage device. In accordance with some embodiments, a memory space with a plurality of garbage collection units (GCUs) that are each arranged into pages of memory that store user data identified by logical addresses (LAs) and each GCU has a metadata region that stores metadata that correlates the LAs with physical addresses (PAs). A header region in each page of memory stores a bitmask and a sequence map of the LAs in each page that are used by a log manager to creates a bitmask table stored in a first cache and a hierarchical log stored in a second cache. The bitmask table and hierarchical log are used to determine when the LAs stored in the selected GCU are stale, and update the bitmask for each page in the selected GCU after the stale data has been erased. | 09-22-2011 |
20110264874 | LATENCY CONTROL CIRCUIT AND METHOD USING QUEUING DESIGN METHOD - A latency control circuit includes a FIFO controller and a register unit. The FIFO controller may generate an increase signal according to an external command, and generate a decrease signal according to an internal command. The FIFO controller may also enable a depth point signal responsive to the increase signal and the decrease signal. The register unit may include n registers. The value n (rounded off) may be obtained by dividing a larger value of a maximum number of additive latencies and a maximum number of write latencies by a column cycle delay time (tCCD). The registers may store an address received with the external command responsive to the increase signal and a clock signal, and may shift either the address or a previous address to a neighboring register. The latency control circuit transmits an address stored in a register as a column address corresponding to the enabled depth point signal. | 10-27-2011 |
20110276769 | DATA PROCESSOR - A system is described that generates reports from very large data sets. The reports are generated in real-time (or close to real time). Data from the large data set is replicated to a buffer as it arrives in the system. Once sufficient data is obtained (e.g. when the buffer is filled), the data is processed to generate a report. The report may summarize the data obtained and may be stored for later use. By storing summary data instead of the full data, the data storage requirements are reduced. | 11-10-2011 |
20110289288 | USING TYPE STABILITY TO FACILITATE CONTENTION MANAGEMENT - Various technologies and techniques are disclosed for providing type stability techniques to enhance contention management. A reference counting mechanism is provided that enables transactions to safely examine states of other transactions. Contention management is facilitated using the reference counting mechanism. When a conflict is detected between two transactions, owning transaction information is obtained. A reference count of the owning transaction is incremented. The system ensures that the correct transaction was incremented. If the owning transaction is still a conflicting transaction, then a contention management decision is made to determine proper resolution. When the decision is made, the reference count on the owning transaction is decremented by the conflicting transaction. When each transaction completes, the reference counts it holds to itself is decremented. Data structures cannot be deallocated until their reference count is zero. Dedicated type-stable allocation pools can be reduced using an unstable attribute. | 11-24-2011 |
20110296125 | LOW LATENCY HANDOFF TO OR FROM A LONG TERM EVOLUTION NETWORK - A server device in a long term evolution (LTE) network may store, in a memory, context information, associated with a prior communication session between the LTE network and a user device, where the context information permits a communication session to be established within a time period, the time period being less than another time period to initially establish the communication session or to establish the communication session without the context information. The server device may further receive a registration request associated with the user device; determine whether the memory stores the context information; perform, within the time period, an abbreviated registration operation to establish the communication session with the user device, using the context information from the memory, when the memory stores the content information; and perform, within the other time period, a registration operation to establish the communication session when the memory does not store the context information. | 12-01-2011 |
20110302380 | METHOD OF STORING LOGICAL DATA OBJECTS AND SYSTEM THEREOF - Various embodiments for storing a logical object are provided. In one such embodiment, by way of example only, incoming data is divided corresponding to a logical data object into a plurality of independent streams, associating each data chunk of a plurality of obtained data chunks with a corresponding stream among the plurality of independent streams. At least one of the obtained data chunks and derivatives thereof is sequentially accommodated in accordance with an order the obtained chunks are received, while keeping the association with the corresponding streams. A global index is generated as a single meta-data stream accommodated in the logical data object and comprising information common to the plurality of independent streams and related to mapping between data in the logical data object and the obtained data chunks. | 12-08-2011 |
20120030438 | Method and Apparatus for Performing Skew Removal in the Receiver of a Multi-Lane Communication Link - Serial data streams received on multiple data lanes, wherein each data stream is in the form of a series of blocks including a data block preceded by a synchronization block, are deskewed by setting a detection flag in response to the valid detection of one or more synchronization blocks in each data stream, writing received data following the setting of said detection flag for that data stream to memory, and reading data sequentially from each memory under the control of a common output clock in response to the setting of the flag in respect at least a group of the data streams. | 02-02-2012 |
20120066462 | UPDATING MULTI-MEDIA CONTENT IN A DIGITAL DOWNLOAD KIOSK - A method of updating multi-media content at a digital download kiosk is described. The method comprises receiving a secure portable storage device into a portable device reader/writer in the kiosk; reading the secure portable storage device to ascertain if authorized multi-media content is stored thereon; uploading the multi-media content from the secure portable storage device to a data store accessible by the kiosk; and indicating when the multi-media content has been uploaded. The portable storage device may have been received by mail from a supplier, and the method may further comprise removing the portable storage device from the portable storage device reader/writer, and returning the removed portable storage device to the supplier by mail. | 03-15-2012 |
20120072683 | Managing Write Operations in a Computerized Memory - A method and apparatus for managing write operations in memory. The method includes a memory including units, each of the units including subunits. Data updates are written “out-of-place”, in that new data does not overwrite the memory locations (subunits) where the data is currently stored. The at least one subunit containing the outdated data is marked as invalid. As a result, a subunit can contain up to date data in a valid subunit next to invalid subunits. For reclaiming units for erasure, it is searched amongst the units to identify a unit or units that match a predetermined criterion. The data of valid subunits of such identified unit is rewritten to another unit or units. | 03-22-2012 |
20120096229 | STORAGE CONTROL APPARATUS AND STORAGE CONTROL APPARATUS MEMORY CONTROL METHOD - A storage control apparatus of the present invention is able to duplicatively manage data in a cache memory even during maintenance work. When a memory package CMPK | 04-19-2012 |
20120110285 | INFORMATION STORAGE MEDIUM, RECORDING/REPRODUCING APPARATUS, AND RECORDING/REPRODUCING METHOD - A recording/reproducing apparatus is configured to record a replacement block by logical overwrite (LOW) for updating data recorded on an information storage medium in a first area of the medium, record a replacement block for replacing a defect block generated on the medium in a second area of the medium, and record a second replacement block for replacement by defect of a first replacement block in the second area if the defect is detected while the first replacement block is being recorded in the first area to perform the logical overwrite of an original block recorded in a predetermined area of the medium, generate a defect list (DFL) entry including location information of the original block and location information of the second replacement block in order to indicate the replacement state, and move location information of the first replacement block in the second replacement block. | 05-03-2012 |
20120117339 | FLEXIBLE CONTENT STORAGE MANAGEMENT FOR DVRS - A media broker comprises a communication interface and a controller associated with the communication interface configured to receive a request from a user to record a requested media item. The media broker proceeds to query an aggregated stored content list (ASCL) including information indicative of each of the media items stored on one or more media storage device communicatively coupled to the media broker to determine if the requested media item is stored on the one or more media storage devices. If it is determined that the requested media item is stored on the one or more media storage devices the user that requested the media item is informed and the media item is stored on the one or more media storage devices. Conversely, if it is determined that the requested media item is not stored on the one or more media storage devices, the requested media item is recorded. | 05-10-2012 |
20120117340 | DATA ADMINISTRATION UNIT, DATA ACCESS UNIT, NETWORK ELEMENT, NETWORK, AND METHOD FOR UPDATING A DATA STRUCTURE - A data administration unit for updating a first data structure in a first memory may comprise a second memory, a data structure generator for setting up a second data structure in the second memory, a pointer generator for setting at least one of a dynamic change indicator and a pointer in the first data structure, a waiting unit for waiting for a finalization of a data access of a data access unit, and a data structure over-writer for overwriting the first data structure using data of the second data structure. An data access unit for accessing a first data structure in a first memory may comprise a data access driver, a first synchronization signal evaluator for reception and evaluation of a first synchronization signal, and a synchronization approval signal generator for generation and submission of a first synchronization signal. | 05-10-2012 |
20120117341 | METHOD AND SYSTEM FOR TRANSFORMATION OF LOGICAL DATA OBJECTS FOR STORAGE - There are provided a method of transforming a non-transformed stored logical data object (LO) device into a transformed LO and system thereof. The method comprises: a) in response to a respective transformation request, logically dividing the non-transformed LO in a first segment and one or more non-transformed subsequent segments, the segments having predefined size; b) generating a header for the respective transformed LO; c) processing said first segment; d) overwriting said first segment by said generated header and said transformed first segment; e) indexing said first transformed segment and said one or more non-transformed subsequent segments as constituting a part of said transformed LO; f) generating at least one index section; and g) updating the indication in the header to point that the non-transformed LO has been transformed in the transformed LO comprising said generated header, said first transformed segment, said one or more subsequent segments comprising data in non-transformed form and said at least one index section. | 05-10-2012 |
20120124304 | MEMORY BLOCK MANAGEMENT - One or more embodiments comprise control circuitry coupled to one or more memory devices having a number of planes of physical blocks organized into super blocks. The control circuitry can be configured to: determine defective physical blocks among the number of planes; responsive to none of the physical blocks at a particular block position being determined to be defective, assign the physical blocks at the particular block position to a super block; and responsive to one or more of the physical blocks at a particular block position being determined to be defective, assign non-defective physical blocks at the particular block position to a super block and assign a replacement physical block to the super block for the respective defective physical blocks at the particular block position, the replacement physical block selected from a number of physical blocks within a respective plane that includes a respective defective physical block. | 05-17-2012 |
20120159095 | INTERFACE SYSTEM, AND CORRESPONDING INTEGRATED CIRCUIT AND METHOD - An interface system for interfacing an asynchronous circuit with a synchronous circuit, wherein the synchronous circuit samples, in response to a clock signal, a first data signal when a first control signal indicates that the first data signal contains valid data, and wherein the asynchronous circuit generates a second data signal according to an asynchronous communication protocol. The system includes a FIFO memory, a control circuit for asynchronously writing the second data signal in the memory when the second data signal indicates the start of a communication, and synchronously reading the second data signal from the memory in response to a clock signal, and a conversion circuit for decoding, according to a asynchronous communication protocol, the second data signal read from the memory in a decoded data signal, wherein the decoded data signal corresponds to the first data signal. | 06-21-2012 |
20120166744 | MEMORY MANAGEMENT METHOD, COMPUTER SYSTEM, AND STORAGE MEDIUM HAVING PROGRAM STORED THEREON - A memory management method, which is used in a computer including a CPU and a memory to unload an area no longer necessary out of a memory area used by a program stored in the memory and executed by the CPU, comprising: generating a first processing system for executing the program in the memory; generating a second processing system in the memory when a first opportunity occurs; copying a content of a memory area of the first processing system to a memory area of the second processing system; determining an unnecessary area out of the copied memory area of the second processing system; transmitting a determination result regarding the unnecessary area to the program of the first processing system when a second opportunity occurs receiving the determination result; unloading the unnecessary area in the memory area of the first processing system. | 06-28-2012 |
20120179884 | COMMUNICATION SYSTEM, INFORMATION PROCESSING APPARATUS, COMPUTER-READABLE STORAGE MEDIUM, AND COMMUNICATION METHOD - Prior to performing download play, it is determined whether or not a slave apparatus program has been already stored in an internal memory of a slave apparatus. When not stored yet, the slave apparatus program is transmitted from a master apparatus to the slave apparatus, and stored in the internal memory of the slave apparatus. When already stored, the slave apparatus program is not transmitted from the master apparatus to the slave apparatus. Then, multiplay is performed by performing mutual communication between the master apparatus operating in accordance with a master apparatus game program and the slave apparatus operating in accordance with a slave apparatus game program. Thus, time and effort for receiving the same application program more than once are omitted, and it is possible to efficiently start a communication process. | 07-12-2012 |
20120185657 | SYSTEMS AND METHODS FOR RECOVERING ELECTRONIC INFORMATION FROM A STORAGE MEDIUM - In one embodiment of the invention, a method is provided for retrieving certain electronic information previously stored on certain storage media after a threshold set in the storage retention criteria has been exceeded in an electronic information storage system that stores electronic information on storage media in accordance with a storage retention criteria is provided. The method includes storing a record in a memory associated with a system manager that assigns the storage retention criteria to the certain electronic data, designating the storage media available for overwrite after the threshold set in the storage retention policy has been exceeded, identifying the certain storage media available for overwrite, and retrieving information from the certain media after the threshold set in the storage retention policy has been exceeded. | 07-19-2012 |
20120198186 | MEMORY DEVICE AND MEMORY SYSTEM - A memory device includes a plurality of nonvolatile memories configured to be erased at updating of data, and a memory controller configured to control the nonvolatile memory. The memory controller includes an address conversion table configured to convert a logical address specified by at data writing into a physical address of the nonvolatile memory, an erased physical block managing unit configured to manage an erased physical block address, the nonvolatile memory of the erased physical block address, and an erased physical block count on each nonvolatile memory, an erasable physical block managing unit configured to manage an erasable physical block address, the nonvolatile memory of the erasable physical block address, and an erasable physical block count on each nonvolatile memory, and a memory control unit configured to control writing and erasing on the plurality of nonvolatile memories. | 08-02-2012 |
20120221811 | RETENTION MANAGEMENT IN A WORM STORAGE SYSTEM - A write-once-read-many, WORM, storage system is arranged to store datasets each with associated attributes including a WORM attribute indicating the dataset's WORM status, and to protect from change or deletion WORM datasets, and at least certain of their attributes including those relevant to WORM status. Retention management capabilities are provided for such a storage system, including the ability to set a given dataset for retention for a particular retention period by storing a corresponding retention date in an attribute of the dataset, and setting the WORM attribute to indicate that the dataset is a WORM dataset. Also provided is the ability to determine expiry of the retention period for the given dataset, and then to remove the stored retention date and change the WORM attribute of the dataset to indicate that it is no longer a WORM dataset. | 08-30-2012 |
20120239891 | DYNAMIC REUSE AND RECONFIGURATION OF LOGICAL DATA OBJECTS IN A VIRTUAL TAPE SYSTEM - A method in one embodiment for operating a virtual server supporting at least one Write Once Read Many (WORM) logical data object and at least one read-write logical object includes initializing a logical data object from a common pool of the logical data objects, the logical data object bound with a member of a media type group, the member of the media type group comprising a WORM logical data object and a read-write logical data object; and reusing one of the logical data objects as the member of the media type group without ejection and reinsertion by mounting the logical data object with a write from beginning of logical data object to bind at least one data attribute to the member of the media type group to replace any previous attribute and data associated with the logical data object. | 09-20-2012 |
20120278566 | Intelligent Partitioning of External Memory Devices - Multiple memory devices, such as hard drives, can be combined and logical partitions can be formed between the drives to allow a user to control regions on the drives that will be used for storing content, and also to provide redundancy of stored content in the event that one of the drives fails. Priority levels can be assigned to content recordings such that higher value content can be stored in more locations and easily accessible locations within the utilized drives. Users can control and organize how recorded content is stored between the drives such that an external drive may be removed from a first gateway device and attached to a second gateway device without losing the ability to access the recorded content from the first gateway device at a later time. In this manner, a user is provided with the ability to transport an external drive containing stored content recordings between multiple different gateway devices such that the recordings may be accessed at different locations or user premises. | 11-01-2012 |
20120284469 | MEMORY SYSTEM AND BAD BLOCK MANAGEMENT METHOD - Disclosed is a bad block management method of a memory system that includes virtual blocks having a plurality of units and at least one reserved block. The bad block management method includes mapping the virtual blocks and the at least one reserved block onto one physical block in the plurality of physical blocks, determining that a first virtual block in the virtual blocks includes a bad virtual block unit, and replacing the bad virtual block unit in the first virtual block with a first reserved block unit selected from the reserved block units. | 11-08-2012 |
20120284470 | SEMICONDUCTOR MEMORY DEVICE WITH HIGH-SPEED DATA TRANSMISSION CAPABILITY, SYSTEM HAVING THE SAME, AND METHOD FOR OPERATING THE SAME - Semiconductor memory device with high-speed data transmission capability, system having the same includes a plurality of address input circuits and a plurality of data output circuits and a training driver configured to distribute address information input through the plurality of address input circuits together with a data loading signal for a read training, and generate data training patterns to be output through the plurality of data output circuits. | 11-08-2012 |
20120290800 | METHOD AND APPARATUS TO REDUCE MEMORY READ LATENCY - A method and apparatus for training read latency of a memory are disclosed. A memory controller includes a command FIFO configured to convey commands to a memory, a data queue coupled to receive data from the memory, and a register configured to provide a value indicative of a number of cycles of a first clock signal after which data is valid. During a startup routine, the memory controller is configured to compare data received by the data queue to a known data pattern after a specified number of cycles of the first clock signal have elapsed. The memory controller is further to configured to decrement the first value and repeat conveying and comparing if the data received matches the data pattern. If the received data does not match the data pattern for any attempted read of the memory, the memory controller is configured to program a second value into the register. | 11-15-2012 |
20120290801 | CONTROLLING STORING OF DATA - First characteristic information indicating a characteristic of input data is extracted from the input data that is input as data to be stored in any of the storages. Second characteristic information elements are read from a memory unit storing the second characteristic information elements indicating respective characteristics of stored data elements stored in the storages. A specific storage in which the input data is to be stored is determined, out of the storages, by determining a degree of match between the extracted first characteristic information and the second characteristic information elements read. The input data to the determined specific storage is read. The second characteristic information element indicating the characteristic of the stored data element stored in the specific storage is updated, out of the second characteristic information elements retained in the memory unit, on the basis of the extracted first characteristic information. | 11-15-2012 |
20120303911 | ELECTRONIC DEVICE WITH REVERSING STACK DATA CONTAINER AND RELATED METHODS - An electronic device may include a memory, and a processor coupled to the memory for storing and accessing data in the memory. The processor may arrange the data in a stack data container including values extending from a stack top to a stack bottom, operate the stack data container in first and second modes of operation, and while in the first mode of operation, push and pop a respective value from the stack top of the stack data container. The processor may also while in the second mode, reverse an orientation of the stack data container and the values therein, and push and pop a respective value from the stack bottom of the reversed stack data container. | 11-29-2012 |
20120311278 | DELETE NOTIFICATIONS FOR AN ENTIRE STORAGE DEVICE - A delete notification can be received at a storage stack filter in a storage stack. It can be determined whether the delete notification applies to an entire storage device. If the delete notification does not apply to the entire storage device, a first set of actions can be taken with the storage stack filter in response to the delete notification. If the delete notification does apply to the entire storage device, a second set of actions can be taken with the storage stack filter in response to the delete notification. | 12-06-2012 |
20120317380 | DEVICE AND METHOD FOR A HALF-RATE CLOCK ELASTICITY FIFO - A device and method for processing an incoming data stream in a half-rate clock elasticity first in first out (FIFO) are disclosed. In one embodiment, two data blocks are written substantially simultaneously to two locations in the elasticity FIFO specified by respective two write pointers in a write clock cycle of a write clock. Further, two data blocks are read substantially simultaneously from two consecutive or non-consecutive locations in the elasticity FIFO specified by two read pointers in a read clock cycle of a read clock. The two read pointers can independently adjust locations to read in the plurality of locations based on a type of the data blocks in the elasticity FIFO and a predetermined elasticity FIFO threshold level in the read clock cycle to maintain the elasticity FIFO level at predetermined elasticity FIFO threshold level to achieve a constant output rate. | 12-13-2012 |
20120324181 | DETECTING AND SUPPRESSING REDUNDANT INPUT-OUTPUT OPERATIONS - In a virtual machine, swap activities of a hypervisor and a guest OS are reconciled so that redundant input-output operations (IOs) can be avoided and a synchronous response time of the virtual machine improved. This is achieved with a map of memory pages to blocks of storage. For a write IO to write contents of a memory page into a target block, the map is examined to see if it contains a valid entry for the memory page. If the map contains the valid entry, the write IO is prevented from being issued and a data structure is updated so that subsequent IOs to the target block is redirected from the target block to a block that is associated with the physical memory page in the valid entry. On the other hand, if the map does not contain the valid entry, the write IO is issued. | 12-20-2012 |
20130013873 | SYSTEM AND METHOD FOR OPTIMIZING DATA IN VALUE-BASED STORAGE SYSTEM - A storage system includes a plurality of data vats, and a processor including an optimizing unit that optimizes a value of data stored in the storage system. The optimizing unit optimizes the value by computing and implementing an optimal decision for allocating new data to a first data vat of the plurality of data vats, moving existing data from at least a second data vat of the plurality of data vats to the first data vat, and deleting existing data from the first data vat, based on an amount of data in each of the plurality of data vats. | 01-10-2013 |
20130036276 | INSTRUCTIONS TO SET AND READ MEMORY VERSION INFORMATION - Systems and methods for providing additional instructions for supporting efficient memory corruption detection in a processor. A physical memory may be a DRAM with a spare bank of memory reserved for a hardware failover mechanism. Version numbers associated with data structures allocated in the memory may be generated so that version numbers of adjacent data structures are different. A processor determines that a fetched instruction is a memory access instruction corresponding to a first data structure within the memory. For instructions that are not a version update instruction, the processor compares the first version number and second version number stored in a location in the memory indicated by the generated address and flags an error if there is a mismatch. For version update instructions, the processor performs a memory access operation on the second version number with no comparison check. | 02-07-2013 |
20130036277 | STORAGE SYSTEM - The storage system includes a first auxiliary storage device, a second auxiliary storage device, and a main storage device, and also includes a data management unit which stores and keeps, in the main storage device, index data based on feature data by referring to the feature data of storage target data stored in the first auxiliary storage device, and if the index data stored and kept in the main storage device reaches a preset amount, stores and keeps, in the second auxiliary storage device, the index data stored and kept in the main storage device, and deletes the index data stored and kept in the second auxiliary storage device from the main storage device. | 02-07-2013 |
20130054906 | MANAGING DEREFERENCED CHUNKS IN A DEDUPLICATION SYSTEM - A chunk index has information on chunks in a storage space referenced in objects in the storage space. The chunk index includes a reference count for each chunk indicating a number of objects in which the chunk is referenced and a reference measurement representing a level of data object references to the chunk. One chunk is selected to remove from the storage space based on a criteria applied to the reference measurements of chunks having reference counts indicating that the chunks are not referenced in one object in the storage space. | 02-28-2013 |
20130054907 | STORAGE SYSTEM, STORAGE CONTROL APPARATUS, AND STORAGE CONTROL METHOD - A storage system including first storage devices constituting a first logical storage area, second storage devices constituting a second logical storage area; and a storage control apparatus. The storage control apparatus manages the first and second logical storage areas so that the data stored in the first and second logical storage areas have redundancy, and parity data for the data stored in the second logical storage area are stored in parity storage areas arranged in part of the second storage devices. When part of the first storage devices constituting part of the first logical storage area fail, the storage control apparatus generates part of the data stored, before the failure, in the part of the first storage devices, and stores the generated part of the data in at least part of the second parity storage areas in the second logical storage area. | 02-28-2013 |
20130061012 | VIRTUAL MACHINE CODE INJECTION - A memory has a page to store code executable by a processor. A management component is to inject the code into a virtual machine. The management component is to indicate within a memory table for the virtual machine that the page of the memory has an injected code type. | 03-07-2013 |
20130067179 | NONVOLATILE MEDIA DIRTY REGION TRACKING - A storage set (e.g., an array of hard disk drives) may experience a failure, such as a loss of power, a software crash, or a disconnection of a storage device, while writes to the storage set are in progress. Recover from the failure may involve scanning the storage set to detect and correct inconsistencies (e.g., comparing mirrors of a data set or testing checksums). However, lacking information about the locations of pending writes to the storage set during the failure, this “cleaning” process may involve scanning the entire storage set, resulting in protracted recovery processes. Presented herein are techniques for tracking writes to the storage set by apportioning the storage set into regions of a region size (e.g., one gigabyte), and storing on the nonvolatile storage medium descriptors of “dirty” regions comprising in-progress writes. The post-failure recovery process may then be limited to the regions identified as dirty. | 03-14-2013 |
20130132690 | SELECTIVE ACCESS TO EXECUTABLE MEMORY - In an embodiment, a data processing method comprises, in a computer executing a supervisor program: the supervisor program establishing a plurality of different memory access permissions comprising any combination of read, write, and execute permissions for one or more different regions of memory of a first domain; setting the memory access permissions of a first set of the regions of memory to execute only; in response to a request from a process to read or write a particular region of memory in the first set, performing one or more responsive actions that prevent the process from reading or modifying one or more instructions or one or more embedded immediate values of the particular region of memory. Embodiments provide selective access to executable memory. | 05-23-2013 |
20130151800 | NUCLEAR MEDICINE IMAGING APPARATUS AND CONTROL METHOD - According to one embodiment, a nuclear medicine imaging apparatus includes a counting information collection unit, a determination unit, and a discarding unit. The counting information collection unit collects counting information including detection time of a gamma ray from a counting result output by a detector for counting light derived from a gamma ray, and stores the counting information in a buffer. The determination unit determines whether the volume of the counting information stored in the buffer exceeds a threshold. The discarding unit, in a case that the determination unit determines that the volume exceeds the threshold, intermittently discards, in chronological order, counting information whose detection time is within longer duration than predetermined duration used for generating two pieces of counting information obtained by counting pair annihilation gamma rays nearly coincidentally as coincidence counting information among the counting information collected from the detector. | 06-13-2013 |
20130205106 | MAPPING GUEST PAGES TO DISK BLOCKS TO IMPROVE VIRTUAL MACHINE MANAGEMENT PROCESSES - In a virtualized computer system, guest memory pages are mapped to disk blocks that contain identical contents and the mapping is used to improve management processes performed on virtual machines, such as live migration and snapshots. These processes are performed with less data being transferred because the mapping data of those guest memory pages that have identical content stored on disk are transmitted instead of the their contents. As a result, live migration and snapshots can be carried out more quickly. The mapping of the guest memory pages to disk blocks can also be used to optimize other tasks, such as page swaps and memory error corrections. | 08-08-2013 |
20130212343 | DATA PROCESSING METHOD, DATA PROCESSING APPARATUS, AND DATA PROCESSING PROGRAM - Buffer management unit selects the input and output buffer to be set as a replacement target referring to the input and output buffers in order and calculates the number of times of replacement execution for the input and output buffer and reference speed for referring to the input and output buffers in order. At execution of pre-write processing, the pre-write management unit selects, according to position information of the input and output buffer subjected to the last pre-write processing, position information, and the number of times of replacement execution, the input and output buffer to be set as a target of the present pre-write processing. When updated data is present in the input and output buffer, the pre-write management unit writes the data in the secondary storage device and executes the next pre-write processing according to the reference speed. | 08-15-2013 |
20130212344 | SELECTIVE RETIREMENT OF BLOCKS - Systems and methods are provided for selectively retiring blocks based on refresh events of those blocks. In addition to refresh events, other criteria may be applied in making a decision whether to retire a block. By applying the criteria, the system is able to selectively retire blocks that may otherwise continue to be refreshed. | 08-15-2013 |
20130219135 | DYNAMIC TIME REVERSAL OF A TREE OF IMAGES OF A VIRTUAL HARD DISK - A technique manages a virtual hard disk tree in a computing system executing a hypervisor to provide a client virtualization environment. The technique involves linking, by a client executing within a control virtual machine of the client virtualization environment, a first delta image of a virtual hard disk generated later in time to a base image of the virtual hard disk. The technique further involves modifying contents of the first delta image, the base image, and a second delta image which is linked to the base image; and deleting the second delta image after modifying the contents of the first delta image, the base image, and the second delta image. The base image and the first delta image, together with additional delta images of the virtual hard disk comprise a tree of images of the virtual hard disk. | 08-22-2013 |
20130232309 | CONTENT ALIGNED BLOCK-BASED DEDUPLICATION - A content alignment system according to certain embodiments aligns a sliding window at the beginning of a data segment. The content alignment system performs a block alignment function on the data within the sliding window. A deduplication block is established if the output of the block alignment function meets a predetermined criteria. At least part of a gap is established if the output of the block alignment function does not meet the predetermined criteria. The predetermined criteria is changed if a threshold number of outputs fail to meet the predetermined criteria. | 09-05-2013 |
20130262798 | VIRTUALIZATION SYSTEM USING HARDWARE ASSISTANCE FOR SHADOW PAGE TABLE COHERENCE - One embodiment of the present invention includes a method for maintaining a shadow page table in at least partial correspondence with guest page mappings of a guest computation. The method marking with a traced write indication at least those entries of the shadow page table that map physical memory locations which themselves encode the guest page mappings, the marking identifying, for a hardware facility, a subset of memory access targets for which updates are to be recorded in a guest write buffer accessible to the virtualization system. Responsive to a coherency-inducing operation of the guest computation, the method reads from the guest write buffer and introduces corresponding updates into the shadow page table. | 10-03-2013 |
20130282995 | ALIGNMENT FOR MULTIPLE FIFO POINTERS - In described embodiments, a multiple first-in, first-out buffer pointers (multi-FIFO pointers) alignment system includes synchronization circuitry to align multiple FIFO buffer operations. A FIFO read clock stoppage signal is generated by master logic that stops the read clock shared by all the transmit channels and then re-starts the read clock to align them. The FIFO read clock stoppage signal is applied to the read clock of all FIFOs which need to be aligned and, when rate change is needed, the FIFO read clock stoppage signal suspends the read clock, causing local write and read pointers to be reset. After the FIFO read clock stoppage signal is de-asserted, the read clock starts to all FIFOs concurrently, thereby aligning the channels. | 10-24-2013 |
20130311731 | SYSTEM AND METHOD OF MAKING GOLDEN MASTER - A system and method of making golden master is disclosed. A user image is burned to a hard disk drive. The user image includes a user partition. A user partition record pointing to the user partition is stored in the disk partition table (DPT) of the hard disk drive. A DPT clearing module removes the user partition record from the DPT. A diagnostic partition is established between the starting sector address and the ending sector address of the user partition in the hard disk drive. A diagnostic partition record pointing to the diagnostic partition is written into the DPT. A partition record resuming module adds back the user partition record into the DPT. | 11-21-2013 |
20130346707 | PARTITIONED REFERENCE COUNTER - Resource use is recorded with a partitioned reference counter. The sum of all resource counter partitions is equivalent to the total references to a resource. When one resource counter partition reaches zero, it is possible that the resource should be destroyed. To determine if this is the case, all other partitions can be checked for a value of zero. If all the partitions are zero, the resource can be destroyed. Coarse grained partitioning and add/release on all partitions can be employed to avoid extra work associated with a local partition reaching zero. Further, destroying or deleting a resource can be accomplished in a manner that avoids a race condition. | 12-26-2013 |
20140019695 | Systems and Methods for Rapid Erasure Retry Decoding - The present invention is related to processing data sets, and more specifically to recovering problematic portions of a data set. | 01-16-2014 |
20140019696 | METHODS AND APPARATUS FOR POINT-IN-TIME VOLUMES - Methods and apparatus for point-in-time volumes are provided. A relationship is enabled between a source volume and point-in-time volume. Copying a data chunk to the point-in-time volume before a write operation modifies the data chunk on the source volume dynamically creates the point-in-time volume. The point-in-time volume can be accessed in read/write mode as a general purpose data storage volume. Other embodiments comprising additional features, such as a forced migration process, are also provided. | 01-16-2014 |
20140032860 | SEMICONDUCTOR INTEGRATED CIRCUIT AND METHOD FOR OPERATING SAME - First data to be written which is output from a function module ( | 01-30-2014 |
20140040572 | REQUEST ORDERING SUPPORT WHEN SWITCHING VIRTUAL DISK REPLICATION LOGS - Storage access requests, such as write requests, are received from a virtual machine. A storage request processing module updates one of multiple virtual disks as directed by each of the storage access requests, and a replication management module stores information associated with each storage access request in one of multiple logs. The logs can be transferred to a recovery device at various intervals and/or in response to various events, which results in switching logs so that the replication management module stores the information associated with each storage access request in a new log and the previous (old) log is transferred to the recovery device. During this switching, request ordering for write order dependent requests is maintained at least in part by blocking processing of the information associated with each storage access request. | 02-06-2014 |
20140052945 | OPTIMIZING STORAGE SYSTEM BEHAVIOR IN VIRTUALIZED CLOUD COMPUTING ENVIRONMENTS BY TAGGING INPUT/OUTPUT OPERATION DATA TO INDICATE STORAGE POLICY - A method, system and computer program product for optimizing storage system behavior in a cloud computing environment. An Input/Output (I/O) operation data is appended with a tag, where the tag indicates a class of data for the I/O operation data. Upon the storage controller reviewing the tag appended to the I/O operation data, the storage controller performs a table look-up for the storage policy associated with the determined class of data. The storage controller applies a map to determine a storage location for the I/O operation data in a drive device, where the map represents a logical volume which indicates a range of block data that is to be excluded for being stored on the drive device and a range of block data that is to be considered for being stored on the drive device. In this manner, granularity of storage policies is provided in a cloud computing environment. | 02-20-2014 |
20140052946 | TECHNIQUES FOR OPPORTUNISTIC DATA STORAGE - Techniques for opportunistic data storage are described. In one embodiment, for example, an apparatus may comprise a data storage device and a storage management module, and the storage management module may be operative to receive a request to store a set of data in the data storage device, the request indicating that the set of data is to be stored with opportunistic retention, the storage management module to select, based on allocation information, storage locations of the data storage device for opportunistic storage of the set of data and write the set of data to the selected storage locations. Other embodiments are described and claimed. | 02-20-2014 |
20140068205 | SYSTEMS AND METHODS FOR MANAGING QUEUES - Described are systems and methods for transmitting data at an aggregation device. The aggregation device includes a record queue and an output bypass queue. The data is received from an electronic device. A record is generated of the received data. The record is placed in the record queue. A determination is made that the record in the record queue is blocked. The blocked record is transferred from the record queue to the output bypass queue. | 03-06-2014 |
20140068206 | METHODS AND SYSTEMS FOR DATA CLEANUP USING PHYSICAL IMAGE OF FILES ON STORAGE DEVICES - Methods, systems, and computer program products are provided for optimizing selection of files for eviction from a first storage pool to free up a predetermined amount of space in the first storage pool. A method includes analyzing an effective space occupied by each file of a plurality of files in the first storage pool, identifying, from the plurality of files, one or more data blocks making up a file to free up the predetermined amount of space based on the analysis of the effective space of each file of the plurality of files, selecting one or more of the plurality of files as one or more candidate files for eviction, based on the identified one or more data blocks, and evicting the one or more candidate files for eviction from the first storage pool to a second storage pool. | 03-06-2014 |
20140075136 | Efficient metadata protection system for data storage - A method for protecting page-level metadata in a storage system is provided. The method includes providing in a page table first protection data, receiving a command to read data from a page of the storage system corresponding to the page table, and comparing first protection data to second protection data. If the first protection data is different than the second protection data, then the method includes identifying third protection data in the storage system and comparing the third protection data to the first protection data. If the third protection data is different than the first protection data, then the method includes determining that the page-level metadata is inconsistent. | 03-13-2014 |
20140075137 | METHOD OF MANAGING MEMORY - A method of managing a memory that can quickly secure an available space is provided. The method includes recording compression ratios of data stored in pages of a main memory, and securing space of the main memory when the main memory has insufficient available space, by compressing data of pages having a compression ratio of a standard value or greater among pages of the main memory and storing the compressed data in the main memory. | 03-13-2014 |
20140101396 | COUNTER-BASED ENTRY INVALIDATION FOR METADATA PREVIOUS WRITE QUEUE - Embodiments of the invention relate to counter-based entry invalidation for a metadata previous write queue (PWQ). An aspect of the invention includes writing an address into an entry in the metadata PWQ, the address being associated with an instance of metadata received from a pipeline and setting a valid tag associated with the entry in the metadata PWQ to valid. Another aspect of the invention includes initializing a counter to zero and incrementing the counter based on receiving a count signal from the pipeline until the counter is equal to a threshold. Yet another aspect of the invention includes setting the valid tag to invalid based on the counter being equal to the threshold. | 04-10-2014 |
20140129786 | REDUCING MICROPROCESSOR PERFORMANCE LOSS DUE TO TRANSLATION TABLE COHERENCY IN A MULTI-PROCESSOR SYSTEM - A translation lookaside buffer coherency unit with Emulated Purge (TCUEP) fetches first instructions for execution in a multi-processor system. The TCUEP associates a first instruction timestamp with each of the first instructions. The TCUEP receives a multi-processor coherency operation and increments the first timestamp value in a master-tag register to form a second timestamp value after receiving the multi-processor coherency operation. The TCUEP fetches, by an instruction fetch unit in the first microprocessor, second instructions for execution in the multiprocessor system. The TCUEP associates a second instruction timestamp with each of the second instructions. The TCUEP enables an emulated purge mechanism to suppress hits in the translation lookaside buffers for the second instructions. The TCUEP after determining the first instructions are complete, purges entries in the translation lookaside buffers and disables the emulated purge mechanism. | 05-08-2014 |
20140149694 | SYSTEM-ON-CHIP AND APPLICATION PROCESSOR INCLUDING FIFO BUFFER AND MOBILE DEVICE COMPRISING THE SAME - A system-on-chip is provided which includes a data producer; a FIFO buffer which stores data transferred from the data producer at a memory area corresponding to a write pointer; a first consumer which pops data of a memory area corresponding to a first read pointer of the FIFO buffer out; and a second consumer which pops data of a memory area corresponding to a second read pointer of the FIFO buffer out. The FIFO buffer requests a pop-out operation at the second consumer according to the difference between the write pointer and the first read pointer or overwrites data provided from the data producer at a memory area corresponding to the second read pointer. | 05-29-2014 |
20140173226 | LOGICAL OBJECT DELETION - The presently disclosed subject matter includes a method and system for enabling the deletion of logical objects characterized by an object identifier (OID). Upon restart following a system interruption, one or more logical objects are identified, each object being addressed by an interrupted delete request. For each identified logical object performing a deletion, the deletion including: reading one or more physical blocks stored in a physical storage space, wherein the one or more physical blocks were linked to the identified logical object before the system interruption, each of the physical blocks includes an OID stored therein indicating a logical object currently linked to the respective physical block; obtaining OIDs stored respectively in the one or more physical blocks; and freeing those physical blocks from among the one or more physical blocks, which store an OID identical to the respective OID of the identified logical object. | 06-19-2014 |
20140173227 | METHOD AND APPARATUS FOR MANAGING MEMORY IN VIRTUAL MACHINE ENVIRONMENT - A method and apparatus for managing a memory in a portable terminal including a main memory, a secondary memory, and a plurality virtual machines allocated by partitioning the main memory are provided. The method includes generating, by the virtual machines, monitoring information by monitoring access to the main memory and the secondary memory and swapping out with respect to the secondary memory; determining memory allocation amounts for each of the virtual machines by using the monitoring information; and allocating the main memory to the virtual machines in a partitioning scheme based on the determined memory allocation amounts. | 06-19-2014 |
20140173228 | MEMORY SYSTEM AND SYSTEM ON CHIP INCLUDING THE SAME - In one example embodiment, a memory system includes a hierarchical first-in first-out (FIFO) memory configured to store data, and a FIFO controller configured to control inputting and outputting of data to and from the FIFO memory, wherein the FIFO memory includes a first layer. The first layer includes a high-speed input FIFO memory configured to receive data from an external device and a high-speed output FIFO memory configured to output data to the external device. The FIFO memory further includes a second layer. The second layer includes a main FIFO memory configured to receive data from the high-speed input FIFO memory and output data to the high-speed output FIFO memory. | 06-19-2014 |
20140181432 | PRIORITY-BASED GARBAGE COLLECTION FOR DATA STORAGE SYSTEMS - Priority-based garbage collection utilizes attributes of data stored in the non-volatile memory array in order to improve efficiency of garbage collection and of the overall data storage system. A set of low priority data can be selectively evicted from a non-volatile memory array. This can, for example, reduce write amplification associated with garbage collection. Another set of low priority data can be regrouped or consolidated in a different region of the non-volatile memory array. In addition, flushing of data can be performed in order to enhance or optimize garbage collection. Performance and endurance can thereby be improved. | 06-26-2014 |
20140195748 | EFFICIENT REPLICA CLEANUP DURING RESYNCHRONIZATION - Mechanisms are provided for efficient replica cleanup during resynchronization. According to various embodiments, a plurality of deleted data segment ranges on a first storage node may be identified. The first storage node may be configured to store a plurality of data segments. Each of the plurality of data segments may have associated therewith a respective identifier. Each of the data segment ranges may designate one or more data segments that have been deleted from the first storage node. The plurality of deleted data segment ranges may be transmitted to a second storage node configured to mirror the plurality of data segments stored on the first storage node. The plurality of deleted data segment ranges may be capable of being used to identify one or more data segments to delete from the second storage node. | 07-10-2014 |
20140195749 | Deduplication of Volume Regions - A system and method for performing coarse-grained deduplication of volume regions. A storage controller detects that a first region of a first volume is identical to a second region of a second volume, wherein the first volume points to a first medium and the second volume points to a second medium. In response to detecting the identical regions, the storage controller stores an indication that the first range of the first medium underlies the second range of the second medium. Also in response to detecting the identical regions, the mappings associated with the second range of the second medium are invalidated. | 07-10-2014 |
20140195750 | BUFFER POOL EXTENSION FOR DATABASE SERVER - Aspects of the subject matter described herein relate to a buffer pool for a database system. In aspects, secondary memory such as solid state storage is used to extend the buffer pool of a database system. Thresholds such as hot, warm, and cold for classifying pages based on access history of the pages may be determined via a sampling algorithm. When a database system needs to free space in a buffer pool in main memory, a page may be evicted to the buffer pool in secondary memory or other storage based on how the page is classified and conditions of the secondary memory or other storage. | 07-10-2014 |
20140201478 | De-Duplication Aware Secure Delete - A mechanism is provided in a data processing system for de-duplication aware secure delete. Responsive to receiving a secure delete request for a file, the mechanism identifies a list of file blocks to be securely deleted from a physical disk device. Responsive to determining at least one virtual block of another file refers to a given disk block corresponding to a file block in the list, the mechanism copies the given disk block to generate a copied disk block in the physical disk device and updates a pointer of the at least one virtual block to refer to the copied disk block. The mechanism writes a secure delete pattern for each file block in the list of file blocks to a disk block in the physical disk device without performing de-duplication processing. | 07-17-2014 |
20140201479 | INTEGRATED CIRCUIT DEVICE, MEMORY INTERFACE MODULE, DATA PROCESSING SYSTEM AND METHOD FOR PROVIDING DATA ACCESS CONTROL - An integrated circuit device comprising at least one memory interface module arranged to be operably coupled between at least one data storage device and a plurality of master devices within a data processing system. The at least one memory interface module comprises a plurality of buffers and at least one data access control module. The at least one data access control module being arranged to fetch data from the at least one data storage device in response to a received memory access request comprising a master device identifier, select at least one buffer based at least partly on the master device identifier of the received access request, and load the fetched data into the selected at least one buffer. | 07-17-2014 |
20140208045 | MANAGING METADATA FOR LOGICAL VOLUME MANAGERS - A logical volume manager (LVM) may manage a plurality of logical volumes and a plurality of drives in a logical data storage using metadata stored on the plurality of drives. The LVM may operate in one of two modes. In the first mode, the LVM may deleted uncommitted metadata on a drive and may use committed metadata on the drive when accessing a logical volume. In a second mode, the LVM may use committed metadata on the drive when accessing the logical volume and may refrain from deleting the uncommitted metadata. | 07-24-2014 |
20140208046 | STORAGE DEVICE OUT-OF-SPACE HANDLING - Described embodiments detect an impending out-of-space (OOS) condition of a media. On startup, a media controller determines whether an impending OOS indicator is set from a previous startup. If the impending OOS indicator is not set, it is determined whether a free pool size has reached a threshold. The free pool is blocks of the solid-state media available to be written with data. If the free pool size has not reached the first threshold, while the startup time is less than a maximum startup time, garbage collection is performed on the solid-state media to accumulate blocks to the free pool. If the startup time reaches the maximum startup time and the free pool size has not reached the threshold, the impending OOS indicator is set and the media is operated in impending OOS mode. Otherwise, if the free pool size reaches the threshold, the media is operated in normal mode. | 07-24-2014 |
20140223117 | SECURING THE CONTENTS OF A MEMORY DRIVE - A memory device may be equipped with quick erase capability to secure the contents of the memory device. The quick erase capability may effectively permanently disable access to data stored in the memory device instantaneously upon a command being issued, making all previous data written to the memory device unreadable. The quick erase capability may allow use of the memory device for new write operations and for reading the newly written data immediately once the erase command is received and executed. The quick erase capability may begin a physical erase process of data not newly written without altering other aspects of the quick erase. Aspects may be accomplished with one or more bits per row in a memory device. | 08-07-2014 |
20140237199 | APPARATUS AND METHOD FOR HANDLING PAGE PROTECTION FAULTS IN A COMPUTING SYSTEM - Method and apparatus for handling page protection faults in combination particularly with the dynamic conversion of binary code executable by a one computing platform into binary code executed instead by another computing platform. In one exemplary aspect, a page protection fault handling unit is used to detect memory accesses, to check page protection information relevant to the detected access by examining the contents of a page descriptor store, and to selectively allow the access or pass on page protection fault information in accordance with the page protection information. | 08-21-2014 |
20140258650 | MANAGING OPERATIONS ON STORED DATA UNITS - A system for managing storage of data units includes a data storage system configured to store multiple data blocks, at least some of the data blocks containing multiple data units, with at least a group of the data blocks being stored contiguously, thereby supporting a first read operation that retrieves data units from at least two adjacent data blocks in the group. The system is configured to perform two or more operations with respect to data units. The operations include: a second read operation, different from the first read operation, that retrieves a data unit to be read based at least in part on an address of a data block containing the data unit to be read, and a delete operation that replaces a first data block containing a data unit to be deleted with a second data block that does not contain the deleted data unit. | 09-11-2014 |
20140258651 | MANAGING OPERATIONS ON STORED DATA UNITS - A system for managing storage of data units includes a data storage system configured to store multiple data blocks, at least some of the data blocks containing multiple data units, and configured to store, for at least some of the data blocks, corresponding historical information about prior removal of one or more data units from that data block, the removal affecting at least some addresses of data units in that data block. The system is configured to perform at least one operation that accesses at least a first data unit stored in a first data block according to address information interpreted based on any stored historical information corresponding to the first data block. | 09-11-2014 |
20140258652 | MANAGING OPERATIONS ON STORED DATA UNITS - A system for managing storage of data units includes a data storage system configured to store multiple data blocks, at least some of the data blocks containing multiple data units, with at least a group of the data blocks being stored contiguously, thereby supporting a first read operation that retrieves data units from at least two adjacent data blocks in the group. The system is configured to perform one or more operations with respect to data units, the operations including a delete operation that replaces a first data block containing a data unit to be deleted with a second data block that does not contain the deleted data unit, with the second data block having the same size as the first data block. | 09-11-2014 |
20140258653 | INTEGRATING DATA FROM SYMMETRIC AND ASYMMETRIC MEMORY - Data stored within symmetric and asymmetric memory components of main memory is integrated by identifying a first data as having access characteristics suitable for storing in an asymmetric memory component. The first data is included among a collection of data to be written to the asymmetric memory component. An amount of data is identified within the collection of data to be written to the asymmetric memory component. The amount of data is compared within the collection of data to a volume threshold to determine whether a block write to the asymmetric memory component is justified by the amount of data. If justified, the collection of data is loaded to the asymmetric memory component. | 09-11-2014 |
20140258654 | STORAGE SYSTEM - For the purpose of suppressing decrease of a deduplication rate in a storage system, a storage system according to the present invention includes: a data buffer; a dividing unit configured to generate divided data by dividing data inputted into the data buffer; and a storage processing unit configured to store the divided data into a storage device while eliminating duplicate storage. The dividing unit is configured to generate the divided data by dividing the data inputted into the data buffer by a preset division standard based on the content of the data and also divide, by the division standard, connected data that residual data being left without being divided by the division standard and continuing data continuing to the residual data and being inputted in the data buffer are connected. | 09-11-2014 |
20140258655 | METHOD FOR DE-DUPLICATING DATA AND APPARATUS THEREFOR - Disclosed are a method for data de-duplication and an apparatus for the same. The method may comprise obtaining access property of data based on input request or output request for the data, determining de-duplication unit of the data based on the access property, and performing de-duplication on the data based on the de-duplication unit. Thus, data de-duplication rate may be determined adaptively based on input/output characteristics of data. Also, data de-duplication may be performed based on the determined data de-duplication rate so as to provide low input/output latency. | 09-11-2014 |
20140258656 | Lock-Free Object Recycling - Methods, program products, and systems for lock-free object recycling are described. In some implementations, a system can provide a type-neutral wrapper for a first data object. Upon receiving an indicator that the first data object is no longer used, the system can store the first data object and the type-neutral wrapper in a lock-free data structure. Upon receiving a request to create a second data object, the system can fetch the type-neutral wrapper and the first data object from the lock-free data structure without using a lock. The system can then return the first data object as a response to the request. | 09-11-2014 |
20140281295 | Expediting RCU Grace Periods Under User Mode Control - A technique for supporting user mode specification of RCU grace period latency to an operating system kernel-level RCU implementation. Non-expedited and expedited RCU grace period mechanisms are provided for invocation by RCU updaters performing RCU update operations to respectively initiate non-expedited and expedited grace periods. An expedited grace period indicator in a kernel memory space is provided for indicating whether a non-expedited RCU grace period or an expedited RCU grace period should be invoked. The non-expedited RCU grace period mechanism is adapted to check the expedited grace period indicator, and if an expedited RCU grace period is indicated, to invoke the expedited grace period mechanism. A communication mechanism is provided for use by a user mode application executing in a user memory space to manipulate the expedited grace period indicator in the kernel memory space, and thereby control whether an expedited or non-expedited RCU grace period should be used. | 09-18-2014 |
20140281296 | FAULT BUFFER FOR TRACKING PAGE FAULTS IN UNIFIED VIRTUAL MEMORY SYSTEM - A system for managing virtual memory. The system includes a first processing unit configured to execute a first operation that references a first virtual memory address. The system also includes a first memory management unit (MMU) associated with the first processing unit and configured to generate a first page fault upon determining that a first page table that is stored in a first memory unit associated with the first processing unit does not include a mapping corresponding to the first virtual memory address. The system further includes a first copy engine associated with the first processing unit. The first copy engine is configured to read a first command queue to determine a first mapping that corresponds to the first virtual memory address and is included in a first page state directory. The first copy engine is also configured to update the first page table to include the first mapping. | 09-18-2014 |
20140281297 | MIGRATION OF PEER-MAPPED MEMORY PAGES - Techniques are provided by which memory pages may be migrated among PPU memories in a multi-PPU system. According to the techniques, a UVM driver determines that a particular memory page should change ownership state and/or be migrated between one PPU memory and another PPU memory. In response to this determination, the UVM driver initiates a peer transition sequence to cause the ownership state and/or location of the memory page to change. Various peer transition sequences involve modifying mappings for one or more PPU, and copying a memory page from one PPU memory to another PPU memory. Several steps in peer transition sequences may be performed in parallel for increased processing speed. | 09-18-2014 |
20140281298 | Method and Appartus for Suggesting Data for Deletion - An approach is provided for suggesting data for deletion from an electronic data storage medium. An external device detects initiation of transfer of data from first storage medium to second storage medium. Next, the external device determines an available storage in the second storage medium for the data. Then, the external device generates a list to suggest content for deletion within the second storage medium to accommodate the data. | 09-18-2014 |
20140297976 | ELECTRONIC DEVICE WITH REVERSING STACK DATA CONTAINER AND RELATED METHODS - An electronic device may include a memory, and a processor coupled to the memory for storing and accessing data in the memory. The processor may arrange the data in a stack data container including values extending from a stack top to a stack bottom, operate the stack data container in first and second modes of operation, and while in the first mode of operation, push and pop a respective value from the stack top of the stack data container. The processor may also while in the second mode, reverse an orientation of the stack data container and the values therein, and push and pop a respective value from the stack bottom of the reversed stack data container. | 10-02-2014 |
20140310486 | DYNAMIC RESERVATIONS IN A UNIFIED REQUEST QUEUE - A unified request queue includes multiple entries for servicing multiple types of requests. Each of the entries of the unified request queue is generally allocable to requests of any of the multiple request types. A number of entries in the unified request queue is reserved for a first request type among the multiple types of requests. The number of entries reserved for the first request type is dynamically varied based on a number of requests of the first request type rejected by the unified request queue due to allocation of entries in the unified request queue to other requests. | 10-16-2014 |
20140310487 | DYNAMIC RESERVATIONS IN A UNIFIED REQUEST QUEUE - A unified request queue includes multiple entries for servicing multiple types of requests. Each of the entries of the unified request queue is generally allocable to requests of any of the multiple request types. A number of entries in the unified request queue is reserved for a first request type among the multiple types of requests. The number of entries reserved for the first request type is dynamically varied based on a number of requests of the first request type rejected by the unified request queue due to allocation of entries in the unified request queue to other requests. | 10-16-2014 |
20140317363 | SYSTEM AND METHOD FOR OPTIMIZING MEMORY USAGE IN A UNIVERSAL CONTROLLING DEVICE - A method for optimizing memory usage in a device having a universal controlling application includes receiving into the device data for use in configuring the universal controlling application wherein the data is used to identify from within a library of command code sets stored in a memory of the device a command code set that is appropriate for use in commanding functional operations of the appliance and causing a non-identified one or more of the command code sets of the library of command code sets stored in the memory of the device to be discarded to thereby create freed space in the memory of the device. | 10-23-2014 |
20140325167 | Invalidating a Range of Two or More Translation Table Entries and Instruction Therefore - An instruction is provided to perform invalidation of an instruction specified range of segment table entries or region table entries. The instruction can be implemented by software emulation, hardware, firmware or some combination thereof. | 10-30-2014 |
20140325168 | MANAGEMENT OF STORED DATA BASED ON CORRESPONDING ATTRIBUTE DATA - A data storage device receives data and corresponding attribute data, stores the received data and the corresponding attribute data in a storage region of the data storage device, and automatically processes invalid data among the received data stored in the storage region based on the corresponding attribute data. | 10-30-2014 |
20140331015 | RECOVERING FROM UNCORRECTED MEMORY ERRORS - A method for recovering from uncorrected memory errors may include receiving, at an operating system, a correctable error (CE) associated with a first memory page. The correctable error is marked in a page table entry describing the first memory page. The first memory page is then migrated, by the operating system, to a second memory page based on the received correctable error. | 11-06-2014 |
20140344535 | ACCIDENTAL SHARED VOLUME ERASURE PREVENTION - Various embodiments of accidental shared volume erasure prevention include systems, methods, and/or computer program products for receiving a request to access a volume from a requesting system, determining whether the volume is associated with any system other than the requesting system, and preventing accidental erasure of the volume based on the determination. | 11-20-2014 |
20140344536 | STORAGE SYSTEMS THAT CREATE SNAPSHOT QUEUES - A storage system may include a queue included in a memory and a controller configured to store commands received from a host in the queue. The queue may have a linked-list configuration. In response to a triggering event, the controller may take a snapshot of the queue, creating a snapshot queue. The snapshot queue may have a linear configuration. Subsequent analysis or parsing of queued information may be performed on the linear snapshot queue instead of the linked-list queue. Modifications to the linear snapshot queue may be corresponding made to the linked-list queue. | 11-20-2014 |
20140351530 | LINKED LIST FOR LOCK-FREE MEMORY ALLOCATION - Embodiments relate to a linked list for memory allocation. An aspect includes maintaining a linked list of address ranges in a computer memory that are available for allocation. Another aspect includes receiving a request for allocation of a first address range, the request comprising a size of the first address range. Another aspect includes traversing the linked list to determine an available address range having a size that is greater than or equal to the size of the first address range. Another aspect includes determining whether there is interference in the linked list. Another aspect includes, based on determining that there is no interference in the linked list, removing determined address range from the linked list. Another aspect includes, based on determining that there is interference in the linked list, restarting the traversing of the linked list. | 11-27-2014 |
20140351531 | APPARATUS AND METHOD FOR MANAGING STORAGE OF DATA BLOCKS - A data block storage management capability is presented. A cloud file system management capability manages storage of data blocks of a file system across multiple cloud storage services (e.g., including determining, for each data block to be stored, a storage location and a storage duration for the data block). A cloud file system management capability manages movement of data blocks of a file system between storage volumes of cloud storage services. A cloud file system management capability provides a probabilistic eviction scheme for evicting data blocks from storage volumes of cloud storage services in advance of storage deadlines by which the data blocks are to be removed from the storage volumes. A cloud file system management capability enables dynamic adaptation of the storage volume sizes of the storage volumes of the cloud storage services. | 11-27-2014 |
20140372716 | PARALLEL MAPPING OF CLIENT PARTITION MEMORY TO MULTIPLE PHYSICAL ADAPTERS - Techniques are disclosed for performing input/output (I/O) requests to two or more physical adapters in parallel. One method for performing an input/output (I/O) request includes mapping an address for at least a first page associated with a virtual I/O request to an entry in a virtual TCE table and identifying a plurality of physical adapters required to service the virtual I/O request. For each of the identified physical adapters, the entry in the virtual TCE table is mapped to an entry in a physical TCE table corresponding to the physical adapter. This method may also include, in parallel, issuing physical I/O requests to the physical adapters. | 12-18-2014 |
20150046666 | MEMORY SYSTEM - A memory system includes: a memory controller configured to change data to be stored in memory cells according to an address of a weak cell in order to store changed data having a lower program level than a highest program level among a plurality of program levels in peripheral cells adjacent to the weak cell; and a memory device configured to execute a program loop in order to store the changed data in a selected page. | 02-12-2015 |
20150046667 | SYNCHRONIZATION FOR INITIALIZATION OF A REMOTE MIRROR STORAGE FACILITY - A method includes computing, in a local storage system having a local volume with a plurality of local regions, respective local checksum signatures over the local regions, and computing, in a remote storage system having a remote volume with remote regions in a one-to-one correspondence with the local regions, respective remote checksum signatures over the remote regions. A given remote region is identified, the given remote region having a given remote signature and a corresponding local region with a given local signature that does not match the given remote signature. The data in the given remote region is then replaced with data from the corresponding local region. | 02-12-2015 |
20150074361 | IDENTIFICATION OF NON-SEQUENTIAL DATA STORED IN MEMORY - Systems and methods for identification of data stored in memory are provided. A data packet is received and a first packet byte within the data packet is compared to a first memory byte within a memory. A mismatch is determined between the first packet byte and the first memory byte. A memory location is accessed that contains a second memory byte that is non-consecutive with the first memory byte. A packet location accessed that contains a second packet byte that is non-consecutive with the first packet byte. The second packet byte is compared to the second memory byte. A retrieval instruction is generated based at least in part on a result of the comparison between the second packet byte and the second memory byte. Various embodiments may be included in a network memory architecture to allow for faster data matching and instruction generation in a central appliance. | 03-12-2015 |
20150081991 | INFORMATION PROCESSING APPARATUS AND ACCESS CONTROL METHOD - Upon receipt of an instruction to access a logical address of a storage medium, an information processing apparatus controls access to its corresponding physical address of the storage medium. A management unit manages mapping between a continuous series of logical addresses and discrete physical addresses skipping a predetermined number of replacement areas. A controller identifies to which physical address the received logical address is mapped, and controls access to the storage medium using the identified physical address. When a defect occurs in a storage area indicated by a physical address, the information processing apparatus remaps its corresponding logical address to a replacement area adjacent to the defective physical address. | 03-19-2015 |
20150081992 | METHOD, DEVICE, AND SYSTEM FOR DATA STORAGE MANAGEMENT - The disclosure involves a method for saving data from webpages. The method can be realized through the following steps: when the request of saving data from a target webpage is received, whether assigned saving space is big enough for storing all the data from a target webpage is judged in the beginning; if the assigned saving space is not big enough to store all the data from the target webpage, estimate the number of page views of the current collection of webpages in the next pre-set circle and the current collection of webpages is correspondent to webpage data saved in the saving space; based on the estimated amount of page view, eliminate webpage data saved in the saving space in order to make the saving space have the ability to save all the webpage data of the collection of the webpages mentioned above; and then all the webpage data of the collection of the webpages mentioned above is saved in the space. The disclosure also provides a device for storing webpage data. The disclosure helps improving the efficiency of saving data and the utilization rate of the saved webpage data. | 03-19-2015 |
20150089169 | DYNAMIC REUSE AND RECONFIGURATION OF LOGICAL DATA OBJECTS IN A VIRTUAL TAPE SYSTEM - A method according to one embodiment includes selecting, by a processor, one of a WORM logical data object and a read-write logical data object for reuse as a new WORM logical data object, said processor maintaining data attributes bound to said selected logical data object until it is determined that said selected logical data object is available for reuse. At least one temporary data attribute is assigned to said selected logical data object while maintaining said data attributes bound to said selected logical data object The selected logical data object is mounted and a write command to beginning of logical data object is received to bind at least one data attribute to said selected logical data object to replace data attributes and data associated with said selected logical data object to reuse said selected logical data object as said new WORM logical data object. | 03-26-2015 |
20150106579 | Forward-Only Paged Data Storage Management - Computer-implemented methods and systems for managing data in one or more data storage media are provided. An example method may comprise creating a data structure within the data storage media. The data structure includes a plurality of memory pages, each page comprising a plurality of sessions, and each session comprising a header and a plurality of data objects. The method also comprises enabling writing data to the data storage medium, in response to routine requests, such that the data is recorded to the one or more data objects nearest the current location of a virtual cursor. When a data management operation is performed, the virtual cursor is moved within a single page in a single direction. | 04-16-2015 |
20150121021 | APPARATUS AND METHOD FOR CONTROLLING STORAGE DEVICES - Write commands for a storage device specify write data with either a first data step size or a second data step size. In the former case, the storage device performs a read-modify-write (RMW) cycle which includes reading data with the second data step size. In the latter case, the storage device executes the command in a single write cycle. A command sorting unit sorts received commands into two groups, first commands and second commands, when storing them in a memory. First commands are write commands whose data boundaries do not match with the second data step size. Second commands include write commands whose data boundaries match with the second data step size. A command issuing unit converts first commands into a second command upon predetermined conditions. The command issuing unit issues the second commands to the storage device, in preference to the first commands. | 04-30-2015 |
20150134922 | METHODS AND SYSTEMS FOR DATA CLEANUP USING PHYSICAL IMAGE OF FILES ON STORAGE DEVICES - Methods, systems, and computer program products are provided for optimizing selection of files for eviction from a first storage pool to free up a predetermined amount of space in the first storage pool. A method includes analyzing an effective space occupied by each file of a plurality of files in the first storage pool, selecting one or more of the plurality of files as one or more candidate files for eviction, based on the identified one or more data blocks, and evicting the one or more candidate files for eviction from the first storage pool to a second storage pool. | 05-14-2015 |
20150301751 | VIRTUAL DISK DRIVE SYSTEM AND METHOD - A disk drive system and method capable of dynamically allocating data is provided. The disk drive system may include a RAID subsystem having a pool of storage, for example a page pool of storage that maintains a free list of RAIDs, or a matrix of disk storage blocks that maintain a null list of RAIDs, and a disk manager having at least one disk storage system controller. The RAID subsystem and disk manager dynamically allocate data across the pool of storage and a plurality of disk drives based on RAID-to-disk mapping. The RAID subsystem and disk manager determine whether additional disk drives are required, and a notification is sent if the additional disk drives are required. Dynamic data allocation and data progression allow a user to acquire a disk drive later in time when it is needed. Dynamic data allocation also allows efficient data storage of snapshots/point-in-time copies of virtual volume pool of storage, instant data replay and data instant fusion for data backup, recovery etc., remote data storage, and data progression, etc. | 10-22-2015 |
20150324132 | Method and Computing Device for Fast Erase of Swap Memory - The following embodiments generally relate to the use of a “swap area” in a non-volatile memory as an extension to volatile memory in a computing device. These embodiments include techniques to use both volatile memory and non-volatile swap memory to pre-load a plurality of applications, to control the bandwidth of swap operations, to encrypt data stored in the swap area, and to perform a fast clean-up of the swap area. | 11-12-2015 |
20150356007 | PARALLEL GARBAGE COLLECTION IMPLEMENTED IN HARDWARE - Embodiments of the invention provide a method and system for dynamic memory management implemented in hardware. In an embodiment, the method comprises storing objects in a plurality of heaps, and operating a hardware garbage collector to free heap space. The hardware garbage collector traverses the heaps and marks selected objects, uses the marks to identify a plurality of the objects, and frees the identified objects. In an embodiment, the method comprises storing objects in a heap, each of at least some of the objects including a multitude of pointers; and operating a hardware garbage collector to free heap space. The hardware garbage collector traverses the heap, using the pointers of some of the objects to identify others of the objects; processes the objects to mark selected objects; and uses the marks to identify a group of the objects, and frees the identified objects. | 12-10-2015 |
20150370723 | System, Apparatus and Method for Prioritizing the Storage of Content Based on a Threat Index - A network sensor that features a data store and a packet processing engine. Communicatively coupled to the data store, the packet processing engine is configured to (i) generate a retention priority for at least a first flow within a first storage region of a plurality of storage regions and (ii) identify, in response to an eviction request, the priority of each of the plurality of storage regions. The priority of the first storage region is partially based on the retention priority associated with the first flow while the priority of a second storage region is based on retention priorities associated with flows stored within the second storage region. The packet processing engine also is configured to identify, through use of the retention priorities of the stored flows within the first storage region, which flows are to be retained and which flows are to be evicted. | 12-24-2015 |
20150378890 | MULTI-DIMENTIONAL DATA RANDOMIZATION - The disclosed technology provides for multi-dimensional data randomization in a memory cell array using circular shifts of an initial scrambling sequence. Data addressed to a first row of a data array is randomized using the initial scrambling sequence and data addressed to each row of the memory cell array is randomized using a scrambling sequence that is equal to a circular shift of the initial sequence. | 12-31-2015 |
20150378935 | STORAGE TABLE REPLACEMENT METHOD - A storage table replacement method uses an index table, a storage table containing multiple rows of storage cells, and a correlation table. The method includes storing information in one or more rows of storage cells in the storage table; and storing track addresses of the storage cells in the storage table in the index table. Every track address includes a row address and a column address. The method further includes recording, in every row in the correlation table, a total number of index rows/index table memory cells that use the row as an index target in the index table and addresses of a certain number of index rows/index table memory cells, where the correlation table and the storage table have a same number of rows; and, when a row of new information is generated, based on the correlation table, selecting and replacing a row in the storage table. | 12-31-2015 |
20160004456 | SELECTIVE SPACE RECLAMATION OF DATA STORAGE MEMORY EMPLOYING HEAT AND RELOCATION METRICS - Space of a data storage memory of a data storage memory system is reclaimed by determining heat metrics of data stored in the data storage memory; determining relocation metrics related to relocation of the data within the data storage memory; determining utility metrics of the data relating the heat metrics to the relocation metrics for the data; and making the data whose utility metric fails a utility metric threshold, available for space reclamation. | 01-07-2016 |
20160011989 | ACCESS CONTROL APPARATUS AND ACCESS CONTROL METHOD | 01-14-2016 |
20160034201 | MANAGING DE-DUPLICATION USING ESTIMATED BENEFITS - A protocol is employed to estimate duplication of data in a storage system. This estimate is employed as a factor of enabling de-duplication, and if de-duplication is enabled, the data sets which will be subject to the de-duplication. The protocol includes a measurement procedure and an execution procedure. The measurement procedure characterizes data duplication in part of the data on the storage system, and the execution procedure use the characterization to adjust selection of which data sets are subject to de-duplication. | 02-04-2016 |
20160041769 | RECORDING MEDIUM STORING ACCESS CONTROL PROGRAM, ACCESS CONTROL APPARATUS, AND ACCESS CONTROL METHOD - An access control apparatus includes a processor that executes a process including: reading first consecutive blocks from a storage device in response to an access request for a first data, the first consecutive blocks including a first block, storage areas of the storage device being managed in units of blocks; loading the first consecutive blocks into a memory area, storage areas of the memory area being managed in units of pages; and in accordance with a state of an access to a page in the memory area, invalidating a specific block of the storage device that corresponds to a specific page pushed out of the memory area, the specific page being pushed out as a consequence of loading the first consecutive blocks into the memory area, and writing second data included in the specific page to consecutive empty areas of the storage device. | 02-11-2016 |
20160054949 | METHOD FOR STORING DATA IN A COMPUTER SYSTEM PERFORMING DATA DEDUPLICATION - The invention relates to a method of storing data in a computer system (SYS) comprising a plurality of first devices (PC | 02-25-2016 |
20160062689 | STORAGE SYSTEM - A storage system and a method for storing a data segment, a storage capacity manager and a method for managing a capacity of a storage unit, and a storage tier relocation manager and a method for relocating a data segment. The storage system includes at least two storage tiers, an access pattern evaluator, a classification unit, a selector, and logic. The storage capacitor manager includes a monitoring unit and capacity managing unit. The storage tier relocation manager includes a target storage tier, the data segment relocated to the target storage tier, and a protection measure. | 03-03-2016 |
20160070495 | LOGICAL REPLICATION MAPPING FOR ASYMMETRIC COMPRESSION - A system and method for logically organizing compressed data. In one aspect, a destination storage server receives a write request that includes multiple data blocks and specifies corresponding file block numbers. An extent-based file system executing on the storage server accesses intermediate block entries that each associates one of the file block numbers with a respective extent block number. The file system, in cooperation with a compression engine, compresses the data blocks into a set of one or more compressed data blocks. The file system stores the compressed data blocks at physical locations corresponding to physical block numbers and allocates, within an extent map, pointers from an extent ID to the extent block numbers, and pointers from the extent ID to the physical block numbers. | 03-10-2016 |
20160077746 | OPTIMIZED SEGMENT CLEANING TECHNIQUE - An optimized segment cleaning technique is configured to efficiently clean one or more selected portions or segments of a storage array coupled to one or more nodes of a cluster. A bottom-up approach of the segment cleaning technique is configured to read all blocks of a segment to be cleaned (i.e., an “old” segment) to locate extents stored on the SSDs of the old segment and examine extent metadata to determine whether the extents are valid and, if so, relocate the valid extents to a segment being written (i.e., a “new” segment). A top-down approach of the segment cleaning technique obviates reading of the blocks of the old segment to locate the extents and, instead, examines the extent metadata to determine the valid extents of the old segment. A hybrid approach may extend the top-down approach to include only full stripe read operations needed for relocation and reconstruction of blocks as well as retrieval of valid extents from the stripes, while also avoiding any unnecessary read operations of the bottom-down approach. | 03-17-2016 |
20160092137 | Data Integrity In Deduplicated Block Storage Environments - Methods and apparatuses for maintaining data integrity in deduplicated storage environments. A processor receives a request to write a first block of data to a storage device. A processor compares the first block of data to a second block of data, wherein the second block is stored on the storage device. A processor writes the first block of data to the storage device based, at least in part, on the first block of data matching the second block of data and an amount of pointers to the second block of data being above a predetermined amount. | 03-31-2016 |
20160103768 | TLB Management Method and Computer - A TLB management method and computer are provided. The method includes querying a TLB storage directory table using a VPID of a first VCPU as an index, to obtain an address of a TLB storage table corresponding to the first VCPU; then accessing, according to the address of the TLB storage table corresponding to the first VCPU, the TLB storage table corresponding to the first VCPU, and reading a valid TLB entry in the TLB storage table corresponding to the first VCPU into a physical TLB. | 04-14-2016 |
20160124867 | Reducing Decompression Time Without Impacting Compression Ratio - Aspects include computing devices, systems, and methods for implementing executing decompression of a compressed page. A computing device may determine a decompression block of a compressed page that contains a code instruction requested in a memory access request. Decompression blocks, other than the decompression block containing the requested code instruction, may be selected for decompression based on being situated between an end of the compressed page and the decompression block containing the requested code instruction. Decompression blocks not identified for decompression may be substituted for a fault or exception code. The computing device may decompress decompression blocks identified for decompression, starting at the end of the compressed page and terminating the decompression of the compressed page upon filling all blocks with decompressed blocks, faults, or exception code. The remaining decompression blocks of the compressed page may be decompressed after or concurrently with the execution of the requested code instruction. | 05-05-2016 |
20160132252 | MANAGING A SET OF BLOCKS IN A STORAGE SYSTEM - Disclosed aspects include management of a set of blocks in a storage system. A set of write requests is initiated to the set of blocks. In response to the set of write requests, a set of expiration metadata for the set of blocks is established. Based on the set of expiration metadata, an expiration event is detected. In response to detecting the expiration event, an expiration operation on the set of blocks is processed. | 05-12-2016 |
20160147448 | Efficient Block-Level Space Allocation for Multi-Version Concurrency Control Data - Lockless allocation of a block from a page is initiated by computing a needed block size from an original block header value. Thereafter, a currently used block size and a capacity of the page are determined. A new block size is then computed based on the currently used block size and the needed block size and a remaining capacity of the page. A new block header value is subsequently generated that includes the determined new block size and the determined remaining capacity of the page The original block header value is then replaced with the new block header value. Related apparatus, systems, techniques and articles are also described. | 05-26-2016 |
20160162411 | Invalidating a Range of Two or More Translation Table Entries and Instruction Therefore - An instruction is provided to perform invalidation of an instruction specified range of segment table entries or region table entries. The instruction can be implemented by software emulation, hardware, firmware or some combination thereof. | 06-09-2016 |
20160170654 | SELECTING PAGES IMPLEMENTING LEAF NODES AND INTERNAL NODES OF A DATA SET INDEX FOR REUSE | 06-16-2016 |
20160170663 | NONVOLATILE MEMORY CONTROL DEVICE, NONVOLATILE MEMORY CONTROL METHOD AND COMPUTER READABLE STORAGE MEDIUM | 06-16-2016 |
20160170906 | IDENTIFICATION OF PAGE SHARING OPPORTUNITIES WITHIN LARGE PAGES | 06-16-2016 |
20160188489 | ATOMIC MEMORY OPERATIONS ON AN N-WAY LINKED LIST - Computer-implemented methods for pushing or popping an element on to of off of an N-way linked list in a computer memory may include one or more atomic memory operations on a handle of the N-way linked list. One embodiment for pushing a first element on to an N-way linked list may include setting a next sequential element pointer of the first element to point to an unknown location marker. Another embodiment for popping a first element off of an N-way linked may include marking a sub-list tail handle with a designation indicating that the particular sub-list is involved in a pop process. In yet another embodiment, a method for popping a first element off of an N-way linked list may include storing in a sub-list tail handle a pointer to a pseudo element. The handle may fit within a single line of cache memory. | 06-30-2016 |
20170235673 | RATE MATCHING TECHNIQUE FOR BALANCING SEGMENT CLEANING AND I/O WORKLOAD | 08-17-2017 |