Addressing Or Allocation; Relocation (epo) Patents (Class 711/E12.002)
  • Patent number: 9524234
    Abstract: A method for optimizing memory usage in a device having a universal controlling application includes receiving into the device data for use in configuring the universal controlling application wherein the data is used to identify from within a library of command code sets stored in a memory of the device a command code set that is appropriate for use in commanding functional operations of the appliance and causing a non-identified one or more of the command code sets of the library of command code sets stored in the memory of the device to be discarded to thereby create freed space in the memory of the device.
    Type: Grant
    Filed: March 13, 2014
    Date of Patent: December 20, 2016
    Assignee: Universal Electronics Inc.
    Inventors: Arsham Hatambeiki, Jan VanEe, Christopher Lee Somerville, Daniel Morrionne
  • Patent number: 9043574
    Abstract: A dispersed storage (DS) unit for use within a dispersed storage network is capable of self-configuring using registry information provided to the DS unit. The registry information includes a slice name assignment indicating a range of slice names corresponding to a plurality of potential data slices of potential data objects to be stored in the DS unit. Based on the registry information, the DS unit allocates a portion of physical memory to store the potential data slices.
    Type: Grant
    Filed: December 28, 2012
    Date of Patent: May 26, 2015
    Assignee: Cleversafe, Inc.
    Inventors: Manish Motwani, Wesley Leggette
  • Patent number: 9037816
    Abstract: Dynamically creating a communication path between first and second storage devices, includes creating a connection to a source volume on the first storage device and indicating that the source volume is not ready to transmit data on the communication path, after successfully creating the connection to the source volume, creating a connection to a destination volume on the second storage device and initially indicating that portions of one of: the destination volume and the source volume do not contain valid copies of data, where the destination volume accepts data from the source volume, and after successfully creating the connections to the source and destination volumes, indicating that the source volume is ready to transmit data on the communication path. Dynamically creating a communication path between first and second storage devices, may also include creating at least one of: the source volume and the destination volume.
    Type: Grant
    Filed: June 5, 2014
    Date of Patent: May 19, 2015
    Assignee: EMC Corporation
    Inventors: Mark J. Halstead, Dan Arnon, David Meiri
  • Patent number: 9032170
    Abstract: Replicated data storage units are autonomously identified and assembled into generationally related data storage volumes. A data storage manager, implementing a re-signaturing process executed at defined intervals or manually initiated on a server or client system connected to the storage area network, scans the collection of visible data storage units to identify those related as a data storage volume. Each replicated data storage unit includes metadata that embeds an identification of the replicated data storage unit and volume accessible to the data storage manager. To assemble a set of replicated data storage units into a generational volume, the data storage unit metadata is rewritten to establish a unique data storage volume identity including information to associate the data storage volume in a lineage with the source data storage volume.
    Type: Grant
    Filed: October 25, 2012
    Date of Patent: May 12, 2015
    Assignee: VMware, Inc.
    Inventors: Satyam B. Vaghani, Nikhil C. Jagtiani
  • Patent number: 9032178
    Abstract: An electronic apparatus includes a memory control part that carries out allocation and deallocation of a memory area in a memory space; a memory reorganization part that carries out a reorganization process of moving the memory area allocated by the memory control part and creating a contiguous free space in the memory space; and a reorganization control part that causes the reorganization part to carry out the reorganization process in a case where a first predetermined condition is met, and does not cause the reorganization part to carry out the reorganization process in a case where a second predetermined condition different from the first predetermined condition is met.
    Type: Grant
    Filed: February 22, 2013
    Date of Patent: May 12, 2015
    Assignee: Ricoh Company, Ltd.
    Inventor: Takafumi Shimizu
  • Patent number: 9026760
    Abstract: Described are techniques for enforcing an allocation policy. Information is received that describes one or more storage groups. Each of the storage groups includes one or more thin devices. Each of the thin devices includes a plurality of chunks of storage allocated on one or more of a plurality of storage tiers. For each of the one or more storage groups, a plurality of counters is determined indicating amounts of storage currently allocated from the plurality of storage tiers for use by the storage group. Using the plurality of counters, it is determined whether each of the one or more storage groups violates thresholds included in an allocation policy associated with each storage group. Each of the thresholds specifies a maximum amount of storage of one of the plurality of storage tiers that can be used by each storage group.
    Type: Grant
    Filed: September 18, 2013
    Date of Patent: May 5, 2015
    Assignee: EMC Corporation
    Inventors: Marik Marshak, Alexandr Veprinsky
  • Patent number: 9026759
    Abstract: The present invention is provided to make effective use of a storage area, and to enhance user usability. A management apparatus determines a reallocation destination of each logical storage area on the basis of an access load on each logical storage area by a host computer and an allocation status of each logical storage area in a storage-destination storage tier. A monitoring mode selection part for selecting any one of multiple monitoring modes selects a prescribed monitoring mode from the multiple monitoring modes on the basis of allocation time information related to a time at which each logical storage area is allocated to an allocation-destination storage tier.
    Type: Grant
    Filed: November 21, 2011
    Date of Patent: May 5, 2015
    Assignee: Hitachi, Ltd.
    Inventors: Takahiko Tomida, Katsutoshi Asaki, Takato Kusama
  • Patent number: 9021230
    Abstract: A storage device includes: a temporary buffer for sequentially storing data configuring a file requested to be written for every reception from outside; a data writing means for immediately separating the data in the temporary buffer into mutually corresponding data portion and marker portion classified by preset criteria and storing into a data storing means in an associated state, and deleting from the temporary buffer; an unseparated data writing means for storing the data that cannot be separated into the data portion and the marker portion among the data in the temporary buffer, into an unseparated data storing means; and a re-separation processing means for separating the data in the unseparated data storing means into the data portion and the marker portion by preset criteria and storing into the data storing means with the data portion and the marker portion associated, and deleting from the unseparated data storing means.
    Type: Grant
    Filed: October 19, 2010
    Date of Patent: April 28, 2015
    Assignee: NEC Corporation
    Inventor: Yoshiaki Noguchi
  • Patent number: 9021199
    Abstract: Methods and structure are disclosed for normalizing storage performance across a plurality of logical volumes. One embodiment is a storage controller. The storage controller is adapted to couple with a plurality of host systems and a storage device. The storage controller is adapted to receive one or more requests to create logical volumes for the plurality of hose systems, and adapted to identify a plurality of performance zones for storage areas of the storage device. The performance zones exhibit different performance criteria for one or more of: reading data from the storage device and writing data to the storage device. The storage controller is further adapted to allocate storage from each of the plurality of performance zones for each of the plurality of logical volumes such that the performance criteria for accessing the storage device is distributed substantially uniformly across the plurality of logical volumes.
    Type: Grant
    Filed: August 15, 2012
    Date of Patent: April 28, 2015
    Assignee: LSI Corporation
    Inventors: Nilesh S. Govande, Jameer Babasaheb Mulani, Brad D. Besmer, Susan Gray
  • Patent number: 9021229
    Abstract: Embodiments of the invention relate to optimizing a file system for different types of applications in a compute cluster using dynamic block size granularity. An exemplary embodiment includes reserving a predetermined number of storage allocation regions for each node in a cluster, wherein each storage allocation region comprises a set of contiguous data blocks on a single storage disk of locally attached storage; using a contiguous set of data blocks on a single storage disk of locally attached storage as a file system's block allocation granularity for striping data to be stored in the file system for a compute operation in the cluster; and using a single data block of a shared storage subsystem as the file system's block allocation granularity for striping data to be stored in the file system for a data access operation in the cluster.
    Type: Grant
    Filed: April 14, 2010
    Date of Patent: April 28, 2015
    Assignee: International Business Machines Corporation
    Inventors: Rajagopal Ananthanarayanan, Karan Gupta, Prashant Pandey, Himabindu Pucha, Prasenjit Sarkar, Mansi Ajit Shah, Renu Tewari
  • Patent number: 9021175
    Abstract: A method, system and computer-usable medium are disclosed for reordering User Data Segment (UDS) lists to reduce seek times when accessing data stored on tape media. A host application sends a list of UDSs to a target tape drive and requests the tape drive to reorder the list to provide better performance. An ordered list of target User data Segments to retrieve from a target tape media is received. Information related to the location of each UDS on the target media is processed to determine its corresponding physical position on the tape media. The resulting physical positions are then processed to generate a reordered UDS list, where the order of the User Data Segments is reordered according to their physical location on the target tape media. The reordered list of User Data Segments is then used to perform seek, reposition and read operations to read User Data Segments from the tape media.
    Type: Grant
    Filed: August 24, 2010
    Date of Patent: April 28, 2015
    Assignee: International Business Machines Corporation
    Inventors: Kevin D. Butt, Scott M. Fry, Paul M. Greco, Takashi Katagiri, Yutaka Oishi
  • Patent number: 9021227
    Abstract: The present disclosure relates to the drift management for a memory device. In at least one embodiment, the memory device of the present disclosure may include a phase change memory and switch (hereinafter “PCMS”) memory cell and a memory controller that is capable of implementing drift management to control drift. Other embodiments are described and claimed.
    Type: Grant
    Filed: June 22, 2011
    Date of Patent: April 28, 2015
    Assignee: Intel Corporation
    Inventors: Elijah V. Karpov, Gianpaolo Spadini
  • Patent number: 9021198
    Abstract: According to various embodiments, systems and methods are provided that relate to shared access to Storage Area Networks (SAN) devices. In one embodiment, a Storage Area Network (SAN) host is provided, comprising: a server component; a first host bus adapter configured to be connected to a SAN client over a first SAN; a second host bus adapter configured to be connected to a SAN storage device over a second SAN; and wherein the server component is configured to manage a data block on the SAN storage device, receive a storage operation request from the SAN client through the first host bus adapter, and in response to the storage operation request, perform a storage operation on the data block, the storage operation being performed over the second SAN through the second host bus adapter.
    Type: Grant
    Filed: January 20, 2011
    Date of Patent: April 28, 2015
    Assignee: CommVault Systems, Inc.
    Inventors: Manoj Kumar Vijayan, Srikant Viswanathan, Deepak Raghunath Attarde, Varghese Devassy, Rajiv Kottomtharayil
  • Patent number: 9015412
    Abstract: A storage system is configured to manage a pool to which multiple virtual volumes (VVOLs) are associated, assign a real area (RA) from any tier in an available tier pattern associated with a write-destination VVOL to a write-destination virtual area (VA), and carry out a reassignment process for migrating data inside the RA to an RA of a different tier, based on an access status of the RA. A management system is configured to assume a specified tier has been removed from the available tier pattern of a target VVOL, predict performance of all VVOLs associated with the pool to which the target VVOL is associated, determine whether there is a VVOL for which predicted performance is lower than a required performance, and when such a VVOL does not exist, instruct the storage system to remove the specified tier from the available tier pattern of the target VVOL.
    Type: Grant
    Filed: September 13, 2011
    Date of Patent: April 21, 2015
    Assignee: Hitachi Ltd.
    Inventors: Kyoko Miwa, Tsukasa Shibayama, Masayasu Asano
  • Patent number: 9015418
    Abstract: A method and system for self-sizing dynamic cache for virtualized environments is disclosed. The preferred embodiment self sizes unequal portions of the total amount of cache and allocates to a plurality of active virtualized machines (VM) according to VM requirements and administrative standards. As a new VM may emerge and request an amount of cache, the cache controller reclaims currently used cache from the active VM and reallocates the unequal portions of cache required by each VM. To ensure cache availability, a quick reclamation amount of cache is immediately available to each new VM as it makes the request begins operation. After reallocation, the newly created VM may rely on a guaranteed minimum quota of cache to ensure performance.
    Type: Grant
    Filed: November 20, 2012
    Date of Patent: April 21, 2015
    Assignee: LSI Corporation
    Inventor: Luca Bert
  • Patent number: 9015443
    Abstract: A hybrid computing environment in which the host computer allocates, in the shadow memory area of the host computer, a memory region for a packet to be written to the shared memory of an accelerator; writes packet data to the accelerator's shared memory in a memory region corresponding to the allocated memory region; inserts, in a next available element of the accelerator's descriptor array, a descriptor identifying the written packet data; increments the copy of the head pointer of the accelerator's descriptor array maintained on the host computer; and updates a copy of the head pointer of the accelerator's descriptor array maintained on the accelerator with the incremented copy.
    Type: Grant
    Filed: April 30, 2010
    Date of Patent: April 21, 2015
    Assignee: International Business Machines Corporation
    Inventors: Michael E. Aho, Charles J. Archer, James E. Carey, Matthew W. Markland, Philip J. Sanders
  • Patent number: 9009440
    Abstract: A storage system stores data in at least one partition of a physical storage media in accordance with file system information specifying a plurality of logical blocks having logical block addresses within the partition. The logical blocks include excess logical blocks that are not mapped to space in the physical storage media by the mapping employed by the storage system. Unusable block data marks those excess logical blocks as unusable. This makes it easy to adjust the data storage capacity of the storage system by changing the mapping to map more or less logical block addresses to space in the physical storage media and thereby destroy or create excess logical blocks, and by changing the unusable block data to correspondingly change the excess logical blocks marked as unusable.
    Type: Grant
    Filed: November 12, 2007
    Date of Patent: April 14, 2015
    Assignee: LSI Corporation
    Inventors: Duncan Beadnell, Don Harwood
  • Patent number: 9009435
    Abstract: Systems and computer program products are provided for optimizing selection of files for deletion from one or more data storage devices to free up a predetermined amount of space in the one or more data storage devices. A method includes analyzing an effective space occupied by each file of a plurality of files in the one or more data storage devices, identifying, from the plurality of files, one or more data blocks making up a file to free up the predetermined amount of space based on the analysis of the effective space of each file of the plurality of files, selecting one or more of the plurality of files as one or more candidate files for deletion, based on the identified one or more data blocks, and deleting the one or more candidate files for deletion from the one or more data storage devices.
    Type: Grant
    Filed: August 13, 2012
    Date of Patent: April 14, 2015
    Assignee: International Business Machines Corporation
    Inventors: Duane Mark Baldwin, Sandeep Ramesh Patil, Riyazahamad Moulasab Shiraguppi, Prashant Sodhiya
  • Patent number: 9009434
    Abstract: Systems and computer program products are provided for optimizing selection of files for eviction from a first storage pool to free up a predetermined amount of space in the first storage pool. A method includes analyzing an effective space occupied by each file of a plurality of files in the first storage pool, identifying, from the plurality of files, one or more data blocks making up a file to free up the predetermined amount of space based on the analysis of the effective space of each file of the plurality of files, selecting one or more of the plurality of files as one or more candidate files for eviction, based on the identified one or more data blocks, and evicting the one or more candidate files for eviction from the first storage pool to a second storage pool.
    Type: Grant
    Filed: August 13, 2012
    Date of Patent: April 14, 2015
    Assignee: International Business Machines Corporation
    Inventors: Duane Mark Baldwin, Sandeep Ramesh Patil, Riyazahamad Moulasab Shiraguppi, Prashant Sodhiya
  • Patent number: 9009407
    Abstract: In accordance with the present disclosure, a system and method for performing a system memory save in tiered or cached storage during transition to a decreased power state is disclosed. As disclosed herein, the system incorporating aspects of the present invention may include a flash or other nonvolatile memory such as a solid-state drive, volatile memory, and at least one alternate storage media. Upon transition to a decreased power state, at least some of the data in the solid-state drive, for example, may be transferred to the at least one alternate storage media. After the SSD data is transferred, data stored in volatile system memory, such as a system context, may be transferred to the SSD memory. With the system context saved in SSD memory, power to the volatile system memory may be turned off.
    Type: Grant
    Filed: March 29, 2011
    Date of Patent: April 14, 2015
    Assignee: Dell Products L.P.
    Inventors: William Sauber, Mukund P. Khatri
  • Patent number: 9009438
    Abstract: An approach to efficient space reclamation in multi-layered thinly provisioned systems. A parent storage volume is thinly provisioned, and uses one or more child storage volumes that are also thinly provisioned for storage. A reclamation command sent to the device providing the parent thinly provisioned storage volume identifies that data has been released, and that the physical storage storing that data can be placed in a free pool and used to satisfy future write requests in the parent storage volume. An identify module identifies which child storage volumes supporting the parent storage volume are thinly provisioned. The data is released at the level of the parent storage volume, and the reclamation command is sent to the child storage volumes supporting the parent storage volume and that are themselves thinly provisioned. The storage is thus released by all affected thinly provisioned storage volumes, and not just the parent storage volume that received the reclamation command.
    Type: Grant
    Filed: June 1, 2011
    Date of Patent: April 14, 2015
    Assignee: International Business Machines Corporation
    Inventors: Rahul M. Fiske, Carl E. Jones, Subhojit Roy
  • Patent number: 9003152
    Abstract: Methods, systems, and computer program products are provided for optimizing selection of files for eviction from a first storage pool to free up a predetermined amount of space in the first storage pool. A method includes analyzing an effective space occupied by each file of a plurality of files in the first storage pool, identifying, from the plurality of files, one or more data blocks making up a file to free up the predetermined amount of space based on the analysis of the effective space of each file of the plurality of files, selecting one or more of the plurality of files as one or more candidate files for eviction, based on the identified one or more data blocks, and evicting the one or more candidate files for eviction from the first storage pool to a second storage pool.
    Type: Grant
    Filed: November 5, 2013
    Date of Patent: April 7, 2015
    Assignee: International Business Machines Corporation
    Inventors: Duane M. Baldwin, Sandeep R. Patil, Riyazahamad M. Shiraguppi, Prashant Sodhiya
  • Patent number: 9003164
    Abstract: In one embodiment, the present invention includes a memory management unit (MMU) having entries to store virtual address to physical address translations, where each entry includes a location indicator to indicate whether a memory location for the corresponding entry is present in a local or remote memory. In this way, a common virtual memory space can be shared between the two memories, which may be separated by one or more non-coherent links. Other embodiments are described and claimed.
    Type: Grant
    Filed: March 21, 2014
    Date of Patent: April 7, 2015
    Assignee: Intel Corporation
    Inventors: Gautham N. Chinya, Hong Wang, Deepak A. Mathaikutty, Jamison D. Collins, Ethan Schuchman, James P. Held, Ajay V. Bhatt, Prashant Sethi, Stephen F. Whalley
  • Patent number: 9003151
    Abstract: Methods, systems, and computer program products are provided for optimizing selection of files for deletion from one or more data storage devices to free up a predetermined amount of space in the one or more data storage devices. A method includes analyzing an effective space occupied by each file of a plurality of files in the one or more data storage devices, identifying, from the plurality of files, one or more data blocks making up a file to free up the predetermined amount of space based on the analysis of the effective space of each file of the plurality of files, selecting one or more of the plurality of files as one or more candidate files for deletion, based on the identified one or more data blocks, and deleting the one or more candidate files for deletion from the one or more data storage devices.
    Type: Grant
    Filed: November 5, 2013
    Date of Patent: April 7, 2015
    Assignee: International Business Machines Corporation
    Inventors: Duane M. Baldwin, Sandeep R. Patil, Riyazahamad M. Shiraguppi, Prashant Sodhiya
  • Patent number: 9003154
    Abstract: A device requiring address allocation, a device system, and an address allocation method. A control device in the device system transmits currently allocated address information and a contention start signal to each device requiring address allocation in the device system through a bus, and the devices requiring address allocation with address allocation flag information being that no address information is allocated output an address contention signal. When outputting the address contention signal, each device requiring address allocation determines whether the currently allocated address information is available according to whether the other devices requiring address allocation with address allocation flag information being that no address information is allocated already output address contention signals.
    Type: Grant
    Filed: August 15, 2012
    Date of Patent: April 7, 2015
    Assignee: Montage Technology (Shanghai) Co., Ltd.
    Inventors: Chunyi Li, Qingjiang Ma
  • Patent number: 9003108
    Abstract: A data storage device includes a non-volatile memory that includes a three-dimensional (3D) memory. A controller of the data storage device is configured to store a first sequence of addresses based on a first sequence of read instructions received from a host device. Subsequent to storing the first sequence of addresses, the controller is configured to receive a second sequence of read instructions from the host device and to determine whether a second sequence of addresses that is based on the second sequence of read instructions matches the first sequence of addresses. The controller is configured to relocate at least one page of the non-volatile memory at least partially based on the second sequence of addresses matching the first sequence of addresses.
    Type: Grant
    Filed: May 22, 2014
    Date of Patent: April 7, 2015
    Assignee: Sandisk Technologies Inc.
    Inventor: Menahem Lasser
  • Patent number: 8990537
    Abstract: Disclosed herein are systems, methods, and non-transitory computer-readable storage media for managing free chains of compute resources. A system configured to practice the method divides a free chain of compute resources into a usable part (UP) which contains resources available for immediate allocation and an unusable part (UUP) which contains resources not available for immediate allocation but which become available after a certain minimum number of allocations. The system sorts resources in the UP by block number, and maintains a last used object (LUO) vector, indexed by block number, which records a last object in the UP for each block. Each time the system frees a resource, the system adds the freed resource to a tail of the UUP and promotes an oldest resource in the UUP to the UP. This approach can manage free chains in a manner that is both flaw tolerant and has relatively high performance.
    Type: Grant
    Filed: April 22, 2013
    Date of Patent: March 24, 2015
    Assignee: Avaya Inc.
    Inventor: John H. Meiners
  • Patent number: 8990536
    Abstract: A constrained computing device is provided. The constrained computing device includes a memory, a processor coupled to the memory, and a journaling component executed by the processor in kernel mode. The journaling component is configured to receive information descriptive of a device control, allocate, in the memory, a variable record structured according to a variable definition associated with the device control, store the information within the variable record, receive updated information descriptive of the device control, allocate, in the memory, an update record structured according to an update variable definition, store the updated information within the update record, and link the variable record to the update record.
    Type: Grant
    Filed: June 1, 2011
    Date of Patent: March 24, 2015
    Assignee: Schneider Electric IT Corporation
    Inventor: Sean White
  • Patent number: 8990487
    Abstract: A predetermined number of erasable blocks positioned at a start of a volume area in a semiconductor memory card are provided so as to include volume management information. A user area following the volume management information includes a plurality of clusters. A size of a partition control area from a master boot record & partition table sector to a partition boot sector is determined so that the plurality of clusters in the user area are not arranged so as to straddle erasable block boundaries. Since cluster boundaries and erasable block boundaries in the user area are aligned, there is no need to perform wasteful processing in which two erasable blocks are erased to rewrite one cluster.
    Type: Grant
    Filed: April 29, 2014
    Date of Patent: March 24, 2015
    Assignee: Panasonic Corporation
    Inventors: Takuji Maeda, Teruto Hirota
  • Patent number: 8977812
    Abstract: A method is used in iterating in parallel for deduplication. Based on an iteration scheme, a collection of sections is selected from a set of storage extents. Each section of the collection of sections includes subset of the contents of a storage extent of the set of storage extents. Based on the iteration scheme, each section of the collection of sections is arranged in an ordered arrangement. Based on the ordered arrangement, a deduplicating technique is applied in parallel to each section of the collection of sections.
    Type: Grant
    Filed: March 30, 2011
    Date of Patent: March 10, 2015
    Assignee: EMC Corporation
    Inventors: Xiangping Chen, Miles A. de Forest, Siyu Zhou, Samuel L. Mullis, Brian M. Spadafora, Li Wan
  • Patent number: 8977834
    Abstract: A method or system for determining storage location of an isolation region based on a data region sizing specified by a host device. In one implementation, the isolation region comprises a set of storage locations required for isolation of or more data region of the storage device.
    Type: Grant
    Filed: February 14, 2011
    Date of Patent: March 10, 2015
    Assignee: Seagate Technology LLC
    Inventor: Timothy Richard Feldman
  • Patent number: 8972684
    Abstract: A dispersed storage device manages deletion of data objects stored within a dispersed storage network by receiving a data delete request to delete a data object stored throughout a set of dispersed storage units within a dispersed network memory of the dispersed storage network, determining a deletion policy for the data object and selectively generating and transmitting, based on the deletion policy, a delete command to the set of dispersed storage units.
    Type: Grant
    Filed: September 12, 2013
    Date of Patent: March 3, 2015
    Assignee: Cleversafe, Inc.
    Inventors: Jason K. Resch, S. Christopher Gladwin, Andrew Baptist
  • Patent number: 8966206
    Abstract: A memory stores first configuration information indicating a plurality of logical storage areas and a first condition defining a state of a storage apparatus as a trigger for the storage apparatus to move data. A CPU acquires: a second condition defining a state of a computer as a trigger for the computer to move a first object, which is stored in a first logical storage area among the plurality of logical storage areas and performed by the computer, to another one of the plurality of logical storage areas; second configuration information associating the first object and the first logical storage area; first state information indicating a state of the plurality of logical storage areas; and second state information indicating a state of the first object. If a state of performing data movement is set, the CPU identifies a cause of the state of performing the data movement.
    Type: Grant
    Filed: May 7, 2012
    Date of Patent: February 24, 2015
    Assignee: Hitachi, Ltd.
    Inventors: Satoshi Kaneko, Tsukasa Shibayama, Yukinori Sakashita
  • Patent number: 8966212
    Abstract: It is provided a memory management method for releasing an unnecessary area in a memory area used by a program stored in the memory and executed by the computing device. The memory management method including the step of: setting in the memory, a first memory area which is used to execute the program; setting in the memory, a second memory area which can be operated by the program; setting a utilized area in the second memory area based on an instruction from the program; storing objects including data in the utilized area of the second memory area based on an instruction from the program; determining whether the program uses the objects stored in the utilized area within the second memory area; and releasing, by the computing device, the utilized area occupied by an object that is not used by the program among the objects stored in the utilized area.
    Type: Grant
    Filed: July 22, 2010
    Date of Patent: February 24, 2015
    Assignee: Hitachi, Ltd.
    Inventors: Masahiko Adachi, Hiroyasu Nishiyama, Motoki Obata
  • Patent number: 8959288
    Abstract: Cache lines are identified that provide incorrect data for read requests. The cache lines are invalidated before the incorrect data causes processing failure conditions. The cache lines providing incorrect data may be detected according to a number of the same read requests to the same cache lines. The cache lines may also be identified according to an amount of time between the same read requests to the same cache lines. The same read requests to the same cache lines may be identified according to associated start addresses and address lengths.
    Type: Grant
    Filed: August 3, 2010
    Date of Patent: February 17, 2015
    Assignee: Violin Memory, Inc.
    Inventors: Erik de la Iglesia, Som Sikdar, Sivaram Dommeti, Garry Knox
  • Patent number: 8958253
    Abstract: A method according to one embodiment includes determining to move an extent from a source-tier in a storage system to a destination-tier in the storage system; determining whether any track from the set of tracks is presently being written to; designating to a write-stack associated with the source-tier each track that is presently being written to and designating to a read-stack associated with the source-tier remaining tracks from the set of tracks; removing oldest tracks from the read-stack and the write-stack until the read-stack and the write-stack have been depleted of tracks; when a parameter of the extent exceeds a migration threshold: populating a destination-tier cache with the tracks as they are removed from the read-stack and the write-stack using a predetermined read-to-write ratio and removing tracks from a source-tier cache that were removed from the read-stack and the write-stack; and migrating the extent from the source-tier to the destination-tier.
    Type: Grant
    Filed: May 30, 2012
    Date of Patent: February 17, 2015
    Assignee: International Business Machines Corporation
    Inventors: David Montgomery, Todd C. Sorenson
  • Patent number: 8959296
    Abstract: Method and apparatus for centralized timestamp processing is described herein. A graphics processing system includes multiple graphics engines and a timestamp module. For each task, a graphics driver assigns the task to a graphics engine and writes a task command packet to a memory buffer associated with the graphics engine. The graphics driver also writes a timestamp command packet for each task to a timestamp module memory buffer. A command processor associated with the graphics engine signals the timestamp module memory buffer upon completion of the task. If the read pointer is at the appropriate position in the timestamp module memory buffer, the timestamp module/timestamp module memory buffer executes the timestamp command packet and writes the timestamp to a timestamp memory. The timestamp memory is accessible by the graphics driver.
    Type: Grant
    Filed: December 13, 2011
    Date of Patent: February 17, 2015
    Assignee: ATI Technologies ULC
    Inventor: Pat Truong
  • Patent number: 8959302
    Abstract: An exemplary computer system includes a server module including a first processor and first memory, a storage module including a second processor, a second memory and a storage device, and a transfer module. The transfer module retrieves a first transfer list including an address of a first storage area, which is set on the first memory for a read command, from the server module. The transfer module retrieves a second transfer list including an address of a second storage area in the second memory, in which data corresponding to the read command read from the storage device is stored temporarily, from the storage module. The transfer module sends the data corresponding to the read command in the second storage area to the first storage area by controlling the data transfer between the second storage area and the first storage area based on the first and second transfer lists.
    Type: Grant
    Filed: August 7, 2014
    Date of Patent: February 17, 2015
    Assignee: Hitachi, Ltd.
    Inventors: Yuki Kondoh, Isao Ohara
  • Patent number: 8954700
    Abstract: A method, and corresponding apparatus, of managing processing thread migrations within a plurality of memory clusters, includes embedding, in memory components of the plurality of memory clusters, instructions indicative of processing thread migrations; storing, in one or more memory components of a particular memory cluster among the plurality of memory clusters, data configured to designate the particular memory cluster as a sink memory cluster, the sink memory cluster preventing an incoming migrated processing thread from migrating out of the sink memory cluster; and processing one or more processing threads, in one or more of the plurality of memory clusters, in accordance with at least one of the embedded migration instructions and the data stored in the one or more memory components of the sink memory cluster.
    Type: Grant
    Filed: August 2, 2012
    Date of Patent: February 10, 2015
    Assignee: Cavium, Inc.
    Inventors: Najeeb I. Ansari, Gregg A. Bouchard, Rajan Goyal, Jeffrey A. Pangborn, Satyanarayana Lakshmipathi Billa
  • Patent number: 8954701
    Abstract: Memory is dynamically switched through the optical-switching fabric using at least one communication pattern to transfer memory space in the memory blades from one processor to an alternative processor in the processor blades without physically copying data in the memory to the processors. Various communication patterns for the dynamically switching are supported.
    Type: Grant
    Filed: March 6, 2013
    Date of Patent: February 10, 2015
    Assignee: International Business Machines Corporation
    Inventors: Eugen Schenfeld, Abhirup Chakraborty
  • Patent number: 8949564
    Abstract: A system includes storage devices for storing content along with two or more computing devices such as a two or more servers. One of the computing devices includes a staging memory that stores content that is received from the storage devices. The computing device also includes a user memory that is assigned to a user and stores content transferred from the staging memory. The user memory is accessible by the user while the staging memory is inaccessible by the user. The system also includes another computing device that has a content manager that initiates transferring of content from the storage devices to the staging memory and transferring content from the staging memory to the user memory for electronic publication of the content.
    Type: Grant
    Filed: August 6, 2008
    Date of Patent: February 3, 2015
    Assignee: Apple Inc.
    Inventors: Christopher Brooke Sharp, John S. Baumgarten
  • Patent number: 8949563
    Abstract: A first storage system copies data of a virtual area of a first virtual volume to a virtual area of a second virtual volume of a second storage system, monitors accesses with respect to multiple virtual areas of the first virtual volume, updates access information related to the accesses of the multiple virtual areas, and, based on the access information, reallocates data inside an actual area of a first pool allocated to the virtual area of the first virtual volume. The first storage system sends the access information to the second storage system. The second storage system receives the access information, and, based on the access information, reallocates data inside the actual area allocated to a virtual area of the second virtual volume.
    Type: Grant
    Filed: November 26, 2013
    Date of Patent: February 3, 2015
    Assignee: Hitachi, Ltd.
    Inventors: Naoki Futawatari, Yasutomo Yamamoto
  • Patent number: 8949525
    Abstract: A method of setting up a redistribution scheme for redistributing digital data packages within a digital data storage system comprising a plurality of nodes, wherein the data packages are associated with respective keys and are distributed among the nodes according to a first distribution configuration within the digital data storage system. The method includes: determining a second distribution configuration, in accordance with which it is intended to redistribute the data packages; applying a migration function to the respective keys of each of the data packages, which function yields a migration value associated with each of the data packages; and assigning a migration time to each of the data packages based on its associated migration value, at which times it is intended to migrate the respective data packages to conformity with the second distribution configuration. A corresponding digital data storage system is described.
    Type: Grant
    Filed: April 14, 2011
    Date of Patent: February 3, 2015
    Assignee: Spotify, AB
    Inventors: Fredrik Niemela, Matthias deZalenski, Gunnar Kreitz, Tommie Gannert, Peter Schuller
  • Patent number: 8943292
    Abstract: A method includes storing a first transaction entry to a first software configurable storage location, storing a second transaction entry to a second software configurable storage location, determining that a first transaction indicated by the first transaction entry has occurred, determining that a second transaction indicated by the second transaction entry has occurred subsequent to the first transaction, and, in response to determining that the first transaction occurred and the second transaction occurred, storing at least one transaction attribute captured during at least one clock cycle subsequent to the second transaction. The first and second software configurable storage locations may be located in a trace buffer, where the at least one transaction attribute is stored to the trace buffer and overwrites the first and second transaction attributes. Each transaction entry may include a dead cycle field, a consecutive transaction requirement field, and a last entry field.
    Type: Grant
    Filed: October 25, 2006
    Date of Patent: January 27, 2015
    Assignee: Freescale Semiconductor, Inc.
    Inventors: Ravindraraj Ramaraju, David R. Bearden, Prashant U. Kenkare
  • Patent number: 8943289
    Abstract: A method of moving a first portion of data and a second portion of data, which belong to one page data and respectively stored in a second physical page and a third physical page, into a first physical page in a flash memory module is provided. The method includes transmitting a read command for reading page data stored in the second physical page; reading the first portion of data from a buffer area of the rewritable non-volatile memory module into a buffer memory; transmitting a read command for reading page data stored in the third physical page; transmitting the first portion of data from the buffer memory to the buffer area; and transmitting a write command for writing data stored in the buffer area into the first physical page. Accordingly, the method can effectively move one page data dispersedly stored in different physical pages into one physical page.
    Type: Grant
    Filed: December 2, 2011
    Date of Patent: January 27, 2015
    Assignee: Phison Electronics Corp.
    Inventor: Chih-Kang Yeh
  • Patent number: 8943291
    Abstract: A solution for managing a software image being stored in a plurality of physical blocks of a storage system comprises monitoring each access to the physical blocks, calculating a predicted sequence of access to the physical blocks according to the monitored accesses, and reorganizing the physical blocks according to the predicted sequence. The monitoring may be performed as the physical blocks are accessed during the booting of virtual images on the software image.
    Type: Grant
    Filed: September 14, 2012
    Date of Patent: January 27, 2015
    Assignee: International Business Machines Corporation
    Inventors: Jacques Fontignie, Scot MacLellan, Claudio Marinelli, Paolo Scotton
  • Patent number: 8943266
    Abstract: The storage system includes a plurality of storage devices and a storage controller. The storage controller stores a data request quantity indicating the data quantity of write data written to the target area in a specific period, and estimates, based on the quantity of request data and relationship information received from storage devices, the estimated data quantity written to the nonvolatile semiconductor memory chips based on the write data written to the target area in the specific period. The storage controller selects a second logical storage area with an estimated data quantity less than an estimated data quantity for the first logical storage area and assigned to a storage device different from a storage device assigned to the first logical storage area, and migrates the first data stored in the first logical storage area to the second logical storage area.
    Type: Grant
    Filed: March 13, 2013
    Date of Patent: January 27, 2015
    Assignee: Hitachi, Ltd.
    Inventor: Hideyuki Koseki
  • Patent number: 8943262
    Abstract: A non-volatile memory device includes a first bank including a plurality of first page buffers, a second bank including a plurality of second page buffers, and an address counter configured to count a first address and a second address in response to a clock before a first time in a period for performing a read operation and count the first address and the second address in response to a bank address after the first time, wherein data of the first page buffers are sequentially outputted in response to the first address, and data of the second page buffers are sequentially outputted in response to the second address.
    Type: Grant
    Filed: December 1, 2011
    Date of Patent: January 27, 2015
    Assignee: Hynix Semiconductor Inc.
    Inventor: Min-Su Kim
  • Patent number: 8935487
    Abstract: The subject disclosure is directed towards a data deduplication technology in which a hash index service's index maintains a hash index in a secondary storage device such as a hard drive, along with a compact index table and look-ahead cache in RAM that operate to reduce the I/O to access the secondary storage device during deduplication operations. Also described is a session cache for maintaining data during a deduplication session, and encoding of a read-only compact index table for efficiency.
    Type: Grant
    Filed: December 28, 2010
    Date of Patent: January 13, 2015
    Assignee: Microsoft Corporation
    Inventors: Sudipta Sengupta, Biplob Debnath, Jin Li, Ronakkumar N. Desai, Paul Adrian Oltean
  • Patent number: 8930669
    Abstract: A method for managing memory in a system for an application, comprising: assigning a first block (i.e., a big block) of the memory to the application when the application is initiated, the first block having a first size, the first block being assigned to the application until the application is terminated; dividing the first block into second blocks (i.e., intermediate blocks), each second block having a same second size, a second block of the second blocks for containing data for one or more components of a single data structure to be accessed by one thread of the application at a time; and, dividing the second block into third blocks (i.e., small blocks), each third block having a same third size, a third block of the third blocks for containing data for a single component of the single data structure.
    Type: Grant
    Filed: June 7, 2013
    Date of Patent: January 6, 2015
    Assignee: Inetco Systems Limited
    Inventors: Thomas Bryan Rushworth, Angus Richard Telfer