| Entries |
| Document | Title | Date |
|---|
| 20080201544 | STORAGE SYSTEM - A processor of a storage controller receives an erasure process request relating to data stored in a storage unit, from a host computer, via a data I/O interface, detects a logical storage extent which is different to the logical storage extent allocated to the storage unit and which can be allocated, allocates the logical storage extent thus detected to the storage unit, sends a notification indicating that access to the storage unit is possible, to the host computer which is the source of the request, and then executes erasure of the data in the logical storage extent that is associated with the storage unit forming the erasure object, and sends a data erasure notification to the management computer when the data has been erased. | 08-21-2008 |
| 20080209149 | Processor Architecture for Exact Pointer Identification - The present invention relates to an object-based processor architecture which allows exact pointer identification by strictly separating pointers and data from one another in the memory and in the processor registers. The access to the memory is performed exclusively via pointers which refer to objects. An object contains separate areas for pointers and data and an attribute field for describing the length of the two areas. Both the pointers in the pointer registers and also the pointers in the pointer areas of the objects directly contain the address of the objects to which they refer. The suggested processor architecture allows the integration of automatic garbage collection, which may be implemented completely or partially in hardware. A real-time capable garbage collection may be implemented especially efficiently through hardware support. | 08-28-2008 |
| 20080209150 | NON-VOLATILE MEMORY DEVICE AND METHOD OF DRIVING THE SAME - A method of driving a non-volatile memory device includes supplying power to the memory device, in which setting information related to setting an operating environment is copied and stored in multiple of regions of a memory cell array. An initial read operation of the memory cell array is performed and initial setting data is determined based on the initial read operation. The operating environment of the memory device is set based on the initial setting data. Corresponding portions of the stored copies of the setting information are read at the same time. | 08-28-2008 |
| 20080235479 | Initializing File Data Blocks - A method and system is provided for initializing files such as, for example and without limitation, pre-allocated files or raw device mapping (RDM) files, by delaying initializing file blocks. In accordance with one or more embodiments of the present invention, file blocks are associated with corresponding indicators to track un-initialized blocks. | 09-25-2008 |
| 20080301390 | System and method for managing addresses in a computing system - A method for retrieving and managing addresses is provided. The steps may include of receiving, at a first buffer of m buffers, a request for an address; obtaining the address from a corresponding first register of the m registers; sending the address, received by said obtaining, to a destination; storing the address, received by the obtaining, in the first buffer; and clearing the contents of a second buffer of the m buffers, in response to any of said receiving, obtaining or storing, without clearing the contents of said first buffer, wherein m is a positive integer. | 12-04-2008 |
| 20080313418 | SEMICONDUCTOR MEMORY DEVICE HAVING PROCESSOR RESET FUNCTION AND RESET CONTROL METHOD THEREOF - A semiconductor memory device for use in a multiprocessor system includes a shared memory area and a reset signal generator. The shared memory area is accessible by the processors of the multiprocessor system through different ports, and is assigned to a portion of a memory cell array. The reset signal generator is configured to provide a reset enable signal to a processor, predetermined as a slave processor among the multiple processors, for a predetermined time after an initial booting of the multiprocessor system. The reset signal generator also provides a reset disable signal to the slave processor after the predetermined time lapses. | 12-18-2008 |
| 20090049265 | STALE TRACK INITIALIZATION IN A STORAGE CONTROLLER - Deleting a data volume from a storage system and freeing its storage space to make it available to be allocated to a new volume is accomplished by only zeroing associated metadata for the tracks contained in the freed storage space which is then reused in a new volume allocation and an attempt is made by the new volume to read a first record R | 02-19-2009 |
| 20090113157 | INITIALIZING CIRCUIT FOR SEMICONDUCTOR MEMORY DEVICE HAVING BANK ACTIVE CONTROL CIRCUIT - An initializing circuit initializing a semiconductor memory device includes a command generating circuit generating a mode register set command in response to a reset command signal, a mode register set control circuit producing a reset signal in response to the mode register set command, and a bank active control circuit resetting the semiconductor memory device by generating an all-bank precharge command in response to the reset signal. | 04-30-2009 |
| 20090119468 | SYSTEMS, METHODS, AND APPARATUSES FOR ERASING MEMORY ON WIRELESS DEVICES - A wireless device having a memory is provided. The memory or a protected portion of the memory is subject to a hard erasure of the memory vs. a soft erasure of the memory if a plurality of sensors indicate a threat to the device exists. The threat may be detected by a plurality of sensors, such as, a timer, a connectivity sensor, a location sensor or geo-fence, a breech sensor, an authentication procedure or the like. | 05-07-2009 |
| 20090119469 | Procedure for Time-Limited Storage of Data on Storage Media - There is described a procedure for temporally limiting the storage of data on storage media, in which the data are provided with an expiry date when being stored on a storage medium. When access is made to these data by a read/write device, the expiry date is compared with a current date. When the expiry date is reached or exceeded, a pre-specified action is initiated—for example the deletion of the data from the storage medium or access being made to the data only by authorization. Based upon the procedure it is possible, on the one hand, to easily render sensitive information such as personal data unusable upon expiration of a storage period, if for example the expiry date is set to coincide with the date when the storage period elapses. On the other hand, copyright and marketing rights for digital data can thereby be easily protected without the additional use of licensing servers of the installation of executable programs. | 05-07-2009 |
| 20090193214 | DYNAMIC ADDRESS TRANSLATION WITH FRAME MANAGEMENT - What is disclosed is a frame management function defined for a machine architecture of a computer system. In one embodiment, a machine instruction is obtained containing an opcode for a frame management instruction identifying a first and second general register. Clear frame information is obtained from the first general register having a frame size field indicating whether a storage frame is a small or large block of data. The second general register contains an operand address of a storage frame. If the storage frame is a small block, all bytes of the small block of data are set to zero. If the storage frame is a large block of data, an operand address of an initial first block of data within the large block is obtained from the second general register. All data of all blocks within the large block are cleared starting from the initial first block. | 07-30-2009 |
| 20090193215 | ERASING AND RESTORING FACTORY SETTINGS IN COMPUTER SYSTEMS - In one embodiment, a computer system comprising a system restoration control module within which resides a erasure module. In one embodiment, the computer system allows a user to erase personally identified information from a computer system without concern that the information will be subsequently retrieved and restore the computer system to its original factory settings. | 07-30-2009 |
| 20090193216 | Method and Apparatus for Hardware Enforced Virtual Sequentiality - A mechanism receives memory reads and writes from a packet processing engine, each memory access having an associated packet identifier or sequence number. The mechanism is placed between a processing engine and a memory system such that write data is buffered and information based upon reads and writes is recorded. Memory read data is returned speculatively since the packet processing engine is processing packets in parallel and not necessarily in sequence. Information is maintained allowing the detection of a speculative read that was incorrect (i.e. a memory conflict). When a memory conflict is detected, a restart signal is generated and the information for the associated packet identifier or sequence number is flushed. | 07-30-2009 |
| 20090204779 | CONTROLLING EMBEDDED MEMORY ACCESS - A microcontroller ( | 08-13-2009 |
| 20090216984 | OPTIMIZATIONS OF A PERFORM FRAME MANAGEMENT FUNCTION ISSUED BY PAGEABLE GUESTS - Optimizations are provided for frame management operations, including a clear operation and/or a set storage key operation, requested by pageable guests. The operations are performed, absent host intervention, on frames not resident in host memory. The operations may be specified in an instruction issued by the pageable guests. | 08-27-2009 |
| 20090222635 | System and Method to Use Chipset Resources to Clear Sensitive Data from Computer System Memory - A system, method, and program product is provided that initializes a computer system using an initialization process that identifies secrets that were stored in memory and not scrubbed during a prior use of the computer system. During the initialization process, one or more secret indicators are retrieved that identify whether one or more secrets were scrubbed from the computer system's memory during a previous use of the computer system. If the secret indicators show that one or more secrets were not scrubbed from the memory during the prior use of the computer system, then the initialization process scrubs the memory. On the other hand, if the secret indicators show that each of the secrets was scrubbed from the memory during the prior use of the computer system, then the memory is not scrubbed during the initialization process. | 09-03-2009 |
| 20090222636 | MEMORY SYSTEM AND MEMORY INITIALIZING METHOD - A memory system includes a controller that writes internal information concerning an operation state of the memory system in a special LBA area allocated to a predetermined logical address range in a second storing memory and writes the internal information in a first storing memory, and reads out, when the memory system is started up, the internal information to manage the operation state. The controller stores the internal information written in the first storing memory in the second storing memory as a snapshot when a predetermined condition is satisfied and, when an error occurs and the internal information written in the special LBA area cannot be read out when the memory system is started up, captures the internal information stored as the snapshot into the first storing memory and reads out the internal information. | 09-03-2009 |
| 20090240908 | FILTERING PROCESSOR REQUESTS BASED ON IDENTIFIERS - Processing within a computing environment is facilitated by filtering requests of the computing environment. A processing unit that receives a request determines whether it is to perform the request. This determination is made by, for instance, comparing an identifier of the request with an identifier of the processing unit making the determination. If there is a mismatch, then the request is blocked. Other processing within the computing environment is also facilitated by selectively using buffer entries. The selection criteria is based, for instance, on identifier information. | 09-24-2009 |
| 20090259820 | OPERATION METHOD FOR MEMORY - An operation method for a memory is provided. When the memory is under a reset mode, a main data line (MDQ) and a local data line (LDQ) of the memory is forced to be a logic high level. Then, the memory cells in the memory are turned on by choosing corresponding column selection lines (CSL) and corresponding word lines of the memory. Finally, the turned on memory cells are reset after the logic high level of the main data line and the local data line is written into the turned on memory cells. | 10-15-2009 |
| 20090265523 | Method and apparatus for shuffling data - Method, apparatus, and program means for shuffling data. The method of one embodiment comprises receiving a first operand having a set of L data elements and a second operand having a set of L control elements. For each control element, data from a first operand data element designated by the individual control element is shuffled to an associated resultant data element position if its flush to zero field is not set and a zero is placed into the associated resultant data element position if its flush to zero field is not set. | 10-22-2009 |
| 20090282206 | Method for Resolving Memory Leak Problems Resulting from Loitering Objects - The exemplary embodiments provide a computer implemented method, apparatus, and computer usable program code for managing memory. A suspect loitering object is detected for a set of selected applications, forming a detected object. The detected object is paged to persistent storage, forming a paged object. The paged object is deallocated from system memory, forming a deallocated object. | 11-12-2009 |
| 20090287896 | OFF-CHIP MICRO CONTROL AND INTERFACE IN A MULTICHIP INTEGRATED MEMORY SYSTEM - A communication interface, coupling a controller device to one or more memory devices, provides a high-voltage reset interface. The high-voltage reset interface provides a high-voltage signal to reset the one or more memory devices. The high-voltage reset interface is implemented using a single interconnect line. The reset voltage signal is greater than a maximum voltage representing a high logic value. The communication interface may also include a bi-directional data and address interface that is used to send address, data, and commands between the controller device and the one or more memory devices. A method of transferring information between the controller device and the one or more non-volatile memory devices includes resetting the one or more non-volatile memory devices by asserting a high-voltage signal on the high-voltage reset interface and sending a command from the controller device to the one or more non-volatile memory devices via the data and address interface. | 11-19-2009 |
| 20090300311 | SELECTIVE REGISTER RESET - The present disclosure includes methods, devices, modules, and systems for storing selective register reset. One method embodiment includes receiving an indication of a die and a plane associated with at least one address cycle. Such a method can also include selectively resetting a particular register of a number of registers, the particular register corresponding to the plane and the die. | 12-03-2009 |
| 20090300312 | INSTANT HARDWARE ERASE FOR CONTENT RESET AND PSEUDO-RANDOM NUMBER GENERATION - Systems and methods that facilitate securing data associated with a memory from security breaches are presented. A memory component includes nonvolatile memory, and a secure memory component (e.g., volatile memory) used to store information such as secret information related to secret processes or functions (e.g., cryptographic functions). A security component detects security-related events, such as security breaches or completion of security processes or functions, associated with the memory component and in response to a security-related event, the security component can transmit a reset signal to the secure memory component to facilitate efficiently erasing or resetting desired storage locations in the secure memory component in parallel and in a single clock cycle to facilitate data security. A random number generator component can facilitate generating random numbers after a reset based on a change in scrambler keys used by a scrambler component to descramble data read from the reset storage locations. | 12-03-2009 |
| 20090300313 | MEMORY CLEARING APPARATUS FOR ZERO CLEARING - A memory clear apparatus includes a processor that issues a memory clear request including a zero clear target area on a memory area and a zero clear target size, and a memory clearing circuit that receives the memory clear request from the processor, performs zero clearing on the zero clear target area based on the memory clear request, and transmits a memory clear completion notification to the processor. | 12-03-2009 |
| 20090327638 | Securely clearing an error indicator - In one embodiment, a controller can perform a secure clear of a poisoned indicator associated with an uncorrectable error (after recovery from the error). To this end, the controller may access a register storing an address of a memory location associated with indicator, determine whether the address corresponds to an entry in a table storing a list of such errors, and perform the clear based at least in part on the determination. Other embodiments are described and claimed. | 12-31-2009 |
| 20100023721 | MEMORY SYSTEM AND HOST DEVICE - A memory system includes a nonvolatile memory, and a memory controller for performing control to extend the maximum value of a logical address by erasing data of the nonvolatile memory which has become unnecessary in accordance with a command from the outside, and reassigning the data which has become unnecessary to a memory area assigned to a part of the logical address. | 01-28-2010 |
| 20100030992 | INITIALIZING OF A MEMORY AREA - A method for initializing a memory area, the method includes: receiving a request to access a first memory sub of a first memory area that comprises multiple memory sub areas; and initializing the first memory sub area if a first memory area initialization indicator differs from a first memory sub area initialization request indicator; wherein the first memory area initialization request indicator is a multiple bit variable indicative of a time of a last request to initialize the first memory area and the first memory sub area initialization indicator is a multiple bit variation indicative of a time of a request to initialize the first memory area that resulted in a last initialization of the first memory sub area. | 02-04-2010 |
| 20100070729 | SYSTEM AND METHOD OF MANAGING METADATA - In a particular embodiment, a controller is adapted to control read/write access to a storage media including a pre-allocated area having multiple meta-blocks. The controller includes logic adapted to control the multiple meta-blocks as a first in first out (FIFO) circular queue. The logic selects one or more meta-blocks from the multiple meta-blocks based on an order associated with the FIFO circular queue and selectively writes a logical block address (LBA) mapping table to the selected one or more meta-blocks. | 03-18-2010 |
| 20100077171 | DATA STORAGE SYSTEM AND METHOD BY SHREDDING AND DESHREDDING - A system and method for data storage by shredding and deshredding of the data allows for various combinations of processing of the data to provide various resultant storage of the data. Data storage and retrieval functions include various combinations of data redundancy generation, data compression and decompression, data encryption and decryption, and data integrity by signature generation and verification. Data shredding is performed by shredders and data deshredding is performed by deshredders that have some implementations that allocate processing internally in the shredder and deshredder either in parallel to multiple processors or sequentially to a single processor. Other implementations use multiple processing through multi-level shredders and deshredders. Redundancy generation includes implementations using non-systematic encoding, systematic encoding, or a hybrid combination. Shredder based tag generators and deshredder based tag readers are used in some implementations to allow the deshredders to adapt to various versions of the shredders. | 03-25-2010 |
| 20100082930 | GPU ASSISTED GARBAGE COLLECTION - A system and method for efficient garbage collection. A general-purpose central processing unit (CPU) sends a garbage collection request and a first log to a special processing unit (SPU). The first log includes an address and a data size of each allocated data object stored in a heap in memory corresponding to the CPU. The SPU has a single instruction multiple data (SIMD) parallel architecture and may be a graphics processing unit (GPU). The SPU efficiently performs operations of a garbage collection algorithm due to its architecture on a local representation of the data objects stored in the memory. The SPU records a list of changes it performs to remove dead data objects and compact live data objects. This list is subsequently sent to the CPU, which performs the included operations. | 04-01-2010 |
| 20100082931 | INTELLIGENT EXTENT INITIALIZATION IN STORAGE ENVIRONMENT - A method, apparatus, and computer program product for initializing a plurality of extents in a computing storage environment is provided. A plurality of states for each of the plurality of extents is defined to include either an initialized state or a modified state. The plurality of extents is initialized at an advance time, designating the plurality of extents as having the initialized state. Upon a first occurrence of a destage operation of a first extent of the plurality of extents, the first extent is designated as having the modified state. | 04-01-2010 |
| 20100082932 | HARDWARE AND FILE SYSTEM AGNOSTIC MECHANISM FOR ACHIEVING CAPSULE SUPPORT - Methods and apparatus relating to a hardware and file system agnostic mechanism for achieving capsule support are described. In one embodiment, content associate with a capsule are stored in a non-volatile memory prior to a cold reset. A capsule descriptor may also be constructed, prior to the reset, which includes information about the physical location of the capsule content on the non-volatile memory. Other embodiments are also described and claimed. | 04-01-2010 |
| 20100088482 | Process and Method for Erase Strategy in Solid State Disks - An embodiment of the invention relates to a nonvolatile mass storage device such as a flash memory device formed with erase blocks partitioned into memory management blocks. An erase block is identified containing at least a minimum number of management blocks marked invalid, from which data is copied, merged, and stored in a new management block. The erase block is then erased. Erase blocks containing at least the minimum number of invalid management blocks may be erased until a minimum amount of management blocks is free. Alternatively, all erase blocks containing at least the minimum number of invalid management blocks may be erased. A management table listing the number of invalid management blocks in erase blocks may be included in the mass storage device. Preferably, the new management block for storage of the merged data is located in an erase block different from the identified erase block. | 04-08-2010 |
| 20100106932 | CONTROL APPARATUS - A control apparatus, control method and computer readable article of manufacture for controlling data. The control apparatus includes a data storage unit; a plurality of entry storage units, and a plurality of registration units. The data storage unit stores data. Each of the entry storage units stores an entry for registering a pointer to data. If each of the registration units receives an instruction for registering data, then each registration unit (i) searches the entry storage units for an entry storage unit having an empty entry, (ii) registers a pointer to the data to be registered in the retrieved entry storage unit and (iii) stores the data to be registered and identification information of the retrieved entry storage unit in the data storage unit in such a manner that the data to be registered and the identification information is associated with each other. | 04-29-2010 |
| 20100122058 | Memory page eviction based on present system operation - Systems, methods, and other embodiments associated with selecting a memory page for removal from a buffer pool based on the operating conditions of a computing system. | 05-13-2010 |
| 20100125714 | DELETE NOTIFICATIONS FOR AN ENTIRE STORAGE VOLUME - 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 volume. If the delete notification does not apply to the entire storage volume, 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 volume, a second set of actions can be taken with the storage stack filter in response to the delete notification. | 05-20-2010 |
| 20100146236 | SYSTEM, METHOD, AND COMPUTER PROGRAM PRODUCT FOR RENDERING AT LEAST A PORTION OF DATA USELESS IN IMMEDIATE RESPONSE TO A DELETE COMMAND - A system, method, and computer program product are provided for rendering at least a portion of data useless in immediate response to a delete command. In operation, a delete command directed to an operating system is received for deleting data from memory. Furthermore, in immediate response to the delete command, a process is initiated for rendering at least a portion of the data useless. | 06-10-2010 |
| 20100191928 | AUTOMATIC REGION-BASED VERIFICATION OF GARBAGE COLLECTORS - Systems and methods that add specifications to procedures in a garbage collector for indicating what each procedure does. Such annotations can be added in the source code, to indicate what the source code is to do when it runs—hence enabling an automatic verification of the garbage collector by a verification component. The specification can be presented as a logical formula that can be readily processed by a theorem prover, which is associated with the verification component. Such logical formulas can further employ regions to specify correctness of the garbage collector. | 07-29-2010 |
| 20100199056 | FRACTURED ERASE SYSTEM AND METHOD - Efficient and convenient storage systems and methods are presented. In one embodiment, a fractured erase process is performed in which a pre-program process, erase process and soft program process are initiated independently. Memory cells can be pre-programmed and conditioned independent of an erase command. The initiation of the independent pre-programming is partitioned from an erase command which is partitioned from initiation of a soft-programming command. A cell is erased wherein the erasing includes erase operations that are partitioned from the pre-preprogramming process. In one embodiment, the independent pre-program process is run in the background. | 08-05-2010 |
| 20100217947 | DISCONTIGUOUS OBJECT ADDRESSING - Some embodiments of discontiguous object addressing have been presented. In one embodiment, a set of objects, each having one or more properties, are stored in a memory of a computer system. The memory is divided into chunks. The properties of at least one of the objects are stored in discontiguous chunks of the memory. Furthermore, a processor in the computer system may independently access the individual properties in the discontiguous chunks of memory. | 08-26-2010 |
| 20100223442 | Computer system and data erasing method - Provided is a computer system for identifying all physical resources which have been allocated to logical units before to be subject to shredding and for performing shredding on the identified physical resources. All the physical resources related to the physical resources specified by a user to be subject to data erasing are selected using usage history for the storage system. Moreover, a shredding task for the selected physical resources is generated according to configuration information of the storage system and shredding is performed based on the generated task. Consequently, the data is completely erased. | 09-02-2010 |
| 20100235600 | System and Method of Waste Management - A method of application waste management in a wireless device is provided. The method comprised a first low-memory event. Deleting a first set of data records incrementally until event is cleared or no more records are present. Determining a second low-memory event when memory is still low. Executing a clean-up script to mark additional data records for deletion. Deleting the second set of data records until the second low-memory condition are cleared or no more records are present. | 09-16-2010 |
| 20100235601 | METHOD AND SYSTEM FOR ENABLING PERSONAL DIGITAL ASSISTANTS AND PROTECTING STORED PRIVATE DATA - A method and system for enabling personal digital assistants (PDAs) and protecting stored private data. Specifically, one embodiment in accordance with the present invention includes a removable expansion card about the size of a postage stamp which plugs into a slot of a personal digital assistant. The removable expansion card, referred to as a personality card, is capable of storing all of a user's private information and data which is used within their personal digital assistant. By removing the personality card from the personal digital assistant, all of the user's private information and data may be removed from the personal digital assistant. Furthermore, the personal digital assistant may also be rendered totally or partially useless once the personality card is removed from it. There are several advantages associated with a personality card system in accordance with the present invention. For example, one of the advantages is that a user is able to restrict access to their stored private information and data by simply removing their personality card from their personal digital assistant. Furthermore, as personal digital assistants equipped with personality card slots become increasingly more common, a user will be able to continually carry around their personality card and enable a spare and locally available personal digital assistant with their private information when desired. | 09-16-2010 |
| 20100262802 | Reclamation of Thin Provisioned Disk Storage - A thin provisioned storage system may have a file system manager that presents a logical storage system to a user and a storage management system that manages physical storage devices. When a block of data is freed at the logical layer, the file system manager may identify the freed block and send a command to the physical layer. The physical layer may identify the corresponding physical block or blocks and free those blocks on the physical layer. The storage management system may use a table to manage the location of blocks of data across multiple physical storage devices. | 10-14-2010 |
| 20100274986 | CONTROL APPARATUS AND CONTROL METHOD THEREFOR - When a controller receives a new command from a main controller during overwrite-deletion processing for a specific storage apparatus, the received command is stored at least until completion of the overwrite-deletion processing when the received command is a command to the specific storage apparatus. Alternatively, progression of overwrite-deletion process is stored and priority processing of the received command is executed. On the other hand, when the received command is not a command to the specific storage apparatus, processing for the command is executed. | 10-28-2010 |
| 20100299494 | MEMORY WITH BLOCK-ERASABLE LOCATIONS AND A LINKED CHAIN OF POINTERS TO LOCATE BLOCKS WITH POINTER INFORMATION - A memory apparatus has a main memory ( | 11-25-2010 |
| 20110004738 | DATA STORAGE DEVICE AND DATA MANAGEMENT METHOD - A data storage device for storing and managing data includes a data memory, an input unit, a data writer, and a data deleter. The data memory stores data. The data memory includes a preferential deletion area for storing data which needs to be preferentially deleted. The input unit accepts input data. The data writer stores the input data in the data memory. The data deleter deletes data stored in the data memory. The data deleter starts to delete data stored in the preferential deletion area before starting to delete data stored in the data memory other than the preferential deletion area when a predefined condition is satisfied. | 01-06-2011 |
| 20110078402 | MEMORY SYSTEM - A memory system includes a non-volatile semiconductor memory that includes a plurality of blocks, each of the blocks being a data erasing unit; an erasing time monitoring unit that monitors time required for erasing data from the non-volatile semiconductor memory; a management table for managing the erasing time on a unit of each of the blocks; and a wear-leveling control unit that levels number of rewriting across the blocks based on the management table. The memory system accommodates variations among lots, individual pieces, and blocks, thereby performing highly-accurate wear leveling. | 03-31-2011 |
| 20110078403 | METHOD AND TERMINAL DEVICE FOR ERASING DATA OF TERMINAL - A method for erasing data of a terminal includes: receiving a data erasing request from a management server; deleting data corresponding to an erasing range node according to a value of a flag bit of the erasing range node in an erasable list; and deleting the erasing range node from the erasable list. | 03-31-2011 |
| 20110082995 | INFORMATION PROCESSING APPARATUS - An information processing apparatus includes a storage unit configured to include a plurality of storage areas, a receiving unit configured to receive updating data for updating data stored in the storage unit, and a control unit configured to update the data stored in the storage unit based on the received updating data, wherein when the receiving unit receives the updating data for updating a portion of data stored in a first storage area among the plurality of storage areas, the control unit deletes data stored in a second storage area among the plurality of storage areas, writes the data stored in the first storage area in the second storage area, deletes the data in the first storage area, and then updates the data in the first storage area using the updating data received by the receiving unit and the data written in the second storage area. | 04-07-2011 |
| 20110093677 | System and Method for Write Once Read Many (WORM) Storage in an Information Handling System - A Write-Once Read-Many (WORM) memory controller receives data from a processing system that is addressed to a location in a storage device, stores the data and a tag at the location, receives second data from the processing system that is addressed to the location, determines that the location includes the tag, and prevents the second data from being stored at the location based upon the presence of the tag. A WORM memory device sends a reply to a controller in response to an initialization command. The reply includes an address number that corresponds with the storage capacity of the WORM memory device. The WORM memory device sends another reply to another controller in response to another initialization command. The initialization commands are different from each other. The other initialization reply includes an address number of zero. | 04-21-2011 |
| 20110093678 | ONBOARD SYSTEM - A control unit (main CPU | 04-21-2011 |
| 20110119461 | FILE SYSTEM QUOTA AND RESERVATION - A method, in one embodiment, can include allowing storage allocation of data of a file system within an object based storage system. Furthermore, the method can include determining if storage allocation usage for the file system is below a threshold. If the storage allocation usage for the file system is not below the threshold, a client is requested to flush its dirty data associated with the file system. After requesting a client flush, the method can include determining the storage allocation usage for the file system. In addition, the method can include determining periodically if the storage allocation usage has reached a quota. If the quota is reached, the quota is enforced for the data of the file system. | 05-19-2011 |
| 20110119462 | METHOD FOR RESTORING AND MAINTAINING SOLID-STATE DRIVE PERFORMANCE - A method of maintaining a solid-state drive so that free space within memory blocks of the drive becomes free usable space to the drive. The drive comprises cells organized in pages that are organized in memory blocks in which at least user files are stored. A defragmentation utility is executed to cause at least some of the memory blocks that are partially filled with data and contain file fragments to be combined or aligned and to cause at least some of the memory blocks that contain only invalid data to be combined or aligned. A block consolidation utility is then executed to eliminate at least some of the partially-filled blocks by consolidating the file fragments into a fewer number of the memory blocks. The consolidation utility also increases the number of memory blocks that contain only invalid memory. All of the memory blocks containing only invalid data are then erased. | 05-19-2011 |
| 20110138144 | COMPUTER PROGRAM, APPARATUS, AND METHOD FOR MANAGING DATA - A computer in a disk node executes a data management program. A deduplication-eligible data unit detection module detects a data unit whose deduplication grace period after last write time has expired. A deduplication address fetch module interacts with an index server to obtain a deduplication address associated with a unique value of data stored in a constituent storage space allocated to the data unit that is found to be deduplication-eligible. A constituent storage space deallocation module stores the obtained deduplication address in a data unit record memory, together with information indicating the detected data unit. Simultaneously a constituent storage space deallocation module releases the allocated constituent storage space from the detected data unit. | 06-09-2011 |
| 20110161614 | Pre-leak detection scan to identify non-pointer data to be excluded from a leak detection scan - A computer-implemented method of detecting memory that may be reclaimed from application data objects that are no longer in use. When at least a first virtual memory region is newly committed for heap block storage, a pre-leak detection scan of other virtual memory regions can be performed to identify at least one non-pointer data item in the other virtual memory regions, the non-pointer data item comprising data that corresponds to an address of a memory location within the first virtual memory region, but that is not a memory pointer. A leak detection scan can be performed to identify potential memory pointers, wherein the identified non-pointer data item is excluded from the identified potential memory pointers. A list of leaked heap blocks can be output. Each leaked heap block can exclusively comprise memory locations that do not have a corresponding potential memory pointer. | 06-30-2011 |
| 20110161615 | MEMORY MANAGEMENT DEVICE, MEMORY MANAGEMENT METHOD, AND MEMORY MANAGEMENT PROGRAM - One or more embodiments provide a technique of improving the conventional thread-local garbage collection (GC) so as to avoid fragmentation. A memory management device having a plurality of processors implementing transactional memory includes a write barrier processing unit which, when performing write barrier in response to initiation of a pointer write operation, registers an object that is located outside of a local area and that has a pointer pointing to an object located in the local area in a write log so as to set it as a target of conflict detection, and a garbage collector which, provided that no conflict is detected, copies a live shared object in the local area to the outside of the local area and collects any unwanted object irrespective of whether it is shared or not. | 06-30-2011 |
| 20110179244 | STORAGE APPARATUS AND DATA WRITING METHOD - A storage apparatus is disclosed which includes: a memory configured to have a plurality of pages to which data can be written in units of a page, the memory being further configured to have a plurality of pages of write data stored into each page in multi-valued form; and a control section configured to select pages to which to write the data from among the plurality of pages of the memory, the control section being further configured to write to the selected pages of the memory the data of at least two bits in multi-valued form for a plurality of pages including the selected pages; wherein, when writing the plurality of pages of the write data, the control section puts the write data into multi-valued form per page before writing the data to a plurality of different unused pages of the memory on a page-by-page basis. | 07-21-2011 |
| 20110185143 | RESET DAMPENER - A memory reset system including a first memory socket and a second memory socket. A reset signal generator can generate a reset signal to the first memory socket. A dampener circuit can receive the reset signal from the reset signal generator and transmit a dampened reset signal to the second memory socket. | 07-28-2011 |
| 20110185144 | Low-Contention Update Buffer Queuing for Small Systems - A method for queuing update buffers to enhance garbage collection. The method includes running an application thread and providing, for the application thread, a data structure including current and finished update buffer slots. The method includes providing an update buffer for the application thread and storing a pointer to the update buffer in the current update buffer slot. The method includes storing null in the finished update buffer slot and, with the application thread, writing to the update buffer. The thread may write a pointer to the filled update buffer in the finished update buffer slot after the buffer is filled. The method includes using a garbage collector thread to inspect the finished update buffer slot and claim filled buffers and change the pointer to null. The thread then obtains an empty update buffer and updates the current update buffer slot to point to the new buffer. | 07-28-2011 |
| 20110191563 | ON DEMAND CONVERSION OF STANDARD LOGICAL VOLUMES TO THIN-PROVISIONED LOGICAL VOLUMES - A method for concurrently converting a standard volume to a thin-provisioned volume includes initially establishing metadata for a thin-provisioned volume. The method then updates the metadata for the thin-provisioned volume to point to extents residing in a standard volume. The method then suspends I/O to metadata for the standard volume. Upon suspending the I/O, the method migrates control of the extents in the standard volume from a standard-volume control algorithm to a thin-provisioned-volume control algorithm. The method then resumes the I/O to the metadata for the thin-provisioned volume. Using this technique, standard volumes may be rapidly converted to thin-provisioned volumes while minimally disrupting I/O to the volumes. A corresponding apparatus and computer program product are also disclosed and claimed herein. | 08-04-2011 |
| 20110197045 | MEMORY SYSTEM - According to the embodiments, a memory system includes a nonvolatile semiconductor memory and a writing-loop-count monitoring unit that monitors a loop count of an applied voltage to the nonvolatile semiconductor memory required for data writing of the nonvolatile semiconductor memory as a writing loop count. Moreover, the memory system includes a management table for managing the writing loop count in block unit that is a unit of data erasing and a life managing unit that determines a degraded state of the nonvolatile semiconductor memory based on the management table. | 08-11-2011 |
| 20110296132 | GARBAGE COLLECTION IN AN IN-MEMORY REPLICATION SYSTEM - Garbage collection in a first node server of an in-memory replication system includes: in response to a garbage collection trigger in the first node server, determining whether identification information for a data object eligible for garbage collection in the first node server has been received by the first node server from at least a second node server in the in-memory replication system; and if the identification information has been received from at least the second node server, performing garbage collection on the data object with the first node server. | 12-01-2011 |
| 20110302384 | COMPUTER READABLE MEDIUM STORING INFORMATION PROCESSING PROGRAM, INFORMATION PROCESSING APPARATUS, AND INFORMATION PROCESSING METHOD - A computer readable medium stores a program causing a computer to execute a process including receiving an instruction for deleting an information group from a first memory; extracting, from the first memory, information regarding information groups having a parent-child relationship with a target information group to be deleted in accordance with the received instruction; extracting a user identification code associated with the target information group from a second memory; storing an identification code of the target information group, the information regarding the information groups, and the extracted user identification code in association with one another in a third memory; deleting the target information group from the first memory; and changing the structure information stored in the first memory to structure information obtained after the target information group has been deleted from the first memory, by changing the child information group as a child of the parent information group. | 12-08-2011 |
| 20120005444 | MICROCODE RENAME RECLAMATION - A method of operating a processor includes reclaiming a physical register renamed as a microcode architectural register used by a microcode routine. The physical register is reclaimed according to an indicator corresponding to the microcode architectural register and indicating that a pointer to the physical register and corresponding to the microcode architectural register is an active pointer. | 01-05-2012 |
| 20120023303 | STORAGE DEVICE ERASE COMMAND HAVING A CONTROL FIELD CONTROLLABLE BY A REQUESTOR DEVICE - A storage device includes storage media and a controller to control access of the storage media. The controller receives an erase command used to specify an erase operation of at least one portion of the storage media. The erase command has a control field controllable by a requestor device that submitted the erase command to the storage device, where the control field has one or more portions settable to cause the storage device to perform one or more of: reporting a progress of the erase operation, and modifying an operational state of the erase operation. | 01-26-2012 |
| 20120030444 | STORAGE CONTROL DEVICE AND DATA PROCESSING SYSTEM - A storage medium management part includes a stored data amount adjustment part that: stores a maximum data amount which the storage medium can store at the time of startup of a storage control device, and a stored data amount which is an initial stored amount, in a data amount storage part; upon receiving a write amount of a data in response to a write request, writes a new stored data amount calculated by adding the write amount to the already stored data amount, over the already stored data amount; calculates a free space by subtracting the stored data amount from the maximum data amount; determines a deletion amount of the data if the free space does not takes a value not less than a prescribed value; and writes a newly-calculated stored data amount calculated by subtracting the deletion amount from the stored data amount, over the stored data amount. | 02-02-2012 |
| 20120084530 | Data Control Method, Data Controller, and Computer Program Product - According to one embodiment, a computer program product includes a non-transitory computer-readable storage medium having computer readable program codes embodied in the medium that are executed on a computer. The computer comprises a storage module that stores a plurality of contents. The use order in which the contents are used is determined. The codes, when executed on the computer, cause the computer to perform: transmitting the contents to an external device to store the contents therein; first determining whether each of the contents stored in the storage module satisfies use condition determined according to the use order; deleting content that does not satisfy the use condition from the storage module; second determining whether content, which is stored in the external device and is not stored in the storage module, satisfies the use condition; and receiving the content from the external device if the content satisfies the use condition. | 04-05-2012 |
| 20120124316 | LEAKAGE REDUCTION IN STORAGE ELEMENTS VIA OPTIMIZED RESET STATES - Various methods are provided for leakage reduction via optimized reset states and improving performance for storage elements. The methods include selecting a storage element, where the storage element comprises at least one storage element component sized to reduce static current leakage or at least one storage element component adapted to increase at least one of speed or performance of the storage element. The methods also call for determining a preferred reset state for the storage element, wherein the preferred reset state is based at least upon the reduction of static current leakage, the speed or the performance of the storage element. The methods also call for setting the storage element reset state to the preferred reset state. An additional method calls for determining if a storage element spends a predetermined amount of time in a static state, and determining a preferred reset state for the storage element based upon at least the static state in which the storage element spends the at least a predetermined amount of time. The additional method also calls for setting a preferred reset state based at least upon the static state in which the storage element spends the at least a predetermined amount of time. | 05-17-2012 |
| 20120144145 | APPARATUS AND METHOD FOR MEASURING LIFESPAN OF MEMORY DEVICE - A method for measuring a lifespan of a memory device includes measuring an operation time of the memory device and generating lifespan information by comparing the measured operation time with a reference operation time. | 06-07-2012 |
| 20120151169 | STORAGE APPARATUS - It is an object of the present invention to provide a storage apparatus that can suppress access performance degradation owing to processing of data deduplication. The storage apparatus according to the present invention acquires a sum of the access frequencies to each of redundantly allocated pieces of data, and performs the deduplication on the pieces of data having the sum of access frequencies less than a prescribed threshold (FIG. | 06-14-2012 |
| 20120151170 | SYSTEM AND METHOD OF SQUEEZING MEMORY SLABS EMPTY - A system and method of squeezing slabs of memory empty are provided. A slab is a block of allocated memory space that is dedicated to holding one type of data. When it is determined that a slab of memory is to be squeezed empty, no object may be allocated from the slab. That is, new data is precluded from being placed in any unused space of the slab. Further, data is also precluded from being placed in any space in the slab that becomes unused anytime thereafter. When the slab becomes empty, the slab is de-allocated. | 06-14-2012 |
| 20120166750 | SYSTEM AND METHOD FOR MANAGING RESETS IN A SYSTEM USING SHARED STORAGE - A method of managing storage device resets in a system using shared storage is provided. A reset instruction is received at a shared storage device from a first node. In response, the storage device is at least partially reset, including aborting one or more queued I/O commands including a first I/O command received from a second node. A reset notification timer is started. If an I/O command is received from the second node during the reset notification timer, in response to receiving the I/O command the second node is notified of the storage device reset such that the second node can determine that the first I/O command was aborted. If no I/O command is received from the second node during the reset notification timer, at the expiration of the timer, the second node is notified of the storage device reset such that the second node can determine that the first I/O command was aborted. | 06-28-2012 |
| 20120173835 | SELECTIVE REGISTER RESET - The present disclosure includes methods, devices, modules, and systems for storing selective register reset. One method embodiment includes receiving an indication of a die and a plane associated with at least one address cycle. Such a method can also include selectively resetting a particular register of a number of registers, the particular register corresponding to the plane and the die. | 07-05-2012 |
| 20120191935 | ITERATIVELY DE-ALLOCATING ACTIVE OBJECTS ASSOCIATED WITH VIRTUAL FUNCTIONS OF AN ADAPTER - A method of managing memory may include selecting an object of a memory heap to be de-allocated and initiating a deferred lock configured to delay de-allocation of the object. The deferred lock may be acquired in response to a thread leaving a computing space, and the object may be de-allocated. | 07-26-2012 |
| 20120210088 | MANAGEMENT DEVICE, STORAGE MEDIUM, AND MANAGEMENT METHOD - The management device includes a storing unit, a determining unit, and a deleting unit. The storing unit stores data in a memory unit. When a retention period the stored data reaches a retention period specified for each data type, the determining unit | 08-16-2012 |
| 20120216006 | INFORMATION PROCESSING APPARATUS AND INFORMATION PROCESSING METHOD THAT SELECTS DATA TO BE DELETED WITHOUT A USER HAVING TO PERFORM A DELETE OPERATION - An information processing apparatus and an information processing method are capable of correctly selecting data to be deleted, without a user having to perform a troublesome operation. In a backup operation, a determination is made for each image file as to whether a predetermined condition is satisfied. If the condition is satisfied, image files are backed up, and storage priority levels defined for these image files are reduced in accordance with a rule predefined by a user. The storage priority level is a measure indicating the priority of keeping an image file in a storage unit. The higher the storage priority, the lower the probability that image files are deleted. The storage priority levels are changed depending on whether image files have been backed up and depending on the number of times image files were backed up. | 08-23-2012 |
| 20120246433 | TECHNIQUES TO MANAGE A COLLECTION OF OBJECTS IN HETEROGENEOUS ENVIRONMENTS - Techniques to perform garbage collection in an environment where more than one software programming language is in use are described. A technique may include creating a managed proxy object in one language that creates an unmanaged object in memory in a different language. A collection of nodes is generated and maintained, where a node comprises: a reference to the managed proxy object, and a reference to the unmanaged object. A count of the nodes in the collection is maintained. When the count exceeds a threshold, the collection is traversed, and garbage collection is performed on any unmanaged object in a node when the managed proxy object in the same node has been collected. Other embodiments are described and claimed. | 09-27-2012 |
| 20120278579 | Self-Initiated Secure Erasure Responsive to an Unauthorized Power Down Event - Method and apparatus for self-initiated secure erasure of data from a non-volatile memory, such as a solid state drive (SSD). In accordance with various embodiments, the memory is operated in communication with a host device. A self-initiated, non-destructive secure erasure of the data stored in the memory is carried out responsive to a detection of an unauthorized power down event associated with the memory. | 11-01-2012 |
| 20120278580 | DATA STORAGE RECLAMATION SYSTEMS AND METHODS - Storage systems and methods are presented. In one embodiment, a storage reclamation method comprises performing a potential reclamation identification process, wherein the potential reclamation identification process includes determining if there is the potential for reclaiming storage resources; performing a reclamation process, wherein reclamation is performed on storage resources identified by the potential reclamation identification process as being eligible for reclamation, and wherein the storage resources correspond to free space associated with a data file; and performing a valid free space indication process, wherein a valid free space indication process includes forwarding a valid free space indication recognizable to an application as a valid free space indication when the application attempts to direct a read to the storage spaces reclaimed by the reclamation process. | 11-01-2012 |
| 20120278581 | METHOD AND SYSTEM FOR DYNAMIC MEMORY MANAGEMENT - A computer system which includes a plurality of threads and a garbage collector that traces memory objects and identifies memory objects according to a three-color abstraction. The computer system also includes two methods of deleting compiled code in a self-modifying multi-threaded computer system. The computer system also utilizes a method of handling links between fragments of code in a self-modifying multi-threaded computer system. The computer system also handles patches between two pieces of code. | 11-01-2012 |
| 20120278582 | MAGNETIC MEMORY ELEMENT, MAGNETIC MEMORY AND INITIALIZING METHOD - A magnetic memory element includes: a first magnetization free layer; a non-magnetic layer; a reference layer; a first magnetization fixed layer group; and a first blocking layer. The first magnetization free layer is composed of ferromagnetic material with perpendicular magnetic anisotropy and includes a first magnetization fixed region, a second magnetization fixed region and a magnetization free region. The non-magnetic layer is provided near the first magnetization free layer. The reference layer is composed of ferromagnetic material and provided on the non-magnetic layer. The first magnetization fixed layer group is provided near the first magnetization fixed region. The first blocking layer is provided being sandwiched between the first magnetization fixed layer group and the first magnetization fixed region or in the first magnetization fixed layer group. | 11-01-2012 |
| 20120284477 | EXECUTION OF A PERFORM FRAME MANAGEMENT FUNCTION INSTRUCTION - Optimizations are provided for frame management operations, including a clear operation and/or a set storage key operation, requested by pageable guests. The operations are performed, absent host intervention, on frames not resident in host memory. The operations may be specified in an instruction issued by the pageable guests. | 11-08-2012 |
| 20120290809 | System and Method of Secure Garbage Collection on a Mobile Device - A method and system for performing garbage collection involving sensitive information on a mobile device. Secure information is received at a mobile device over a wireless network. The sensitive information is extracted from the secure information. A software program operating on the mobile device uses an object to access the sensitive information. Secure garbage collection is performed upon the object after the object becomes unreachable. | 11-15-2012 |
| 20120303920 | HARD DRIVE ERASER - Systems, apparatuses and methods for erasing hard drives. A system, which can be configured as a stand-alone and portable apparatus, includes a control device configured to support an erase module. The erase module is configured to erase a hard drive such that data erased from the hard drive is forensically unrecoverable. The system further includes a user interface and at least one drive bay configured to provide communication between a hard drive and the control device. | 11-29-2012 |
| 20120311288 | SECURE STORAGE OF FULL DISK ENCRYPTION KEYS - Data is securely stored on a storage device by encoding a data block into multiple encoded blocks, any number of which can be recombined to recover the data block. The encoded blocks are stored at known logical locations corresponding to physical locations on a storage device that change over time. When the data needs to be destroyed, at least one of the encoded blocks is overwritten with arbitrary data. In one aspect, the encoded blocks include at least one random block that is used to encode the data block. In another aspect, the known logical locations are stored in metadata. | 12-06-2012 |
| 20120317386 | CLEARING BLOCKS OF STORAGE CLASS MEMORY - An abstraction for storage class memory is provided that hides the details of the implementation of storage class memory from a program, and provides a standard channel programming interface for performing certain actions, such as controlling movement of data between main storage and storage class memory or managing storage class memory. | 12-13-2012 |
| 20130031325 | System for Updating an Associative Memory - A system includes an associative memory, a first table, a second table, a comparator, and an updater. The associative memory may include data and associations among data and may be built from the first table. The first table may include a record with a first and second field. The associative memory may be configured to ingest the first field and avoid ingesting the second field. The second table may include a record with a third field storing information indicating whether the first field has been ingested by the associative memory or has been forgotten by the associative memory. The comparator may be configured to compare the first and second table to identify one of whether the first field should be forgotten or ingested by the associative memory. The updater may be configured to update the associative memory by performing one of ingesting or forgetting the first field. | 01-31-2013 |
| 20130103916 | CLEARING BLOCKS OF STORAGE CLASS MEMORY - An abstraction for storage class memory is provided that hides the details of the implementation of storage class memory from a program, and provides a standard channel programming interface for performing certain actions, such as controlling movement of data between main storage and storage class memory or managing storage class memory. | 04-25-2013 |
| 20130124812 | FACILITATION OF SIMULTANEOUS STORAGE INITIALIZATION AND DATA DESTAGE - Various embodiments for storage initialization and data destage in a computing storage environment are provided. At least a portion of data on a storage device is initialized using a background process, while one of simultaneously and subsequently destaging the at least the portion of the data to the storage device using a foreground process is performed. A persistent metadata bitmap, adapted to indicate whether the at least the portion of the data has been initialized, is staged to cache, the cache operable in the computing storage environment. The background process maintains a volatile bitmap indicating a status of the initialization of the at least the portion of the data in direct correspondence to the metadata bitmap. As the background process initializes the at least the portion of the data, an applicable bit on the persistent metadata bitmap is cleared and a corresponding bit is set on the volatile bitmap. | 05-16-2013 |
| 20130124813 | METHODS AND SYSTEMS FOR FORMATTING STORAGE VOLUMES - Methods, systems, and computer storage mediums including a computer program product method for formatting storage volumes are provided. One method includes creating a storage volume including a global counter and partitioned into multiple storage segments including a segment counter and partitioned into multiple stripes, wherein the global counter and each segment counter match at an initial time. The method further includes releasing the storage segments prior to completely reformatting the storage volume and subsequently incrementing the global counter such that the global counter and each segment counter no longer match at a subsequent time. The method further includes enabling a user to write data to the storage segments prior to completely reformatting the storage volume in response to incrementing the global counter. One system includes a processor for performing the above method and one computer storage medium includes a computer program product configured to perform the above method. | 05-16-2013 |
| 20130145116 | COMPACTING DISPERSED STORAGE SPACE - A method begins by a processing module identifying a first storage space zone that includes a plurality of deleted encoded data slices and a plurality of active encoded data slices. The method continues with the processing module determining to compact the first storage space zone based on a function of the plurality of deleted encoded data slices and the plurality of active encoded data slices. The method continues with the processing module retrieving the plurality of active encoded data slices from the first storage space zone, identifying a second storage space zone, storing the plurality of active encoded data slices in the second storage space zone, and erasing the plurality of deleted encoded data slices and the plurality of active encoded data slices from the first storage space zone when the first storage space zone is to be compacted. | 06-06-2013 |
| 20130238873 | METHOD FOR CLEARING COMPUTER DATA AND COMPUTER - The disclosure provides a method for clearing computer data and a computer. The method comprises: a computer receiving a command for clearing data through a wireless network, or sensing that the computer is disassembled and then generating the command for clearing data; and the computer clearing data in the memory of the computer. In the disclosure, the computer is powered on and started only upon obtaining a starting authorization of a user, so as to improve confidentiality of computer data; and further, the data can be cleared or be not cleared according to whether it is successful to match a password, or the data can be cleared after obtaining a command of a user if it is not successful to match the password. Therefore, the confidentiality of user data is improved, and the user data is kept confidential and is prevented from being leaked. | 09-12-2013 |
| 20130246730 | SEMICONDUCTOR MEMORY DEVICE AND METHOD FOR WRITING THEREIN - According to one embodiment, a semiconductor memory device includes a plurality of blocks in a memory cell, each of the blocks acting as an erasure unit of data, the block including a plurality of pages, each of the pages including a plurality of memory cell transistors, each of the memory cell transistors being configured to be an erasure state or a first retention state based on a threshold voltage of the memory cell transistor, and a controller searching data in the block with respect to, writing a first flag denoting effective into a prescribed page of the block with the erasure state, and writing the first flag denoting non-effective into a prescribed page of the block with the first retention state, reading out the prescribed page of the block with the first retention state, and determining that the block is writable when the first flag denotes effective. | 09-19-2013 |
| 20130254507 | USING DIFFERENT SECURE ERASE ALGORITHMS TO ERASE CHUNKS FROM A FILE ASSOCIATED WITH DIFFERENT SECURITY LEVELS - Provided are a computer program product, system, and method for using different secure erase algorithms to erase chunks from a file associated with different security levels. A request is received to secure erase a file having a plurality of chunks stored in at least one storage device. A determination is made of a first secure erase algorithm to apply to a first chunk in the file in response to the request and of a second secure erase algorithm to apply to a second chunk in the file in response to the request. The first secure erase algorithm is applied to erase the first chunk and the second secure erase algorithm is applied to erase the second chunk. The first and second secure erase algorithms use different processes to erase the chunks to which they are applied. | 09-26-2013 |
| 20140032870 | SYSTEM LSI - The present invention provides a system LSI that integrates, on a single semiconductor, a logic circuit, a CPU, and a program memory storing a program of the CPU. The system LSI includes a program eraser erasing contents stored in the program memory, and at least two program erasing trigger terminals controlling execution of the program eraser. The program eraser erases a program stored in the program memory on the basis of potentials of the two program erasing trigger terminals. | 01-30-2014 |
| 20140040586 | Orphan Storage Release - A method, system and computer readable medium that identify orphan storage and release the orphaned storage before application or system outages can result. More specifically, in certain embodiments, a method, system and computer readable medium periodically scan through common memory storage and identifies those areas that are no longer associated with a running task or have been allocated for longer than a running task with a matching task address. These areas are then identified as potentially orphaned storage locations. | 02-06-2014 |
| 20140052952 | 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-20-2014 |
| 20140082313 | STORAGE CLASS MEMORY EVACUATION - Embodiments relate to methods, systems and computer program products for evacuating a portion of a storage class memory. Upon receiving a request to evacuate the portion of the storage class memory a determination is made if the requested evacuation will result in a storage shortage. Based upon determining that the requested evacuation will not result in a storage shortage, the portion of the storage class memory is initialized for evacuation. After initialization is complete, evacuation of the plurality of address spaces of the portion of the storage class memory is preformed, wherein one or more of the plurality of address spaces are evacuated in parallel. | 03-20-2014 |
| 20140082314 | CONTROL APPARATUS AND CONTROL METHOD THEREFOR - When a controller receives a new command from a main controller during overwrite-deletion processing for a specific storage apparatus, the received command is stored at least until completion of the overwrite-deletion processing when the received command is a command to the specific storage apparatus. Alternatively, progression of overwrite-deletion process is stored and priority processing of the received command is executed. On the other hand, when the received command is not a command to the specific storage apparatus, processing for the command is executed. | 03-20-2014 |
| 20140089618 | METHOD AND SYSTEM TO PROVIDE STORAGE UTILIZING A DAEMON MODEL - A method and system for providing storage using a daemon model. An example system comprises a parent daemon trigger configured to launch a parent storage daemon in response to a storage command from a client, a parent daemon module to perform storage access pre-processing operations to generate initialization data, a storage command detector, a child process trigger module to launch a child process in response to a subsequent storage command, and a child processing module to process subsequent storage commands using the child process. | 03-27-2014 |
| 20140089619 | OBJECT REPLICATION FRAMEWORK FOR A DISTRIBUTED COMPUTING ENVIRONMENT - A device may receive information that identifies a data item and a data item operation. The device may store a first sequence identifier, a data item reference that references the data item, and an operation reference that references the operation. The first sequence identifier may reference the data item and operation references, and may indicate an order in which the first sequence identifier is stored. The device may store the data item in a memory location, may store an identification of the memory location, may remove a reference to the data item by a previous sequence identifier, and/or may add the data item, may modify the data item, or may delete the data item depending on whether the operation is an add operation, a modify operation, or a delete operation. The device may transmit, to a slave device, the first sequence identifier, the data item reference, and the operation reference. | 03-27-2014 |
| 20140115291 | NUMA OPTIMIZATION FOR GARBAGE COLLECTION OF MULTI-THREADED APPLICATIONS - Methods and systems for garbage collection are provided. The method includes and the system is configured for assigning a garbage collection thread to execute on a first node of a plurality of nodes in a non-uniform memory access (NUMA) computing system, determining whether each of a plurality of application threads is a local thread that is active on the first node, and selecting the local thread for garbage collection by the garbage collection thread when the local thread is active on the first node. | 04-24-2014 |
| 20140122821 | COMPUTER SYSTEM HAVING MAIN MEMORY AND CONTROL METHOD THEREOF - Provided are a computer system and a method of controlling the same. The computer system includes: a central processing unit (CPU) configured to drive an application program; and a main memory configured to provide the CPU with a memory space for driving of the application program and to store a processing result of the CPU. The main memory includes: a nonvolatile memory including a first memory area configured to store data and a second memory area configured to store address information of the data; a memory controller configured to control the nonvolatile memory; and a memory manager configured to read the address information from the second memory area and delete the data stored at the first area according to the read address information, in response to a data delete command from the CPU and a control of the memory controller. | 05-01-2014 |
| 20140181451 | HARDWARE COMMAND TRAINING FOR MEMORY USING WRITE LEVELING MECHANISM - A method of training a command signal for a memory module. The method includes programming a memory controller into a mode wherein a single bit of an address signal is active for a single clock cycle. The method then programs a programmable delay line of the address signal with a delay value and performs initialization of the memory module. The memory module is then placed in a write leveling mode. A write leveling procedure is then performed and a response thereto is determined from the memory module. A determination is made whether the memory module is in a pass state or an error state based on the response. | 06-26-2014 |
| 20140181452 | HARDWARE COMMAND TRAINING FOR MEMORY USING READ COMMANDS - A method of training command signals for a memory module. The method includes programming a memory controller into a mode wherein a column access strobe is active for a single clock cycle. The method then programs a programmable delay line of the column access strobe with a delay value and performs initialization of the memory module. A read command is then sent to the memory module. A number of data strobe signals sent by the memory module in response to the read command are counted. A determination is made whether the memory module is in a pass state or an error state based on a result of the counting. | 06-26-2014 |
| 20140195761 | LOGICAL VOLUME SPACE SHARING - Space sharing between logical volumes is achieved through a technique that enables available storage space to be flexibly consumed and released by the logical volumes. Each logical volume is associated with an address tree that defines how available storage space is consumed by the logical volume. The technique involves receiving an input/output (I/O) operation that specifies a logical address within an address tree associated with the logical volume, parsing the address tree to identify an entry therein, if any, that is associated with the logical address, where the entry stores physical address information that is associated with the logical address. If it is determined that the entry exists, then one or more translated I/O operations are generated based on the physical address information and forwarded to a physical device manager to carry out the translated one or more I/O operations. | 07-10-2014 |
| 20140195762 | SAFETY FOR VOLUME OPERATIONS - A system and method for maintaining the safety of volume operations. A storage controller receives a request to delete a first volume. In response to this request, the storage controller can delete a link between the first volume and its anchor medium. The storage controller can also delay the deletion of the first volume's anchor medium. Later on, if the user wishes to restore the first volume, the storage controller can reconnect the first volume to its previous anchor medium, effectively restoring the first volume to its former state and undoing the deletion operation. | 07-10-2014 |
| 20140195763 | HARDWARE AND FILE SYSTEM AGNOSTIC MECHANISM FOR ACHIEVING CAPSULE SUPPORT - Methods and apparatus relating to a hardware and file system agnostic mechanism for achieving capsule support are described. In one embodiment, content associate with a capsule are stored in a non-volatile memory prior to a cold reset. A capsule descriptor may also be constructed, prior to the reset, which includes information about the physical location of the capsule content on the non-volatile memory. Other embodiments are also described and claimed. | 07-10-2014 |
| 20140289491 | DATA PROCESSING DEVICE - A data processing device has: a shift circuit that makes data with a certain bit length to be input therein for each cycle, and shifts the data to delete first invalid data in the data; and a gate circuit that cuts, when data as a result of combining pieces of the shifted data for each cycle has the certain bit length or more, first data with the certain bit length to output the data to an outside. | 09-25-2014 |
| 20140365743 | Secure Erasure of Processing Devices - Apparatus and method for performing secure erasure of a processing device, such as a data storage device in an object storage system. In accordance with some embodiments, an apparatus is provided with a plurality of processing devices arranged within an enclosed housing and each having an associated memory. A mechanical switch is coupled to the enclosed housing. The associated memories of the processing devices are securely erased responsive to activation of the mechanical switch. | 12-11-2014 |
| 20140380013 | EXECUTION OF A PERFORM FRAME MANAGEMENT FUNCTION INSTRUCTION - Optimizations are provided for frame management operations, including a clear operation and/or a set storage key operation, requested by pageable guests. The operations are performed, absent host intervention, on frames not resident in host memory. The operations may be specified in an instruction issued by the pageable guests. | 12-25-2014 |
| 20150067289 | METHOD AND APPARATUS FOR IMPLEMENTING GARBAGE COLLECTION WITHIN A COMPUTING ENVIRONMENT - An approach is provided for obtaining memory management information associated with a computing environment, processing the memory management information to determine one or more computing devices within the computing environment experiencing full garbage collection, and resetting memory of the one or more computing devices to correct the full garbage collection. | 03-05-2015 |
| 20150074368 | THIN PROVISIONING STORAGE DEVICES IN CONNECTION WITH SECURE DELETE OPERATIONS - A method for improving thin provisioning storage devices in connection with secure delete operations is provided. The method may include receiving at a physical storage device a first indicator to initiate writing a secure delete pattern to a plurality of physical storage locations. The secure delete pattern is written to a plurality of allocated physical storage locations based on the received first indicator. When a second indicator is set, the end of the secure delete pattern is reached. The thin provisioning storage device, upon receiving the second indicator, securely erases the plurality of storage device metadata regions where the mapping of virtual storage locations to allocated physical storage locations is stored. Requests to write a secure delete pattern for virtual storage locations without corresponding allocated physical storage locations are ignored. | 03-12-2015 |
| 20150095603 | METHOD AND DEVICE FOR CLEARING PROCESS IN ELECTRONIC DEVICE - A method and a device for clearing a process in an electronic device are provided. The method includes calculating an amount of memory allocated for a preset time period when a memory application is requested, predicting an amount of memory to be allocated for a future setting time period based on the amount of the memory, and selecting and clearing at least one of present processes based on the amount of the memory to be allocated. Accordingly, sufficient memory can be obtained in a short period of time by recalling a plurality of processes. In this way, the electronic device can continuously allocate an abundance of memory. | 04-02-2015 |
| 20150095604 | CONTROL DEVICE THAT SELECTIVELY REFRESHES MEMORY - A control device includes circuits configured to detect an access request for a memory area in memory that stores information by charging and discharging charge; determining whether any one among write_information written to the memory area that corresponds to the detected access request and read_information read from the memory area coincides with information stored in the memory area when charge is discharged; and performing control to suspend a refresh operation for the memory area when any one among the write_information and the read_information is determined to coincide with the information stored in the memory when the charge is discharged. | 04-02-2015 |
| 20150127919 | MANAGEMENT OF A SECURE DELETE OPERATION - Embodiments of the disclosure can include a method, system, and computer program product for using a secure delete operation within one or more storage devices using a parity-based storage scheme. The method can include receiving the location of an application block that includes one or more data blocks and one or more parity blocks stored within the one or more storage devices using the parity-based storage scheme. The method can also include determining a number of parity blocks to delete, wherein the number of parity blocks to delete is less than the total number of parity blocks. The method can also include performing a secure delete operation on the determined number of parity blocks. The method can also include performing a secure delete operation on the one or more data blocks. | 05-07-2015 |
| 20150143068 | DATA MANAGEMENT WITH MODULAR ERASE IN A DATA STORAGE SYSTEM - A system and method of data management with modular erase in a data storage system with a memory array having an erase block and a target block with the target block in a logical unit separate from the erase block including: performing an erase operation on the erase block, the erase operation having an operation matrix configured for partial erasing of the erase block; updating a command status for the erase block; enabling an intervening command on the target block based on the command status indicating an incomplete erase status with the intervening command updating the command status; performing an erase optimization based on the command status; performing an additional erase operation based on the erase optimization; and updating the command status to an erase complete status based on the additional erase operation. | 05-21-2015 |
| 20150149740 | DATA STORAGE DEVICE AND DATA PROCESSING SYSTEM INCLUDING THE SAME - A data processing system includes a data storage device including memory cells, which are erased to an erasure state and programmed to program states to store data, and a host device suitable for accessing the data, wherein the data storage device programs a first memory cell to a first state other than the erasure state to delete data of the first memory cell in response to a request of the host device. | 05-28-2015 |
| 20150309754 | System and Method for Erasing Data on an Electronic Device - A data erasing system and method for erasing the data on multiple electronic devices at a time, where the multiple electronic devices do not all have to be of the same type or connected at the same time, and where the electronic device's battery may be dead prior to erasure. | 10-29-2015 |
| 20150309938 | USING FREQUENCY TRIGGERING WITH PASSIVE COMPONENTS TO GENERATE RESET - A method for resetting a data storage drive in a drive system. The method may include transmitting a first signal at a first frequency to a GPIO connector pin corresponding to the data storage drive, utilizing a passive circuit to filter out the first signal, the filtered signal triggering a passive logic circuit to generate an output, and transmitting the output to a drive reset pin on a data storage drive so as to reset the data storage drive. In some cases, the first signal may be initiated from a location remote from the data storage drive. In additional or alternative embodiments, the method may include monitoring a parameter of the data storage drive, the data storage system, and/or a connection therebetween. The first signal may be initiated when a predetermined condition, based, at least in part, on the monitored parameter, is satisfied. | 10-29-2015 |
| 20150331610 | DATA DEVICE GROUPING ACROSS MULTIPLE-DATA-STORAGE-DEVICES ENCLOSURES FOR SYNCHRONIZED DATA MAINTENANCE - In at least one embodiment, a method of operating a storage front-end system is disclosed. The method includes: identifying a synchronous group of data storage devices across two or more multiple-data-storage-devices enclosures, wherein data across the data storage devices is accessible by a storage front-end system as an aggregate memory space; send an activation request to the two or more multiple-data-storage-devices enclosures to nearly immediately activate the data storage devices in the synchronous group; and perform a data maintenance task in the aggregate memory space of the data storage devices. | 11-19-2015 |
| 20150331612 | Memory Cleaning Method and Apparatus, and Terminal Device - A memory cleaning method and apparatus, and a terminal device are provided. The memory cleaning method includes: acquiring information about application processes that occupy memory of a terminal device; determining, according to behavior characteristic information of using an application by a user, that a first application process in the application processes is an application process for which cleaning is not performed; and performing memory cleaning processing on an application process, except the first application process, in the application processes, so that it may be implemented that memory cleaning is performed according to the behavior characteristic information of using an application by the user and operating performance of the terminal device is improved. Furthermore a response time required when the user starts the first application process again is reduced, and an experience effect of using the terminal device by the user is ensured. | 11-19-2015 |
| 20150338893 | METHOD AND APPARATUS FOR ERASING MEMORY DATA - A memory erasing method and apparatus for erasing important data of a nonvolatile memory within the apparatus to prevent illegal access using attitude information measured in an inertial measurement sensor and a low power microprocessor regardless of the power supply state of the apparatus. The apparatus includes a power switching circuit unit for selecting one from among an external power source and a battery. An inertial measurement sensor measures attitude information of the memory erasing apparatus, using power supplied from the external power source or the battery. A low power microprocessor erases important data from a memory device in a first manner using power from the external power source, and in a second manner using power from the battery, the first manner being different from the second manner. | 11-26-2015 |
| 20150339077 | LOGICAL VOLUME SPACE SHARING - Space sharing between logical volumes is achieved through a technique that enables available storage space to be flexibly consumed and released by the logical volumes. Each logical volume is associated with an address tree that defines how available storage space is consumed by the logical volume. The technique involves receiving an input/output (I/O) operation that specifies a logical address within an address tree associated with the logical volume, parsing the address tree to identify an entry therein, if any, that is associated with the logical address, where the entry stores physical address information that is associated with the logical address. If it is determined that the entry exists, then one or more translated I/O operations are generated based on the physical address information and forwarded to a physical device manager to carry out the translated one or more I/O operations. | 11-26-2015 |
| 20150363114 | OPTIMIZING MEMORY USAGE ACROSS MULTIPLE GARBAGE COLLECTED COMPUTER ENVIRONMENTS - A method, information processing system, and computer readable storage medium, vary a maximum heap memory size for one application of a plurality of applications based on monitoring garbage collection activity levels for the plurality of applications, each application including a heap memory, and unused memory in the heap memory being reclaimed by a garbage collector. | 12-17-2015 |
| 20160011789 | STORAGE CONTROL APPARATUS AND CONTROL METHOD OF STORAGE CONTROL APPARATUS | 01-14-2016 |
| 20160011802 | System and Method for Enabling Transportability of a Non Volatile Dual Inline Memory Module | 01-14-2016 |
| 20160011806 | PROTECTION AND RECOVERY FROM SUDDEN POWER FAILURE IN NON-VOLATILE MEMORY DEVICES | 01-14-2016 |
| 20160019143 | GARBAGE COLLECTION FOR SELECTING REGION TO RECLAIM ON BASIS OF UPDATE TO REFERENCE SOURCE INFORMATION - In a GC processing in which a memory area is managed by being divided, collection efficiency of an area is further optimized. In order to realize the technology, a calculator including an arithmetic unit and a memory includes a storage unit which stores reference source information of data which is stored in a plurality of storage areas which are allocated to the memory in each of the storage areas; and a control unit which determines a storage area in which updated reference source information is different from reference source information which is recorded in the storage unit to be an area as a release target. | 01-21-2016 |
| 20160041768 | STATUS INDICATOR ON A DATA STORAGE DEVICE - Methods, systems, and devices are described for displaying information on a visual display of a data storage device. The device may be an internal data storage device and may display information associated with various operation parameters or states of the data storage device. The data storage device may display, on the visual display, an indication that a data storage medium of the data storage device has been securely erased. The data storage medium may be securely erased by erasing an encryption key used to encrypt data stored on the data storage medium. The visual display may be electronic paper, mechanical, or chemical such that the information is displayed without power being applied to the data storage device. | 02-11-2016 |
| 20160062700 | SYSTEM, METHOD FOR CLEANING MEMORY SPACE AND TERMINAL DEVICE WITH MEMORY SPACE CLEANING FUNCTION - A method for cleaning memory space includes marking an application of a terminal device when that application is launched in response to a launching operation, loading each marked application to an application resource pool of the terminal device, counting a total number of marked times of each application in the application resource pool, determining if the total number of marked times of each application in the application resource pool is greater than or equal to a predetermined number of times, determining the applications, which have a total number of marked times greater than or equal to the predetermined number of times, in the application resource pool, as non-removable applications and determining other applications of the terminal device as removable applications, and cleaning the memory space occupied by the removable applications when available memory space of the terminal device is not enough. | 03-03-2016 |
| 20160085474 | DATA DEDUPLICATION - The present disclosure includes devices and methods for data deduplication. One such method includes receiving a write command, transforming data associated with the write command, determining if a transformation value of the data exists in a transformation table, and responsive to a determination that the transformation value does not exist in the transformation table, writing the data associated with the write command to a memory device. | 03-24-2016 |
| 20160098229 | AUTOMATIC ANALYSIS OF ISSUES CONCERNING AUTOMATIC MEMORY MANAGEMENT - Systems and methods are provided to automatically analyze performance of an automatic memory management system. One example embodiment involves automatically gathering, using at least one processor of the server, garbage collection information associated with the garbage collection process and storing the garbage collection information in a garbage collection output file of a file system. The garbage collection output file may be analyzed to identify a plurality of flags associated with a performance of the server system that does not meet one or more performance thresholds. In certain embodiments, a first flag of the plurality of flags is associated with a first portion of the garbage collection information, and a second flag of the plurality of flags is associated with a second portion of the garbage collection information that is different from the first portion of the garbage collection information. | 04-07-2016 |
| 20160110282 | OVERLAID ERASE BLOCK MAPPING - An overlaid erase block (EB) mapping scheme for a flash memory provides efficient wear-leveling and reduces mount operation latency. The overlaid EB mapping scheme maps a first type of EB onto one of a plurality of physical erase blocks, in a corresponding portion of the flash memory. The first type of EB includes a plurality of pointers. The overlaid EB mapping scheme also maps each of second and third types of EBs onto one of the physical EBs that is not mapped to the first type of EB. The second type of EBs store system management information and the third type of EBs store user data. When the flash memory is started up, the overlaid EB mapping scheme scans the corresponding portion to locate the first type of EB, locates the system EBs using the pointers, and locates the data EBs using the system management information. | 04-21-2016 |
| 20160117114 | GARBAGE COLLECTION AND OTHER MANAGEMENT OF MEMORY HEAPS - A memory heap management facility is provided that is able to perform various management tasks, including, but not limited to, garbage collection, compaction, and/or re-ordering of objects within a heap. One or more of these management tasks improve system performance by limiting movement of pages in and out of virtual memory. The garbage collection technique selectively performs garbage collection such that certain objects, such as old but live, infrequently referenced objects, are not garbage collected each time garbage collection is performed. | 04-28-2016 |
| 20160117117 | GARBAGE COLLECTION AND OTHER MANAGEMENT OF MEMORY HEAPS - A memory heap management facility is provided that is able to perform various management tasks, including, but not limited to, garbage collection, compaction, and/or re-ordering of objects within a heap. One or more of these management tasks improve system performance by limiting movement of pages in and out of virtual memory. The garbage collection technique selectively performs garbage collection such that certain objects, such as old but live, infrequently referenced objects, are not garbage collected each time garbage collection is performed. | 04-28-2016 |
| 20160124747 | PERFORMING A CLEAR OPERATION ABSENT HOST INTERVENTION - Optimizations are provided for frame management operations, including a clear operation and/or a set storage key operation, requested by pageable guests. The operations are performed, absent host intervention, on frames not resident in host memory. The operations may be specified in an instruction issued by the pageable guests. | 05-05-2016 |
| 20160140036 | SYNCHRONIZATION AND BARRIER FREE CONCURRENT GARBAGE COLLECTION SYSTEM - A system, method and program product for implementing a garbage collection (GC) process that manages dynamically allocated memory in a multithreaded runtime environment. A method is disclosed that includes defining a threshold value, wherein the threshold value defines a number of GC cycles an object must be observed as unreferenced before being reclaimed; traversing objects in an object graph; and reclaiming a traversed object from the dynamically allocated memory if the traversed object has been observed as unreferenced for more than the threshold value. | 05-19-2016 |
| 20160170873 | INFORMATION PROCESSING DEVICE | 06-16-2016 |
| 20160196071 | MANAGEMENT OF A SECURE DELETE OPERATION | 07-07-2016 |
| 20160253257 | DATA PROCESSING SYSTEM AND OPERATING METHOD THEREOF | 09-01-2016 |
| 20160253529 | Selective Storage Device Wiping System and Method | 09-01-2016 |
| 20160378354 | SUBSYSTEM STORAGE SPACE MANAGER - The embodiments set forth techniques for managing storage space in user devices. A storage space manager can be configured to receive a request to increase an available amount of storage space within the user device, identify applications where at least a portion of the application's associated data can be deleted to increase the available storage space, determining particular applications whose identified associated data should be deleted, and causing the associated data to be deleted. According to some embodiments, applications managed by the storage space manager are not adapted to manage storage space themselves. Instead, these applications can be registered to the storage space manager and can be grouped into subsets that share sections of storage space within the user device. Moreover, the storage space manager can be a subsystem storage space manager that interfaces with a higher-level system storage manager that orchestrates storage space management within the user device. | 12-29-2016 |
| 20160378388 | AFFINITY-AWARE PARALLEL ZEROING OF MEMORY FOR INITIALIZATION OF LARGE PAGES IN NON-UNIFORM MEMORY ACCESS (NUMA) SERVERS - Embodiments disclosed herein generally relate to techniques for zeroing memory in computing systems where access to memory is non-uniform. Embodiments include a system having a processor and a memory storing a program; and other embodiments include a computer readable medium containing a program. When executed on a processor, the program causes the processor to perform an operation that includes receiving, via a system call, a request for a pool of memory. The operation also includes determining a size of the requested pool of memory, and creating a dummy memory segment. The size of the dummy memory segment is larger than the size of the requested pool of memory. The operation further includes filling the dummy memory segment with one or more pages, based on the determined size of the requested pool of memory, and deleting the dummy memory segment. | 12-29-2016 |
| 20160378397 | AFFINITY-AWARE PARALLEL ZEROING OF PAGES IN NON-UNIFORM MEMORY ACCESS (NUMA) SERVERS - Embodiments disclosed herein generally relate to techniques for zeroing memory in computing systems where access to memory is non-uniform. One embodiment provides a processor which performs an operation including receiving, via a system call, a request to delete a memory region. The operation also includes sorting, after receiving the request, one or more pages of the memory region according to each of the one or more pages associated affinity domain. The operation further includes sending requests to zero the sorted one or more pages to one or more zeroing threads that are attached to the respective affinity domain. The operation further yet includes waiting, after sending the requests, to return to the system caller until a message is received, from the worker threads in each affinity domain, indicating that all the page zeroing requests have been processed. | 12-29-2016 |
| 20160378398 | OFF-LINE AFFINITY-AWARE PARALLEL ZEROING OF MEMORY IN NON-UNIFORM MEMORY ACCESS (NUMA) SERVERS - Embodiments disclosed herein generally relate to techniques for zeroing memory in computing systems where access to memory is non-uniform. One embodiment provides a method which includes receiving, via a system call, a request to delete a memory region. The method also includes forwarding the request to an intermediate software thread, and using the intermediate software thread to perform the request as a background process. The method further includes, upon receiving a message from the intermediate software thread, returning to a system caller, while performing the request, via the intermediate software thread, continues in the background. | 12-29-2016 |
| 20160378399 | AFFINITY-AWARE PARALLEL ZEROING OF MEMORY IN NON-UNIFORM MEMORY ACCESS (NUMA) SERVERS - Embodiments disclosed herein generally relate to techniques for zeroing memory in computing systems where access to memory is non-uniform. One embodiment provides a method which includes receiving, via a system call, a request to delete a memory region. The method also includes sorting, after receiving the request, one or more pages of the memory region according to each of the one or more pages associated affinity domain. The method further includes sending requests to zero the sorted one or more pages to one or more zeroing threads that are attached to the respective affinity domain. The method further yet includes waiting, after sending the requests, to return to the system caller until a message is received, from the worker threads in each affinity domain, indicating that all the page zeroing requests have been processed. | 12-29-2016 |
| 20170235518 | FEEDBACK-BASED SELECTION OF REGIONS FOR ABORTABLE GARBAGE COLLECTION | 08-17-2017 |
