Inventors list

Assignees list

Classification tree browser

Top 100 Inventors

Top 100 Assignees


Resetting

Subclass of:

711 - Electrical computers and digital processing systems: memory

711100000 - STORAGE ACCESSING AND CONTROL

711154000 - Control technique

Patent class list (only not empty are listed)

Deeper subclasses:

Entries
DocumentTitleDate
20090204779CONTROLLING EMBEDDED MEMORY ACCESS - A microcontroller (08-13-2009
20100023721MEMORY 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
20090193216Method 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
20090193215ERASING 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
20090193214DYNAMIC 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
20110197045MEMORY 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
20130031325System 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
20120246433TECHNIQUES 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
20100077171DATA 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
20090119468SYSTEMS, 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
20100106932CONTROL 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
20120216006INFORMATION 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
20090327638Securely 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
20120191935ITERATIVELY 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
20090300311SELECTIVE 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
20090240908FILTERING 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
20110302384COMPUTER 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
20110296132GARBAGE 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
20110191563ON 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
20090259820OPERATION 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
20100070729SYSTEM 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
20100122058Memory 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
20100125714DELETE 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
20100088482Process 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
20100082930GPU 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
20100082932HARDWARE 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
20100082931INTELLIGENT 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
20090287896OFF-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
20080209150NON-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
20090113157INITIALIZING 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
20090282206Method 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
20100299494MEMORY 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
20090300313MEMORY 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
20090265523Method 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
20080313418SEMICONDUCTOR 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
20090300312INSTANT 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
20090049265STALE 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 R02-19-2009
20090222635System 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
20090222636MEMORY 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
20100262802Reclamation 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
20100191928AUTOMATIC 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
20100235601METHOD 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
20100217947DISCONTIGUOUS 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
20100146236SYSTEM, 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
20100235600System 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
20100223442Computer 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
20120144145APPARATUS 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
20110078403METHOD 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
20090216984OPTIMIZATIONS 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
20110082995INFORMATION 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
20120303920HARD 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
20110179244STORAGE 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
20110119462METHOD 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
20120151170SYSTEM 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
20110138144COMPUTER 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
20120311288SECURE 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
20110078402MEMORY 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
20110093677System 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
20110119461FILE 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
20120151169STORAGE 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
20120210088MANAGEMENT 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
20090119469Procedure 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
20120023303STORAGE 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
20110093678ONBOARD SYSTEM - A control unit (main CPU 04-21-2011
20120124316LEAKAGE 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
20120317386CLEARING 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
20120166750SYSTEM 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
20110185144Low-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
20110185143RESET 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
20120173835SELECTIVE 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
20100274986CONTROL 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
20100030992INITIALIZING 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
20120084530Data 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
20080301390System 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
20110004738DATA 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
20120278582MAGNETIC 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
20120278581METHOD 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
20120278579Self-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
20120290809System 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
20100199056FRACTURED 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
20110161615MEMORY 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
20110161614Pre-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
20080235479Initializing 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
20080209149Processor 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
20130103916CLEARING 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
20130124813METHODS 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
20130145116COMPACTING 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
20080201544STORAGE 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
20120278580DATA 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
20130124812FACILITATION 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
20120284477EXECUTION 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
20120005444MICROCODE 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
20120030444STORAGE 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

Patent applications in class Resetting