Abstract: A method and a system are provided for controlling deduplication in a storage pool. The method includes creating one or more deduplication domains within a storage pool, wherein storage volumes that are within a deduplication domain are deduplicated only with other volumes within the same deduplication domain and assigning storage volumes to a deduplication domain in order to control deduplication between storage volumes. The method may include, within a deduplication domain, blacklisting a volume from deduplication with a specified volume whilst allowing deduplication with other volumes in the deduplication domain.

Abstract: Method and system are provided for data validation during data recovery in a log-structure array (LSA) storage system. The method includes reading a log record of a recovery log for a logical address to obtain a physical address at a storage backend for the data at the time of the log record; reading reference metadata at the obtained physical address, wherein the reference metadata indicates the logical address that last wrote data to the physical address; validating that the physical address for the log record contains valid data for the logical address of the log record by comparing the logical address of the reference metadata to the logical address of the log record; and replaying the log record if the physical address is validated for recovery of virtual domain logical metadata mapping the logical address to the physical addresses of the log record.

Abstract: Method and system are provided for storage handling guidance for host input/output (I/O) operations. The method includes: providing a guidance array of indications of storage operations handling instructions, the guidance array having multiple dimensions of performance characteristics with each dimension having multiple levels; and associating a reference vector with one or more I/O operations, wherein the reference vector points to a level for each dimension of the array to obtain an indication of a storage operations handling instruction at an intercept of the dimension levels for application by a storage system controller for the one or more I/O operations.

Abstract: A method and a system for permanently deleting data from storage. The method includes receiving a wipe command to permanently delete a data segment stored in a storage system. The data segment includes an address to blocks where the data of the data segment is stored. The method also includes sanitizing the data segment, marking the address as sanitized, locating a last journal entry in a journal. The last journal entry includes metadata regarding the data segment. The method also includes sanitizing the last journal entry, traversing the journal, and sanitizing each journal entry of the data segment.

Abstract: A computer-implemented method according to one embodiment includes receiving, by a target system from a source system, a description of a set of data updates that are to be written to the target system. For each given portion of data of the target system that is to be rewritten during performance of the set of data updates, forward lookup is performed on the target system for determining a physical storage address of the given portion of data. The method further includes marking each of the determined physical storage addresses of the portions of data of the target system in a copy of a reverse lookup table of the target system. The marked-up reverse lookup table is used for determining an ordering in which the performance of the set of data updates would result in a least amount of garbage collection being performed while performing the set of data updates.

Abstract: A computer-implemented method of storing data on a storage device can receive an I/O request to read data from or write data to a data storage device. The data can be stored in special sectors as allocated sectors and regular sectors as a log-structured array (LSA). If the I/O request is to read data from the storage device, a determination can be made as to whether the data to be read is stored as a special sector, which can be read from the LSA, or as a regular sector, which can be can be read from the allocated sectors. If the I/O request is to write data to the storage device, a determination can be made as to whether the data to be written is stored as a special sector, to the LSA or as a regular sector, to the allocated sectors.

Abstract: Prioritizing virtual volumes to take offline in a thin provisioning system with garbage collection. The method categorizes virtual volumes based on garbage collection properties of their write behavior and adds metadata indicating a category of a virtual volume. The method schedules virtual volumes to be taken offline by predicting virtual volume space utilization of active virtual volumes for a defined time period in combination with estimated garbage collection in that period to determine a need to take virtual volumes offline. The method selects virtual volumes to take offline by their category to ensure that the virtual volumes producing the most garbage collection unfriendly workloads are taken offline first.

Abstract: A method and a system for permanently deleting data from storage. The method includes receiving a wipe command to permanently delete a data segment stored in a storage system. The data segment includes an address to blocks where the data of the data segment is stored. The method also includes sanitizing the data segment, marking the address as sanitized, locating a last journal entry in a journal. The last journal entry includes metadata regarding the data segment. The method also includes sanitizing the last journal entry, traversing the journal, and sanitizing each journal entry of the data segment.

Abstract: A computer-implemented method of storing data on a storage device can receive an I/O request to read data from or write data to a data storage device. The data can be stored in special sectors as allocated sectors and regular sectors as a log-structured array (LSA). If the I/O request is to read data from the storage device, a determination can be made as to whether the data to be read is stored as a special sector, which can be read from the LSA, or as a regular sector, which can be can be read from the allocated sectors. If the I/O request is to write data to the storage device, a determination can be made as to whether the data to be written is stored as a special sector, to the LSA or as a regular sector, to the allocated sectors.

Abstract: An apparatus for improved version updates in data deduplication includes a baseline module that stores a baseline referrer link in a first cohort of baseline referrer links pointing to a first location in storage where a baseline version data block is stored. The apparatus includes a signpost module that stores to metadata a signpost that points to an updated referrer link in a second cohort of updated referrer links that points to a second location in the deduplicating storage device where an updated version data block is stored in response to the updated version data block being generated. The apparatus includes a cohort update module that replaces the baseline referrer link with the updated referrer link in response to determining that an additional updated version data block matches the updated version data block pointed to by the signpost. A method and a system implement functions of the apparatus.

Abstract: The invention provides carbazole derivatives for the treatment of fibrotic diseases (pathological collagen deposition) in tissues and organs, and related symptoms, and conditions thereof.

Abstract: The invention provides carbazole derivatives for the treatment of fibrotic diseases (pathological collagen deposition) in tissues and organs, and related symptoms, and conditions thereof.

Abstract: Method, apparatus, and computer program product utilizing a hot-spare node in a storage network having a deduplication fingerprints database. A plurality of nodes is provided in the storage network including at least one active node and at least one hot-spare node. A portion of the deduplication fingerprints database is stored on each active node and on each hot-spare node. Data from the deduplication fingerprints database is provided from at least one of said at least one hot-spare node during normal operation. Responsive to a failure of one of said at least one active node, a portion of the deduplication fingerprints database associated with data stored on the failed one of said at least one active node is retained on one of the at least one hot-spare node. The failed one active node is replaced with one of the at least one hot-spare node.

Abstract: Links between data regions are intelligently formed, based on up-to-date popularity statistics, including a number of times a particular one of the data regions was a target for a potential link with another one of the data regions. An owner manages a popularity index incorporating the popularity statistics, where over time, the popularity index is subjected to an aging mechanism pursuant to a decaying algorithm. An owner one of the data regions decides whether to accept the one of the intelligently formed links based on at least one of a plurality of predetermined factors. If the one of the intelligently formed links is accepted by the owner one of the data regions, a potential referrer creates one of the data regions using one of the intelligently formed links. If the one of the intelligently formed links is rejected by the owner one of the data regions, data is written.

Abstract: A method for maintaining I/O statistics in a tiered storage environment includes maintaining, by a tiered storage layer within a storage system, I/O statistics for data storage elements or areas within the storage system. The tiered storage layer migrates data between storage tiers in accordance with the I/O statistics. A data services layer, that operates independently from the tiered storage layer, alters (e.g., compresses, decompresses) selected data within the storage system and generates a message to the tiered storage layer describing the alteration. The message identifies the selected data, how the selected data before the alteration maps to the selected data after the alteration, and an operator (e.g., percentage) to be applied to I/O statistics associated with the selected data as a result of the alteration The tiered storage layer receives this message and modifies its internal I/O statistics accordingly. A corresponding system and computer program product are also disclosed.

Abstract: A method and a computer system for maintaining synchronization between primary data stored in a primary volume and secondary data stored in a secondary volume. The primary volume and the secondary volume having respective address spaces divided into address blocks, each comprising a range of addresses. The computer system determines a start condition in which the secondary data has been checked as being a mirror of the primary data, transmits writes of the primary data that have occurred since the start condition to the secondary volume, and maintains an incremental record of current differences between the primary and secondary volumes on a per address block basis. The computer system operates a garbage collection algorithm on the secondary volume to clean up the address space.

Abstract: A method for replicating data from a primary site to a secondary site is disclosed. In one embodiment, such a method includes tracking, at a primary site, updates to storage elements of a primary volume over a specified period of time. The method further calculates a size associated with the updates and communicates the size from the primary site to a secondary site. At the secondary site, using the size received from the primary site, the method determines an amount of storage space required to accommodate the updates in a secondary volume. In certain embodiments, this may include taking into account compression or deduplication algorithms at the secondary site. The method allocates the storage space to the secondary volume and replicates, from the primary site to the secondary site, the updates to the secondary volume. A corresponding system and computer program product are also disclosed.

Abstract: A transistor structure is configured as a vertical type transistor. The transistor structure has a patterned electrode located between a gate electrode and a channel region of the transistor structure. The patterned electrode has one or more regions of discontinuity of the electrode. The patterned source electrode has at least two layers having at least a first and second barriers for injection of charge carriers into the channel region. The patterned electrode is configured such that a second layer having a second, higher, barrier for injection of charge carriers is configured to provide a physical barrier for flow of charge carriers from the electrode into the channel region.

Abstract: For efficient serialization of journal data using a processor device, serialization is combined with journaling of data into one data storage system on a write operation with subsequent consolidation for serialization of the journal data.

Abstract: A computer-implemented method of determining modified portions of a RAID storage array for use in resynchronizing said RAID storage array after a failure, the computer-implemented method comprising: resolving areas in the RAID storage array that represent space allocated to volumes; resolving which of said allocated volumes comprise gathered writes; and for said allocated volumes that comprise gathered writes, resolving a set of writes that potentially have incomplete parity updates at the time of the failure.