Inventors list

Assignees list

Classification tree browser

Top 100 Inventors

Top 100 Assignees


Entry replacement strategy

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:

Class / Patent application numberDescriptionNumber of patent applications / Date published
711160000 Least recently used (LRU) 24
Entries
DocumentTitleDate
20130036277STORAGE SYSTEM - The storage system includes a first auxiliary storage device, a second auxiliary storage device, and a main storage device, and also includes a data management unit which stores and keeps, in the main storage device, index data based on feature data by referring to the feature data of storage target data stored in the first auxiliary storage device, and if the index data stored and kept in the main storage device reaches a preset amount, stores and keeps, in the second auxiliary storage device, the index data stored and kept in the main storage device, and deletes the index data stored and kept in the second auxiliary storage device from the main storage device.02-07-2013
20130036276INSTRUCTIONS TO SET AND READ MEMORY VERSION INFORMATION - Systems and methods for providing additional instructions for supporting efficient memory corruption detection in a processor. A physical memory may be a DRAM with a spare bank of memory reserved for a hardware failover mechanism. Version numbers associated with data structures allocated in the memory may be generated so that version numbers of adjacent data structures are different. A processor determines that a fetched instruction is a memory access instruction corresponding to a first data structure within the memory. For instructions that are not a version update instruction, the processor compares the first version number and second version number stored in a location in the memory indicated by the generated address and flags an error if there is a mismatch. For version update instructions, the processor performs a memory access operation on the second version number with no comparison check.02-07-2013
20130061012VIRTUAL MACHINE CODE INJECTION - A memory has a page to store code executable by a processor. A management component is to inject the code into a virtual machine. The management component is to indicate within a memory table for the virtual machine that the page of the memory has an injected code type.03-07-2013
20090271579Storage subsystem and storage system - Provided is a storage subsystem that can reflect, when merging storage update information and local update information, those two kinds of update information in relevant volumes without overlapping the storage update information and the local update information. When reflecting update information in a storage subsystem 10-29-2009
20090031095PURGE OPERATIONS FOR SOLID-STATE STORAGE DEVICES - A storage system that comprises multiple solid-state storage devices includes a command set that enables a host system to initiate one or more types of purge operations. The supported purge operations may include an erase operation in which the storage devices are erased, a sanitization operation in which a pattern is written to the storage devices, and/or a destroy operation in which the storage devices are physically damaged via application of a high voltage. The command set preferably enables the host system to specify how many of the storage devices are to be purged at a time during a purge operation. The host system can thereby control the amount of time, and the current level, needed to complete the purge operation. In some embodiments, the number of storage devices that are purged at a time may additionally or alternatively be selectable by a controller of the storage system.01-29-2009
20130067179NONVOLATILE MEDIA DIRTY REGION TRACKING - A storage set (e.g., an array of hard disk drives) may experience a failure, such as a loss of power, a software crash, or a disconnection of a storage device, while writes to the storage set are in progress. Recover from the failure may involve scanning the storage set to detect and correct inconsistencies (e.g., comparing mirrors of a data set or testing checksums). However, lacking information about the locations of pending writes to the storage set during the failure, this “cleaning” process may involve scanning the entire storage set, resulting in protracted recovery processes. Presented herein are techniques for tracking writes to the storage set by apportioning the storage set into regions of a region size (e.g., one gigabyte), and storing on the nonvolatile storage medium descriptors of “dirty” regions comprising in-progress writes. The post-failure recovery process may then be limited to the regions identified as dirty.03-14-2013
20120117341METHOD AND SYSTEM FOR TRANSFORMATION OF LOGICAL DATA OBJECTS FOR STORAGE - There are provided a method of transforming a non-transformed stored logical data object (LO) device into a transformed LO and system thereof. The method comprises: a) in response to a respective transformation request, logically dividing the non-transformed LO in a first segment and one or more non-transformed subsequent segments, the segments having predefined size; b) generating a header for the respective transformed LO; c) processing said first segment; d) overwriting said first segment by said generated header and said transformed first segment; e) indexing said first transformed segment and said one or more non-transformed subsequent segments as constituting a part of said transformed LO; f) generating at least one index section; and g) updating the indication in the header to point that the non-transformed LO has been transformed in the transformed LO comprising said generated header, said first transformed segment, said one or more subsequent segments comprising data in non-transformed form and said at least one index section.05-10-2012
20120117340DATA ADMINISTRATION UNIT, DATA ACCESS UNIT, NETWORK ELEMENT, NETWORK, AND METHOD FOR UPDATING A DATA STRUCTURE - A data administration unit for updating a first data structure in a first memory may comprise a second memory, a data structure generator for setting up a second data structure in the second memory, a pointer generator for setting at least one of a dynamic change indicator and a pointer in the first data structure, a waiting unit for waiting for a finalization of a data access of a data access unit, and a data structure over-writer for overwriting the first data structure using data of the second data structure. An data access unit for accessing a first data structure in a first memory may comprise a data access driver, a first synchronization signal evaluator for reception and evaluation of a first synchronization signal, and a synchronization approval signal generator for generation and submission of a first synchronization signal.05-10-2012
20120290800METHOD AND APPARATUS TO REDUCE MEMORY READ LATENCY - A method and apparatus for training read latency of a memory are disclosed. A memory controller includes a command FIFO configured to convey commands to a memory, a data queue coupled to receive data from the memory, and a register configured to provide a value indicative of a number of cycles of a first clock signal after which data is valid. During a startup routine, the memory controller is configured to compare data received by the data queue to a known data pattern after a specified number of cycles of the first clock signal have elapsed. The memory controller is further to configured to decrement the first value and repeat conveying and comparing if the data received matches the data pattern. If the received data does not match the data pattern for any attempted read of the memory, the memory controller is configured to program a second value into the register.11-15-2012
20110302380METHOD OF STORING LOGICAL DATA OBJECTS AND SYSTEM THEREOF - Various embodiments for storing a logical object are provided. In one such embodiment, by way of example only, incoming data is divided corresponding to a logical data object into a plurality of independent streams, associating each data chunk of a plurality of obtained data chunks with a corresponding stream among the plurality of independent streams. At least one of the obtained data chunks and derivatives thereof is sequentially accommodated in accordance with an order the obtained chunks are received, while keeping the association with the corresponding streams. A global index is generated as a single meta-data stream accommodated in the logical data object and comprising information common to the plurality of independent streams and related to mapping between data in the logical data object and the obtained data chunks.12-08-2011
20110289288USING TYPE STABILITY TO FACILITATE CONTENTION MANAGEMENT - Various technologies and techniques are disclosed for providing type stability techniques to enhance contention management. A reference counting mechanism is provided that enables transactions to safely examine states of other transactions. Contention management is facilitated using the reference counting mechanism. When a conflict is detected between two transactions, owning transaction information is obtained. A reference count of the owning transaction is incremented. The system ensures that the correct transaction was incremented. If the owning transaction is still a conflicting transaction, then a contention management decision is made to determine proper resolution. When the decision is made, the reference count on the owning transaction is decremented by the conflicting transaction. When each transaction completes, the reference counts it holds to itself is decremented. Data structures cannot be deallocated until their reference count is zero. Dedicated type-stable allocation pools can be reduced using an unstable attribute.11-24-2011
20130219135DYNAMIC TIME REVERSAL OF A TREE OF IMAGES OF A VIRTUAL HARD DISK - A technique manages a virtual hard disk tree in a computing system executing a hypervisor to provide a client virtualization environment. The technique involves linking, by a client executing within a control virtual machine of the client virtualization environment, a first delta image of a virtual hard disk generated later in time to a base image of the virtual hard disk. The technique further involves modifying contents of the first delta image, the base image, and a second delta image which is linked to the base image; and deleting the second delta image after modifying the contents of the first delta image, the base image, and the second delta image. The base image and the first delta image, together with additional delta images of the virtual hard disk comprise a tree of images of the virtual hard disk.08-22-2013
20080282045Garbage collection in storage devices based on flash memories - A solution for managing a storage device based on a flash memory is proposed. A corresponding method starts with the step for mapping a logical memory space of the storage device (including a plurality of logical blocks) on a physical memory space of the flash memory (including a plurality of physical blocks, which are adapted to be erased individually). The physical blocks include a set of first physical blocks (corresponding to the logical blocks) and a set of second—or spare—physical blocks (for replacing each bad physical block that is unusable). The method continues by detecting each bad physical block. Each bad physical block is then discarded, so to prevent using the bad physical block for mapping the logical memory space.11-13-2008
20100125710DEVICE AND METHOD FOR REWRITING MAIN MEMORY DATA - A main memory data rewriting device includes a rewrite condition analysis unit configured to analyze a rewrite condition for target data in main memory data stored in a main memory before deactivation of an information processing device, and create a first processing content to acquire environment data substituting the target data from outside of the information processing device and a second processing content to rewrite the target data to the environment data, an environment data processing unit configured to acquire the environment data according to the first processing content when the information processing device is temporarily activated at an activation time set to rewrite the target data during a deactivating period of the information processing device, and a rewrite processing unit configured to rewrite a region of a nonvolatile storage medium in which the target data is stored with the environment data according to the second processing content.05-20-2010
20090287893METHOD FOR MANAGING MEMORY - A method is employed to manage a memory, e.g., a flash memory, including a plurality of paired pages. Each paired page includes a page and a respective risk zone. For each write command, at least one unwritten page is selected for writing new data. For each unwritten page whose risk zone includes at least one written page, each written page is copied or backed up, and the new data is written to the unwritten page. For each unwritten page whose risk zone lacks a written page, the new data is written to the unwritten page. In an embodiment, the written page is copied only if the unwritten page and the written page are operated by different write commands.11-19-2009
20080215833INFORMATION STORAGE DEVICE AND STORED DATA PROCESSING METHOD - An information storage device includes one or more semiconductor memories storing management data accompanying content data and being configured to erase data in units of one block, and a controller setting up, in the one or more semiconductor memories, a working area to temporarily store the management data and a storage area to retain all or part of the management data stored in the working area, writing the management data to the working area while monitoring the free space of the working area, moving the management data stored in the working area to the storage area when the free space of the working area falls below a prescribed value, and erasing the management data stored in the working area after the movement of the management data to the storage area.09-04-2008
20080276057DATA STORAGE ARRAY SCALING METHOD AND SYSTEM WITH MINIMAL DATA MOVEMENT - A method for rearranging data blocks in a data storage system when adding new storage devices to create an expanded data storage system. A temporary configuration is selected for which the exchange of one or more data blocks between the temporary configuration and the source configuration produces the destination configuration before identifying and exchanging data blocks between the temporary configuration and the source configuration to produce the destination configuration. A single data element transfer chain embodiment provides superior performance in an embodiment that maintains (does not reduce) the source array data storage efficiency at the destination array after scaling. When adding a single new device to an existing array, the required data movement is minimized and does not exceed the capacity of the new device.11-06-2008
20080276056Efficient Point-To-Point Enqueue And Dequeue Communications - Systems and methods for writing and/or reading data to a point-to-point shared memory communication mechanism are provided according to embodiments disclosed herein. According to one embodiment, a determination may be made whether a first memory location in the cache of a general purpose multi-core processor includes an empty symbol. If the first memory location includes the empty symbol, then data may be placed in the first memory location in the cache. If the first memory location does not include the empty symbol, then waiting until it does. In another embodiment, a determination may be made whether a first memory location of a general purpose multi-core processor includes the empty symbol. If it does not, then data may be read from the first memory location and/or the empty symbol may be written into the first memory location. If the first memory location does include the empty symbol, then pausing.11-06-2008
20080263295Methods, apparatus, and program products for improved finalization - Apparatus, methods, and computer program products are disclosed that improve management of a dynamic memory area. One aspect is a method that reclaims memory referenced by a finalizable-object that has been instantiated from a class definition that incorporates at least one parent class and one or more class-extensions into a class hierarchy. The method includes marking for retention a related memory reachable from a reference field of the finalizable-object, and adding the finalizable-object to a finalization set for subsequent invocation of a non-trivial finalize-method. The method also determines whether the portion of the finalizable-object that includes the reference field to the related memory is a class-extension that has a finalizer-free characteristic and conditions the marking for retention on that determination. Thus, a portion the finalizable-object's related memory can be more quickly reclaimed from a dynamic memory area.10-23-2008
20080288730Transactional Memory System Which Employs Thread Assists Using Address History Tables - A computing system uses specialized “Set Associative Transaction Tables” and additional “Summary Transaction Tables” to speed the processing of common transactional memory conflict cases and those which employ assist threads using an Address History Table and processes memory transactions with a Transaction Table in memory for parallel processing of multiple threads of execution by support of which an application need not be aware. Special instructions may mark the boundaries of a transaction and identify memory locations applicable to a transaction. A ‘private to transaction’ (PTRAN) tag, directly addressable as part of the main data storage memory location, enables a quick detection of potential conflicts with other transactions that are concurrently executing on another thread of said computing system. The tag indicates whether (or not) a data entry in memory is part of a speculative memory state of an uncommitted transaction that is currently active in the system.11-20-2008
20080313412Data control apparatus, data control method, and data control program - A data control apparatus is connected to a central processing unit that processes data and to a main storage unit that stores therein the data, and controls output of the data. The data control apparatus includes a data storage unit that stores therein data output from the central processing unit to the main storage unit and data output from the central processing unit to other central processing unit, an information addition unit that adds information indicating an output enabled state to the data when the data stored in the data storage unit is in the output enabled state, and a data output unit that outputs the data with the information added thereto by the information addition unit from oldest stored data in order of storage in the data storage unit.12-18-2008
20080235469Peak Data Retention of Signal Data In An Implantable Medical Device - Methods and apparatus for storing data records associated with an extreme value are disclosed. Signal data is stored in a first buffer of a set of buffers. If a local extreme value for the first buffer exceeds a global extreme value, signal data is stored in a second buffer of the set of buffers. This process is repeated, wrapping around and overwriting buffers until the signal data in a current buffer does not have a local extreme value that exceeds the global extreme value. When this happens, signal data may be stored in a subsequent buffer and if a local extreme value of the subsequent buffer does not exceed the global extreme value, further signal data may be stored in the subsequent buffer in a circular manner until either an instantaneous extreme value exceeds the global extreme value or the recording period ends. In an embodiment, the extreme value may be a peak value.09-25-2008
20110208927VIRTUAL MEMORY - This document describes techniques and apparatuses enabling virtual memory for network-enabled computing devices. These techniques and apparatuses may enable network-enabled computing devices to avoid, or reduce the chances of, having little or no available memory.08-25-2011
20090144513DATABASE UPDATE METHOD - According to some embodiments a system and a method are provided to storing a plurality of data, the data comprising a plurality of original data elements and corresponding modified data elements. The plurality of original data elements may be automatically compared against editable field data in one or more editable fields that are displayed on a display screen by an application program. A determination may be made if the editable field data will be replaced and the editable field data may be replaced with the corresponding modified data elements if a determination is made to replace the editable field data.06-04-2009
20090024810Memory area management method - In a storage device, a method is provided for preventing the risk of data loss and a significant decrease of writing speed due to area shrinkage when erased erase blocks have become fewer. A process of allocating a new page includes determining whether the length of a deallocated pages list is longer than n pages. If the list length is longer, one page is allocated from the deallocated pages list. If the list length is shorter, a capacity shortage error returns. Deleting a file using an erased pages list includes determining whether a page to be processed is emptied by deleting the file. If not so, the file is deleted from the page. If so, the contents of the last page-a in occupied pages are copied to the page, the page-a is written with data for erasure, and any erase block included in the page-a is made erasable.01-22-2009
20080263294Method for Determining Allocation of Tape Drive Resources for a Secure Data Erase Process - A method and computer program product are provided to ensure a timely secure data erase by determining whether allocating an additional tape drive would improve secure data erase performance by evaluating a quantity of physical volumes to be secure data erased, a maximum queued threshold, an average time to an erasure deadline and a minimum expiration threshold. An additional tape drive is allocated for the secure data erase process when it is determined that allocating an additional tape drive would improve secure data erase performance.10-23-2008
20080263293Method for Selectively Performing a Secure Data Erase to Ensure Timely Erasure - A method and computer program product are provided to ensure a timely secure data erase by determining an erasure deadline for each physical volume of a plurality of physical volumes and calculating a remaining time for each physical volume. The remaining time is calculated for each physical volume by comparing a current date to the erasure deadline of each physical volume respectively. The physical volumes may then be sorted based on the remaining time and the physical volume with a shortest calculated remaining time will be selectively secure data erased.10-23-2008
20110231623Garbage Collection Management in a Data Storage Device - Method and apparatus for handling data in a data storage device. In accordance with some embodiments, a memory space with a plurality of garbage collection units (GCUs) that are each arranged into pages of memory that store user data identified by logical addresses (LAs) and each GCU has a metadata region that stores metadata that correlates the LAs with physical addresses (PAs). A header region in each page of memory stores a bitmask and a sequence map of the LAs in each page that are used by a log manager to creates a bitmask table stored in a first cache and a hierarchical log stored in a second cache. The bitmask table and hierarchical log are used to determine when the LAs stored in the selected GCU are stale, and update the bitmask for each page in the selected GCU after the stale data has been erased.09-22-2011
20090249000Method and system for error correction of a storage media - A data file on a storage media is processed during playback or execution to identify unreadable data. Replacement data corresponding to the unreadable data is obtained over a communications network, and the replacement data is used to playback or execute the data file as if the data file does not contain any unreadable data.10-01-2009
20090259815METHOD AND SYSTEM FOR DETERMINING MULTIPLE UNUSED REGISTERS IN A PROCESSOR - An improved method, device and system are presented for selecting a predetermined number of unused registers in a processor. The method includes partitioning registers in a processor into subsets; searching each subset for an unused register; determining whether every subset includes an unused register; if so, selecting an unused register from each subset; if not, partitioning the registers into new subsets with each subset having a different combination of registers; searching each of the new subsets for an unused register; determining whether each of the new subsets includes an unused register; if so, selecting an unused register from each new subset; and if not, searching each register serially to find the predetermined number of unused registers.10-15-2009
20100180090Garbage collection barrier with direct user mode traps - A computer system includes a processor; and a memory coupled to the processor, configured to provide the processor with a plurality of instructions including a set of garbage collection instructions configured to perform one or more garbage collection barrier operations and a subsequent instruction that immediately follows the garbage collection instruction; wherein the processor is configured to execute the set of garbage collection instructions, including by: evaluating a memory reference to determine a condition associated with the set of garbage collection instructions; and in the event that the condition is met, while maintaining the same privilege level, saving information that is based at least in part on the current value of a program counter, and setting the program counter to correspond to a target location that is other than the location of the subsequent instruction.07-15-2010
20100180091DISCARDABLE FILES - The present application includes methods and system for managing a storage device. In one implementation, a storage allocator that is present in a host or a storage device receives a request to store a file in a storage area of the storage device. The storage allocator marks the file as discardable in a file system structure associated with the storage device and updates a primary file allocation table (“FAT”) to associate a cluster chain that is allocated to the file with the file. The storage allocator additionally updates a discardable FAT or a database to reflect a physical location of the file, or may generate one or more location files that store the physical location of the file. The storage allocator then manages the storage area device based on the FAT and a discardable FAT, database, or one more location files indicating the physical location of the file.07-15-2010
20090172319SYSTEMS AND METHODS FOR RECOVERING ELECTRONIC INFORMATION FROM A STORAGE MEDIUM - In one embodiment of the invention, a method is provided for retrieving certain electronic information previously stored on certain storage media after a threshold set in the storage retention criteria has been exceeded in an electronic information storage system that stores electronic information on storage media in accordance with a storage retention criteria is provided. The method includes storing a record in a memory associated with a system manager that assigns the storage retention criteria to the certain electronic data, designating the storage media available for overwrite after the threshold set in the storage retention policy has been exceeded, identifying the certain storage media available for overwrite, and retrieving information from the certain media after the threshold set in the storage retention policy has been exceeded.07-02-2009
20090319733System and Method for Aggregating Transmit Completion Interrupts - Systems and methods for aggregating transmit completion interrupts for multiple packets are provided. A network device can include a buffer with multiple memory locations capable of temporarily storing a packet being transmitted across the network via the network device and nodes connected to the network device. The network device can include a high watermark for determining when to process transmit completion interrupts. If the number of packets stored in the memory exceeds the high watermark, an aggregated transmit completion interrupt for all of the packets can be processed. Otherwise, the network device waits until sufficient packets are received to reach the high watermark.12-24-2009
20120198186MEMORY DEVICE AND MEMORY SYSTEM - A memory device includes a plurality of nonvolatile memories configured to be erased at updating of data, and a memory controller configured to control the nonvolatile memory. The memory controller includes an address conversion table configured to convert a logical address specified by at data writing into a physical address of the nonvolatile memory, an erased physical block managing unit configured to manage an erased physical block address, the nonvolatile memory of the erased physical block address, and an erased physical block count on each nonvolatile memory, an erasable physical block managing unit configured to manage an erasable physical block address, the nonvolatile memory of the erasable physical block address, and an erasable physical block count on each nonvolatile memory, and a memory control unit configured to control writing and erasing on the plurality of nonvolatile memories.08-02-2012
20080282046Part information restoration method, part information management method and electronic apparatus - A part information restoration method is adapted to an electronic apparatus having first and second parts which are replaceable and are provided with a nonvolatile memory for storing part information unique to the part. The method includes storing, in a first nonvolatile memory of the first part, part information of the first part, and saving part information of the second part as a first reference information at least when replacing the second part, storing, in a second nonvolatile memory of the second part, the part information of the second part, and saving the part information of the first part as second reference information at least when replacing the first part. The method restores the first reference information in the second nonvolatile memory or restores the second reference information in the first nonvolatile memory, after replacing the first or second part.11-13-2008
20100223437METHOD AND SYSTEM FOR SPILLING FROM A QUEUE TO A PERSISTENT STORE - Techniques for managing memory usage of a processing system by spilling data from a memory to a persistent store based upon an evict policy are provided. A triggering event is detected. In response to the triggering event and based on the evict policy, it is determined whether data from the memory of the processing system is to be spilled to the persistent storage. The determination is made by comparing a level of free memory of the processing system with a threshold specified by the evict policy. The data is evicted from the memory.09-02-2010
20110040942SYNCHRONIZATION OF REPLICATED SEQUENTIAL ACCESS STORAGE COMPONENTS - Various embodiments for synchronization of source and replicated instances of sequential access storage components in a computing environment by a processor device are provided. A replication synchronization table (RST) is configured for the source instance. The RST is adapted for recording compacted information for at least one of a truncate and an erase operation applied on the source instance. The RST of the source instance is updated at a source component with the compacted information. The updated RST is transmitted from the source instance to the replicated instance. Based on the RST of the source instance and the RST of the replicated instance, data representative of a most recent position on the source component from which data should be transmitted to a replicated component to achieve a full synchronization is determined.02-17-2011
20110145523ELIMINATING DUPLICATE DATA BY SHARING FILE SYSTEM EXTENTS - A hardware and/or software facility to enable emulated storage devices to share data stored on physical storage resources of a storage system. The facility may be implemented on a virtual tape library (VTL) system configured to back up data sets that have a high level of redundancy on multiple virtual tapes. The facility organizes all or a portion of the physical storage resources according to a common store data layout. By enabling emulated storage devices to share data stored on physical storage resources, the facility enables deduplication across the emulated storage devices irrespective of the emulated storage device to which the data is or was originally written, thereby eliminating duplicate data on the physical storage resources and improving the storage consumption of the emulated storage devices on the physical storage resources.06-16-2011
20100138619Secure Erasure of Digital Files - One or more target files are securely erased from a host storage medium such as a disk by overwriting the target files not just with “O's,” “1's” and/or random data, but also (or instead) by overwriting them with portions of other, selected, innocuous files found on the same medium. By booting the host using a secondary, preferably external mechanism, before the host operating system is allowed to load, logging of file accesses and process execution by the host OS is circumvented. Post-replacement fragmentation and defragmentation may also be used to further reduce the detectability of the erasure, and the success of the process may be evaluated using statistical analysis.06-03-2010
20100017572TRANSACTIONAL MEMORY SUPPORT FOR NON-COHERENT SHARED MEMORY SYSTEMS USING SELECTIVE WRITE THROUGH CACHES - A method of controlling memory operations in a transactional shared memory system having a plurality of nodes connected through an interconnect network. The method includes initiating a memory operation at a first node including a first memory controller and a transaction table where the transaction table is configured to store a list of nodes affected by the memory operation, transmitting a store request signal through the interconnect network to a second node including a second memory controller and an access table where the store request signal includes memory operation data from the first memory controller, storing memory operation data to the access table in entries corresponding to one or more memory addresses affected by the memory operation, identifying a memory conflict with one or more nodes in the list of nodes when the one or more memory addresses affected by the memory operation are also affected by one or more conflicting transactions listed in the access table, transmitting an abort signal from the second node to each of the one or more nodes corresponding to the memory conflict, and transmitting an intent to commit signal from the first node to the second node.01-21-2010
20090043976SYSTEM AND ARTICLE OF MANUFACTURE FOR REMOVING ALIAS ADDRESSES FROM AN ALIAS ADDRESS POOL - Provided are a system and article of manufacture for removing alias addresses from an alias address pool. A plurality of alias addresses are assigned to an alias address pool, wherein the alias addresses in the alias address pool are capable of being dynamically assigned to a device to service I/O requests to the device. An operation is initiated by a process to remove a specified alias address from the alias address pool. An indicator is set to prevent additional processes from removing one alias address from the alias address pool in response to initiating the operation. The specified alias address is removed from the alias address pool.02-12-2009
20090313443METHODS AND SYSTEM FOR SIMPLIFIED SAS ERROR RECOVERY - Methods and systems for simplified error recovery in a SAS device. A SAS device (e.g., a SAS/SSP target device such as a storage device) enhanced in accordance with features and aspects hereof NAKs a received frame that has an error and then NAKS all subsequently received frames, regardless of whether received with or without error, until the connection is closed. The second SAS device (e.g., a SAS/SSP initiator) then performs required error recovery by re-establishing a connection and re-transmitting all previously NAKed frames. The enhanced SAS thereby simplifies logic for error recovery.12-17-2009
20110153963Memory Controller and Associated Control Method - A memory controller and an associated controlling method are provided. The memory controller is connected to a memory module, and includes a FIFO buffer for receiving valid data outputted from the memory module, a write pointer for indicating written data stored in the FIFO buffer, and a read pointer for indicating read data stored in the FIFO buffer. According to the controlling method, during a CAS latency of the memory module after a read command is generated, the value of the write pointer is controlled to have the same value as that of the read pointer.06-23-2011
20130013873SYSTEM AND METHOD FOR OPTIMIZING DATA IN VALUE-BASED STORAGE SYSTEM - A storage system includes a plurality of data vats, and a processor including an optimizing unit that optimizes a value of data stored in the storage system. The optimizing unit optimizes the value by computing and implementing an optimal decision for allocating new data to a first data vat of the plurality of data vats, moving existing data from at least a second data vat of the plurality of data vats to the first data vat, and deleting existing data from the first data vat, based on an amount of data in each of the plurality of data vats.01-10-2013
20120303911ELECTRONIC DEVICE WITH REVERSING STACK DATA CONTAINER AND RELATED METHODS - An electronic device may include a memory, and a processor coupled to the memory for storing and accessing data in the memory. The processor may arrange the data in a stack data container including values extending from a stack top to a stack bottom, operate the stack data container in first and second modes of operation, and while in the first mode of operation, push and pop a respective value from the stack top of the stack data container. The processor may also while in the second mode, reverse an orientation of the stack data container and the values therein, and push and pop a respective value from the stack bottom of the reversed stack data container.11-29-2012
20110072223METHOD AND SYSTEM FOR MANAGING COOKIES IN WEB COMMUNICATIONS - A system and method which may allow a Web application to manage cookies and prevent important data in cookies from being arbitrarily deleted. Cookie data may be separated into a number of tiers according to their importance. When a request to write new data to a cookie is received, the tier to which the new data belongs may be determined and compared to the tier(s) of existing data in the cookie, and existing data may be deleted from the cookie to free room for the new data only when the existing data is not more important than the new data.03-24-2011
20100122048MANAGING MEMORY PAGES - A method, and corresponding software and system, is described for paging memory used for one or more sequentially-accessed data structure. The method includes providing a data structure representing an order in which memory pages are to be reused; and maintaining the data structure according to a history of access to a memory page associated with one of the sequentially-accessed data structures. A position of the memory page in the order depends on a transition of sequential access off of the memory page.05-13-2010
20090313444SEMICONDUCTOR STORAGE APPARATUS MANAGING SYSTEM, SEMICONDUCTOR STORAGE APPARATUS, HOST APPARATUS, PROGRAM AND METHOD OF MANAGING SEMICONDUCTOR STORAGE APPARATUS - It is an object to provide a semiconductor storage apparatus managing system for implementing a semiconductor storage apparatus which can be actually utilized in place of a hard disk apparatus.12-17-2009
20080201540PRESERVATION OF INTEGRITY OF DATA ACROSS A STORAGE HIERARCHY - A method and apparatus for preservation of integrity of data across a storage hierarchy. An embodiment of a method includes verifying integrity of a memory page that is stored in primary computer memory. The memory page is swapped out of the primary computer memory to a secondary memory, wherein swapping the memory page out includes performing an integrity check of the memory page. The memory page is swapped in the primary computer memory from the secondary memory, wherein swapping in the memory page includes verifying the integrity of the memory page based at least in part on the integrity check performed for swapping out the memory page.08-21-2008
20110264874LATENCY CONTROL CIRCUIT AND METHOD USING QUEUING DESIGN METHOD - A latency control circuit includes a FIFO controller and a register unit. The FIFO controller may generate an increase signal according to an external command, and generate a decrease signal according to an internal command. The FIFO controller may also enable a depth point signal responsive to the increase signal and the decrease signal. The register unit may include n registers. The value n (rounded off) may be obtained by dividing a larger value of a maximum number of additive latencies and a maximum number of write latencies by a column cycle delay time (tCCD). The registers may store an address received with the external command responsive to the increase signal and a clock signal, and may shift either the address or a previous address to a neighboring register. The latency control circuit transmits an address stored in a register as a column address corresponding to the enabled depth point signal.10-27-2011
20120311278DELETE NOTIFICATIONS FOR AN ENTIRE STORAGE DEVICE - A delete notification can be received at a storage stack filter in a storage stack. It can be determined whether the delete notification applies to an entire storage device. If the delete notification does not apply to the entire storage device, a first set of actions can be taken with the storage stack filter in response to the delete notification. If the delete notification does apply to the entire storage device, a second set of actions can be taken with the storage stack filter in response to the delete notification.12-06-2012
20110093672SYSTEMS AND METHODS FOR RECOVERING ELECTRONIC INFORMATION FROM A STORAGE MEDIUM - In one embodiment of the invention, a method is provided for retrieving certain electronic information previously stored on certain storage media after a threshold set in the storage retention criteria has been exceeded in an electronic information storage system that stores electronic information on storage media in accordance with a storage retention criteria is provided. The method includes storing a record in a memory associated with a system manager that assigns the storage retention criteria to the certain electronic data, designating the storage media available for overwrite after the threshold set in the storage retention policy has been exceeded, identifying the certain storage media available for overwrite, and retrieving information from the certain media after the threshold set in the storage retention policy has been exceeded.04-21-2011
20110145524INFORMATION RECORDING MEDIUM, INFORMATION RECORDING DEVICE, INFORMATION RECORDING METHOD, INFORMATION REPRODUCING DEVICE, AND INFORMATION REPRODUCING METHOD - According to the present invention, the size of defect management information is reduced by using a top spare area 06-16-2011
20100030981Method of Clustering Shared Access Hybrid Hard Drives - A method, apparatus, and article of manufacture are provided for managing a hybrid storage device based upon the properties associated therewith. The storage device includes flash memory and physical storage. Select data is written to the flash memory and is not subject to flushing to the physical storage, and select data is either written directly to the physical storage or written to the flash memory and is subject to flushing to the physical storage.02-04-2010
20090024809Managing Purgeable Memory Objects - A system and method of managing purgeable memory objects includes a LIFO and/or FIFO queue for volatile memory objects, which can be emptied at a rate that matches the speed of a page queue.01-22-2009
20090172318Memory control device - A memory control device that can improve the speed of a memory interface. A packet disassembly section disassembles packet data into segments and detects packet quality information. A memory management section has an address management table and manages a state in which the packet data is stored according to the packet quality information. A segment/request information disassembler disassembles the segments into data by an access unit by which memories can be written/read, and generates write requests and read requests according to the access unit. A memory access controller avoids a bank access to which is prohibited because of a bank constraint, extracts a write request or a read request corresponding to an accessible bank from the write requests or the read requests generated, and gains write/read access to the memories.07-02-2009
20090172317MECHANISMS FOR STRONG ATOMICITY IN A TRANSACTIONAL MEMORY SYSTEM - A method and apparatus for providing efficient strong atomicity is herein described. Optimized strong operations may be inserted at non-transactional read accesses to provide efficient strong atomicity. A global transaction value is copied at a beginning of a non-transational function to a local transaction value; essentially creating a local timestamp of the global transaction value. At a non-transactional memory access within the function, a counter value or version value is compared to the LTV to see if a transaction has started updating memory locations, or specifically the memory location accessed. If memory locations have not been updated by a transaction, execution is accelerated by avoiding a full set of slowpath strong atomic operations to ensure validity of data accessed. In contrast, the slowpath operations may be executed to resolve contention between a transactional and non-transaction access contending for the same memory location.07-02-2009
20110167231Value Recycling Facility for Multithreaded Computations - Solutions to a value recycling problem facilitate implementations of computer programs that may execute as multithreaded computations in multiprocessor computers, as well as implementations of related shared data structures. Some exploitations allow non-blocking, shared data structures to be implemented using standard dynamic allocation mechanisms (such as malloc and free). Some exploitations allow non-blocking, indeed even lock-free or wait-free, implementations of dynamic storage allocation for shared data structures. In some exploitations, our techniques provide a way to manage dynamically allocated memory in a non-blocking manner without depending on garbage collection. While exploitations of solutions to the value recycling problem that we propose include management of dynamic storage allocation wherein values managed and recycled tend to include values that encode pointers, they are not limited thereto. Indeed, the techniques are more generally applicable to management of values in a multithreaded computation. For example, value recycling techniques may be exploited, in some cases, apart from dynamic storage allocation, to allow a multithreaded computation to avoid the classic ABA hazard.07-07-2011
20120117339FLEXIBLE CONTENT STORAGE MANAGEMENT FOR DVRS - A media broker comprises a communication interface and a controller associated with the communication interface configured to receive a request from a user to record a requested media item. The media broker proceeds to query an aggregated stored content list (ASCL) including information indicative of each of the media items stored on one or more media storage device communicatively coupled to the media broker to determine if the requested media item is stored on the one or more media storage devices. If it is determined that the requested media item is stored on the one or more media storage devices the user that requested the media item is informed and the media item is stored on the one or more media storage devices. Conversely, if it is determined that the requested media item is not stored on the one or more media storage devices, the requested media item is recorded.05-10-2012
20090150625Multistage Virtual Memory Paging System - Hierarchically paging data in a computer system wherein, when evicting a page of data from the computer system main storage, evicting the page to a first paging store (preferably NVRAM). When evicting a page of data from the first paging store, evicting the page to a second paging store (such as a disk). When the main store requires a page of data that is not in the main store and when the page of data is available in the first paging store, loading the third page of data into main store from first paging store. When the page of data is not available in the first paging store, loading the third page of data into main store from the second store. Optionally, pages of main store are saved and restored from NVRAM during a power-down, power-up sequence of events.06-11-2009
20120159095INTERFACE SYSTEM, AND CORRESPONDING INTEGRATED CIRCUIT AND METHOD - An interface system for interfacing an asynchronous circuit with a synchronous circuit, wherein the synchronous circuit samples, in response to a clock signal, a first data signal when a first control signal indicates that the first data signal contains valid data, and wherein the asynchronous circuit generates a second data signal according to an asynchronous communication protocol. The system includes a FIFO memory, a control circuit for asynchronously writing the second data signal in the memory when the second data signal indicates the start of a communication, and synchronously reading the second data signal from the memory in response to a clock signal, and a conversion circuit for decoding, according to a asynchronous communication protocol, the second data signal read from the memory in a decoded data signal, wherein the decoded data signal corresponds to the first data signal.06-21-2012
20120072683Managing Write Operations in a Computerized Memory - A method and apparatus for managing write operations in memory. The method includes a memory including units, each of the units including subunits. Data updates are written “out-of-place”, in that new data does not overwrite the memory locations (subunits) where the data is currently stored. The at least one subunit containing the outdated data is marked as invalid. As a result, a subunit can contain up to date data in a valid subunit next to invalid subunits. For reclaiming units for erasure, it is searched amongst the units to identify a unit or units that match a predetermined criterion. The data of valid subunits of such identified unit is rewritten to another unit or units.03-22-2012
20120110285INFORMATION STORAGE MEDIUM, RECORDING/REPRODUCING APPARATUS, AND RECORDING/REPRODUCING METHOD - A recording/reproducing apparatus is configured to record a replacement block by logical overwrite (LOW) for updating data recorded on an information storage medium in a first area of the medium, record a replacement block for replacing a defect block generated on the medium in a second area of the medium, and record a second replacement block for replacement by defect of a first replacement block in the second area if the defect is detected while the first replacement block is being recorded in the first area to perform the logical overwrite of an original block recorded in a predetermined area of the medium, generate a defect list (DFL) entry including location information of the original block and location information of the second replacement block in order to indicate the replacement state, and move location information of the first replacement block in the second replacement block.05-03-2012
20120124304MEMORY BLOCK MANAGEMENT - One or more embodiments comprise control circuitry coupled to one or more memory devices having a number of planes of physical blocks organized into super blocks. The control circuitry can be configured to: determine defective physical blocks among the number of planes; responsive to none of the physical blocks at a particular block position being determined to be defective, assign the physical blocks at the particular block position to a super block; and responsive to one or more of the physical blocks at a particular block position being determined to be defective, assign non-defective physical blocks at the particular block position to a super block and assign a replacement physical block to the super block for the respective defective physical blocks at the particular block position, the replacement physical block selected from a number of physical blocks within a respective plane that includes a respective defective physical block.05-17-2012
20120317380DEVICE AND METHOD FOR A HALF-RATE CLOCK ELASTICITY FIFO - A device and method for processing an incoming data stream in a half-rate clock elasticity first in first out (FIFO) are disclosed. In one embodiment, two data blocks are written substantially simultaneously to two locations in the elasticity FIFO specified by respective two write pointers in a write clock cycle of a write clock. Further, two data blocks are read substantially simultaneously from two consecutive or non-consecutive locations in the elasticity FIFO specified by two read pointers in a read clock cycle of a read clock. The two read pointers can independently adjust locations to read in the plurality of locations based on a type of the data blocks in the elasticity FIFO and a predetermined elasticity FIFO threshold level in the read clock cycle to maintain the elasticity FIFO level at predetermined elasticity FIFO threshold level to achieve a constant output rate.12-13-2012
20120221811RETENTION MANAGEMENT IN A WORM STORAGE SYSTEM - A write-once-read-many, WORM, storage system is arranged to store datasets each with associated attributes including a WORM attribute indicating the dataset's WORM status, and to protect from change or deletion WORM datasets, and at least certain of their attributes including those relevant to WORM status. Retention management capabilities are provided for such a storage system, including the ability to set a given dataset for retention for a particular retention period by storing a corresponding retention date in an attribute of the dataset, and setting the WORM attribute to indicate that the dataset is a WORM dataset. Also provided is the ability to determine expiry of the retention period for the given dataset, and then to remove the stored retention date and change the WORM attribute of the dataset to indicate that it is no longer a WORM dataset.08-30-2012
20120166744MEMORY MANAGEMENT METHOD, COMPUTER SYSTEM, AND STORAGE MEDIUM HAVING PROGRAM STORED THEREON - A memory management method, which is used in a computer including a CPU and a memory to unload an area no longer necessary out of a memory area used by a program stored in the memory and executed by the CPU, comprising: generating a first processing system for executing the program in the memory; generating a second processing system in the memory when a first opportunity occurs; copying a content of a memory area of the first processing system to a memory area of the second processing system; determining an unnecessary area out of the copied memory area of the second processing system; transmitting a determination result regarding the unnecessary area to the program of the first processing system when a second opportunity occurs receiving the determination result; unloading the unnecessary area in the memory area of the first processing system.06-28-2012
20120179884COMMUNICATION SYSTEM, INFORMATION PROCESSING APPARATUS, COMPUTER-READABLE STORAGE MEDIUM, AND COMMUNICATION METHOD - Prior to performing download play, it is determined whether or not a slave apparatus program has been already stored in an internal memory of a slave apparatus. When not stored yet, the slave apparatus program is transmitted from a master apparatus to the slave apparatus, and stored in the internal memory of the slave apparatus. When already stored, the slave apparatus program is not transmitted from the master apparatus to the slave apparatus. Then, multiplay is performed by performing mutual communication between the master apparatus operating in accordance with a master apparatus game program and the slave apparatus operating in accordance with a slave apparatus game program. Thus, time and effort for receiving the same application program more than once are omitted, and it is possible to efficiently start a communication process.07-12-2012
20120185657SYSTEMS AND METHODS FOR RECOVERING ELECTRONIC INFORMATION FROM A STORAGE MEDIUM - In one embodiment of the invention, a method is provided for retrieving certain electronic information previously stored on certain storage media after a threshold set in the storage retention criteria has been exceeded in an electronic information storage system that stores electronic information on storage media in accordance with a storage retention criteria is provided. The method includes storing a record in a memory associated with a system manager that assigns the storage retention criteria to the certain electronic data, designating the storage media available for overwrite after the threshold set in the storage retention policy has been exceeded, identifying the certain storage media available for overwrite, and retrieving information from the certain media after the threshold set in the storage retention policy has been exceeded.07-19-2012
20090019244Information Record/Read Apparatus - A plurality of sectors 01-15-2009
20120239891DYNAMIC REUSE AND RECONFIGURATION OF LOGICAL DATA OBJECTS IN A VIRTUAL TAPE SYSTEM - A method in one embodiment for operating a virtual server supporting at least one Write Once Read Many (WORM) logical data object and at least one read-write logical object includes initializing a logical data object from a common pool of the logical data objects, the logical data object bound with a member of a media type group, the member of the media type group comprising a WORM logical data object and a read-write logical data object; and reusing one of the logical data objects as the member of the media type group without ejection and reinsertion by mounting the logical data object with a write from beginning of logical data object to bind at least one data attribute to the member of the media type group to replace any previous attribute and data associated with the logical data object.09-20-2012
20120324181DETECTING AND SUPPRESSING REDUNDANT INPUT-OUTPUT OPERATIONS - In a virtual machine, swap activities of a hypervisor and a guest OS are reconciled so that redundant input-output operations (IOs) can be avoided and a synchronous response time of the virtual machine improved. This is achieved with a map of memory pages to blocks of storage. For a write IO to write contents of a memory page into a target block, the map is examined to see if it contains a valid entry for the memory page. If the map contains the valid entry, the write IO is prevented from being issued and a data structure is updated so that subsequent IOs to the target block is redirected from the target block to a block that is associated with the physical memory page in the valid entry. On the other hand, if the map does not contain the valid entry, the write IO is issued.12-20-2012
20120278566Intelligent Partitioning of External Memory Devices - Multiple memory devices, such as hard drives, can be combined and logical partitions can be formed between the drives to allow a user to control regions on the drives that will be used for storing content, and also to provide redundancy of stored content in the event that one of the drives fails. Priority levels can be assigned to content recordings such that higher value content can be stored in more locations and easily accessible locations within the utilized drives. Users can control and organize how recorded content is stored between the drives such that an external drive may be removed from a first gateway device and attached to a second gateway device without losing the ability to access the recorded content from the first gateway device at a later time. In this manner, a user is provided with the ability to transport an external drive containing stored content recordings between multiple different gateway devices such that the recordings may be accessed at different locations or user premises.11-01-2012
20110276769DATA PROCESSOR - A system is described that generates reports from very large data sets. The reports are generated in real-time (or close to real time). Data from the large data set is replicated to a buffer as it arrives in the system. Once sufficient data is obtained (e.g. when the buffer is filled), the data is processed to generate a report. The report may summarize the data obtained and may be stored for later use. By storing summary data instead of the full data, the data storage requirements are reduced.11-10-2011
20120096229STORAGE CONTROL APPARATUS AND STORAGE CONTROL APPARATUS MEMORY CONTROL METHOD - A storage control apparatus of the present invention is able to duplicatively manage data in a cache memory even during maintenance work. When a memory package CMPK04-19-2012
20110296125LOW LATENCY HANDOFF TO OR FROM A LONG TERM EVOLUTION NETWORK - A server device in a long term evolution (LTE) network may store, in a memory, context information, associated with a prior communication session between the LTE network and a user device, where the context information permits a communication session to be established within a time period, the time period being less than another time period to initially establish the communication session or to establish the communication session without the context information. The server device may further receive a registration request associated with the user device; determine whether the memory stores the context information; perform, within the time period, an abbreviated registration operation to establish the communication session with the user device, using the context information from the memory, when the memory stores the content information; and perform, within the other time period, a registration operation to establish the communication session when the memory does not store the context information.12-01-2011
20120290801CONTROLLING STORING OF DATA - First characteristic information indicating a characteristic of input data is extracted from the input data that is input as data to be stored in any of the storages. Second characteristic information elements are read from a memory unit storing the second characteristic information elements indicating respective characteristics of stored data elements stored in the storages. A specific storage in which the input data is to be stored is determined, out of the storages, by determining a degree of match between the extracted first characteristic information and the second characteristic information elements read. The input data to the determined specific storage is read. The second characteristic information element indicating the characteristic of the stored data element stored in the specific storage is updated, out of the second characteristic information elements retained in the memory unit, on the basis of the extracted first characteristic information.11-15-2012
20130132690SELECTIVE ACCESS TO EXECUTABLE MEMORY - In an embodiment, a data processing method comprises, in a computer executing a supervisor program: the supervisor program establishing a plurality of different memory access permissions comprising any combination of read, write, and execute permissions for one or more different regions of memory of a first domain; setting the memory access permissions of a first set of the regions of memory to execute only; in response to a request from a process to read or write a particular region of memory in the first set, performing one or more responsive actions that prevent the process from reading or modifying one or more instructions or one or more embedded immediate values of the particular region of memory. Embodiments provide selective access to executable memory.05-23-2013
20130151800NUCLEAR MEDICINE IMAGING APPARATUS AND CONTROL METHOD - According to one embodiment, a nuclear medicine imaging apparatus includes a counting information collection unit, a determination unit, and a discarding unit. The counting information collection unit collects counting information including detection time of a gamma ray from a counting result output by a detector for counting light derived from a gamma ray, and stores the counting information in a buffer. The determination unit determines whether the volume of the counting information stored in the buffer exceeds a threshold. The discarding unit, in a case that the determination unit determines that the volume exceeds the threshold, intermittently discards, in chronological order, counting information whose detection time is within longer duration than predetermined duration used for generating two pieces of counting information obtained by counting pair annihilation gamma rays nearly coincidentally as coincidence counting information among the counting information collected from the detector.06-13-2013
20100306484HETEROGENEOUS STORAGE ARRAY OPTIMIZATION THROUGH EVICTION - A storage system can comprise storage devices having storage media with differing characteristics. An eviction handler can receive information regarding the state of storage media or of data stored thereon, as well as information regarding application or operating system usage, or expected usage, of data, or information regarding policy, including user-selected policy. Such information can be utilized by the eviction handler to optimize the use of the storage system by evicting data from storage media, including evicting data in order to perform maintenance on, or replace, such storage media, and evicting data to make room for other data, such as data copied to such storage media to facilitate pre-fetching or implement policy. The eviction handler can be implemented by any one or more of processes executing on a computing device, control circuitry of any one or more of the storage devices, or intermediate storage-centric devices.12-02-2010
20120284469MEMORY SYSTEM AND BAD BLOCK MANAGEMENT METHOD - Disclosed is a bad block management method of a memory system that includes virtual blocks having a plurality of units and at least one reserved block. The bad block management method includes mapping the virtual blocks and the at least one reserved block onto one physical block in the plurality of physical blocks, determining that a first virtual block in the virtual blocks includes a bad virtual block unit, and replacing the bad virtual block unit in the first virtual block with a first reserved block unit selected from the reserved block units.11-08-2012
20120284470SEMICONDUCTOR MEMORY DEVICE WITH HIGH-SPEED DATA TRANSMISSION CAPABILITY, SYSTEM HAVING THE SAME, AND METHOD FOR OPERATING THE SAME - Semiconductor memory device with high-speed data transmission capability, system having the same includes a plurality of address input circuits and a plurality of data output circuits and a training driver configured to distribute address information input through the plurality of address input circuits together with a data loading signal for a read training, and generate data training patterns to be output through the plurality of data output circuits.11-08-2012
20120030438Method and Apparatus for Performing Skew Removal in the Receiver of a Multi-Lane Communication Link - Serial data streams received on multiple data lanes, wherein each data stream is in the form of a series of blocks including a data block preceded by a synchronization block, are deskewed by setting a detection flag in response to the valid detection of one or more synchronization blocks in each data stream, writing received data following the setting of said detection flag for that data stream to memory, and reading data sequentially from each memory under the control of a common output clock in response to the setting of the flag in respect at least a group of the data streams.02-02-2012
20120066462UPDATING MULTI-MEDIA CONTENT IN A DIGITAL DOWNLOAD KIOSK - A method of updating multi-media content at a digital download kiosk is described. The method comprises receiving a secure portable storage device into a portable device reader/writer in the kiosk; reading the secure portable storage device to ascertain if authorized multi-media content is stored thereon; uploading the multi-media content from the secure portable storage device to a data store accessible by the kiosk; and indicating when the multi-media content has been uploaded. The portable storage device may have been received by mail from a supplier, and the method may further comprise removing the portable storage device from the portable storage device reader/writer, and returning the removed portable storage device to the supplier by mail.03-15-2012
20130205106MAPPING GUEST PAGES TO DISK BLOCKS TO IMPROVE VIRTUAL MACHINE MANAGEMENT PROCESSES - In a virtualized computer system, guest memory pages are mapped to disk blocks that contain identical contents and the mapping is used to improve management processes performed on virtual machines, such as live migration and snapshots. These processes are performed with less data being transferred because the mapping data of those guest memory pages that have identical content stored on disk are transmitted instead of the their contents. As a result, live migration and snapshots can be carried out more quickly. The mapping of the guest memory pages to disk blocks can also be used to optimize other tasks, such as page swaps and memory error corrections.08-08-2013
20080250213Computer Architecture And Method Of Operation for Multi-Computer Distributed Processing Having Redundant Array Of Independent Systems With Replicated Memory And Code Striping - Computers and other computing machines and information appliances having a modified computer architecture and program structure which enables the operation of an application program concurrently or simultaneously on a plurality of computers interconnected via a communications link or network using a special distributed runtime (DRT), and that provides for a redundant array of independent computing systems that include computer code distribution using code-striping onto the plurality of the computers or computing machines. A redundant array of independent computing systems operating in concert and code-striping features.10-09-2008
20130212344SELECTIVE RETIREMENT OF BLOCKS - Systems and methods are provided for selectively retiring blocks based on refresh events of those blocks. In addition to refresh events, other criteria may be applied in making a decision whether to retire a block. By applying the criteria, the system is able to selectively retire blocks that may otherwise continue to be refreshed.08-15-2013
20130212343DATA PROCESSING METHOD, DATA PROCESSING APPARATUS, AND DATA PROCESSING PROGRAM - Buffer management unit selects the input and output buffer to be set as a replacement target referring to the input and output buffers in order and calculates the number of times of replacement execution for the input and output buffer and reference speed for referring to the input and output buffers in order. At execution of pre-write processing, the pre-write management unit selects, according to position information of the input and output buffer subjected to the last pre-write processing, position information, and the number of times of replacement execution, the input and output buffer to be set as a target of the present pre-write processing. When updated data is present in the input and output buffer, the pre-write management unit writes the data in the secondary storage device and executes the next pre-write processing according to the reference speed.08-15-2013

Patent applications in class Entry replacement strategy

Patent applications in all subclasses Entry replacement strategy