Abstract: A data encoding method includes storing K input data symbols; assigning the symbols to respective symbol locations in a notional square array, having n rows and n columns of locations, to define a plurality of k-symbol words in respective rows; encoding the words by encoding rows and columns of the array dependent on a product code having identical row and column codes, each being a reversible error-correction code of dimension k and length n=2n?, thereby to define a codeword, having n2 code symbols corresponding to respective locations of the array, of a quarter product code defined by CQ={X?XT?(X?XT)F: X?C} where X is an n by n-symbol matrix defining a codeword of the product code, XT is the transpose matrix of X, and (X?XT)F is a reflection of matrix (X?XT) in the anti-diagonal thereof.

Abstract: Embodiments of the present invention relate to an apparatus, method, and/or sequence for a distributed ECC that may be used in a storage system. In another embodiment of the invention, an apparatus for handling distributed error correction code (ECC) operations, includes: a plurality of ECC engines configured to perform ECC operations in parallel on multiple data parts; the plurality of ECC engines distributed in parallel to receive some of the multiple data parts that are read from storage media devices and to receive some of the other multiple data parts that are to be written to the storage media devices; and the plurality of ECC engines configured to use respective ECC bytes corresponding to respective ones of the multiple data parts.

Abstract: A data encoding method includes storing K input data symbols; assigning the symbols to respective symbol locations in a notional square array, having n rows and n columns of locations, to define a plurality of k-symbol words in respective rows; encoding the words by encoding rows and columns of the array dependent on a product code having identical row and column codes, each being a reversible error-correction code of dimension k and length n=2n?, thereby to define a codeword, having n2 code symbols corresponding to respective locations of the array, of a quarter product code defined by CQ={X?XT?(X?XT)F: X?C} where X is an n by n-symbol matrix defining a codeword of the product code, XT is the transpose matrix of X, and (X?XT)F is a reflection of matrix (X?XT) in the anti-diagonal thereof.

Abstract: In a backup method, a first controller of a storage system receives a file process request, and divides the file process request into a plurality of file operations. The first controller processes each of the file operations to generate multiple pieces of file operation information. And then, the first controller writes all of the multiple pieces of file operation information into a cache protected area. When the first controller fails, it stores the multiple pieces of file operation information to a disk protected area of a disk in the storage system. After the first controller is powered on again, the first controller copies the multiple pieces of file operation information from the disk protected area to the cache protected area. And then, it writes the file operation information into a write cache. At last, the first controller stores the file operation information into a disk of the storage system.

Abstract: Methods and systems for a copy-offload operation are provided. A soft range lock is placed for a data container for generating a token for a copy-offload operation for copying the data container from a source location to a destination location, where presence of the soft range lock indicates that content of the data container has not changed during the copy-offload operation. A token for the copy-offload operation represents the content of data container and includes information regarding the soft range lock. The token with the soft range lock information is provided to the client that requests the copy-offload operation. If the soft range lock exists, then the data container is copied without using a point in time copy of the data container.

Abstract: Systems and methods of writing to a storage system comprise analyzing a plurality of snapshots of data blocks of a storage device and determining a likelihood that a next first write will be to a respective data block based, at least in part, on the analyzed plurality of snapshots. A snapshot is then taken of a selected data block based, at least in part, on the respective likelihood for the selected data block, before receiving a write request to the selected data block. A write request to a respective data block is then received and data is written to the respective data block, if the snapshot of the respective data block had been taken. If the snapshot of the respective data block had not been taken, then a snapshot of the respective data block is taken. Then data is then written to the respective data block.

Abstract: A method, system, and program product is provided for splitting a clone object from a parent object when the clone object includes at least one snapshot. A mapping is created of a source data block from the parent object to a destination data block in the clone object. A creation generation in the mapped source data block is compared to an isolate generation in the destination data block in the clone object. Inherited data blocks in the clone object are isolated from the parent object, based on the creation generation differing from the isolate generation. The destination block is updated with the mapping information.

Abstract: A system and method is disclosed for performing agentless backup of a virtual machine using a temporary attached virtual disk. An example method includes creating a virtual machine disk in a datastore, loading a software application in the virtual machine disk, the software application being configured to collect metadata relating to at least one application executing in an operating system of the virtual machine, communicatively coupling the datastore to the virtual machine, collecting the metadata relating to the at least one application executing in the operating system of the virtual machine, generating a snapshot of the virtual machine, and storing a backup of the virtual machine in a backup archive based on the snapshot.

Abstract: Methods, systems, and apparatus for providing data storage services of a storage system are described. In one embodiment, a first file representing a first full backup including data and metadata describing the data is cached as a first segment tree having a plurality of layers of nodes in a tree hierarchy. A second file representing an incremental backup of the first full backup is cached as a second segment tree in the cache memory device. The second segment tree describes changes of the data and the metadata of the incremental backup in view of the data and the metadata of the first full backup without caching any of nodes of the first segment tree again. The first and second segment trees are collectively used to represent a second full backup based on the incremental backup and the first full backup.

Abstract: The capability to perform data backup and restore within a distributed database system environment is provided. The embodiments includes initiating a backup operation of a database distributed across a plurality of nodes, and coordinating synchronization of the backup operation within and among the plurality of nodes for parallel, local data dumping with transactional consistency to a single point in time.

Abstract: An illustrative approach to managing snapshots streamlines how and when snapshots are generated in a storage management system, such that fewer snapshots may be generated without diminishing the scope of data protection. A novel unified-snapshot storage policy may govern snapshots for any number of subclients. A unified-snapshot job based on the unified-snapshot storage policy enables the illustrative storage management system to automatically discover relevant components and generate at most one snapshot per target logical unit number (“LUN”) in a storage array. Each snapshot may comprise the data of any number of subclients and/or clients in the storage management system. Accordingly, one unified-snapshot job may yield a minimum but sufficient number of snapshots comprising data of all subclients associated with the governing unified-snapshot storage policy. An enhanced storage manager may manage the unified-snapshot jobs.

Abstract: A file stored in a volume on a client is backed up in a mountable format by creating on the client a template virtual volume that corresponds to the volume in which the file is stored. A set of file extents occupied by the file is identified. A file extent in a backup stream is identified. If the file extent is not within the set of file extents, the template virtual volume is accessed to backup a data block associated with the virtual volume. If the file extent is within the set of file extents, the file is accessed to backup a data block of the file.

Abstract: Systems and methods for reconstructing unified data in an electronic storage network are provided which may include the identification and use of metadata stored centrally within the system. The metadata may be generated by a group of storage operation cells during storage operations within the network. The unified metadata is used to reconstruct data throughout the storage operation cells that may be missing, deleted or corrupt.

Abstract: A method of arbitrating conflicting outputs in a redundant control system. Execution data of a task executed by each controller in the redundant control system is recorded. The execution data includes an initial timestamp of each execution stream, identification of critical functions in each execution stream, and parameter values used by the critical functions. A path executed by each controller is identified based only on the critical functions executed for each execution stream. The recorded execution data of each executed path is applied to an arbitration module. An output result from one of the respective controllers selecting, by an arbitration module, based on the recorded execution data of each executed path. The output result of the selected controller is communicated to a next module for further processing.

Abstract: A first compute node of a plurality of compute nodes of a database cluster may receive a request for a database transaction from a client application. The client application may be located within the first compute node. A first connection may be established, without regard to whether another compute node has a lighter workload than the first compute node, between the client application and a first database of the database cluster. The first connection may be a local connection, wherein the first database is located within the first compute node. The first compute node may detect that a failure associated with the first database has occurred. The first compute node may execute a failover operation to continue servicing the request for the data. The executing of a failover operation may include establishing a second connection between the client application and a second database of the database cluster.

Abstract: According to one aspect of the present invention, there is provided a method for performing storage control. Member storage media and a hot spare storage medium are identified in a storage system. The member storage media are members of a storage medium array, and the hot spare storage medium is for joining in the storage medium array when a member storage medium fails. Data on a member storage medium having a write amplification effect is migrated to the hot spare storage medium. In the member storage medium having a write amplification effect, an erase operation is performed on a storage medium where the migrated data is located. Embodiments of the present invention can alleviate adverse impact caused by a write amplification effect.

Abstract: For volume verification, an apparatus is disclosed. The apparatus includes a data mirror that generates volume pairs of first and second volumes by mirroring track data from first volumes stored by a first device to second volumes as mirrored track data stored by a second device. The apparatus includes an activity monitor that monitors update activities for volume pairs and identifies volume pairs having substantial residual counts of update activities as indicated by a pre-determined residual count threshold. The apparatus includes a data verifier that selects one or more identified volume pairs for evaluation, compares the track data in the first volume to the mirrored track data in the second volume, and if a match discrepancy is determined, then re-copies the track data from the first volume to the second volume so as to correct and repair the mirrored track data in the second volume.

Abstract: In one embodiment, a method of managing data includes storing a first copy of data in a solid state memory using a controller of the solid state memory, and storing a second copy of the data in a hard disk drive memory using the controller. Write requests are served substantially simultaneously at both the solid state memory and the hard disk drive memory under control of the controller. In another embodiment, a system for storing data includes a solid state memory, at least one hard disk drive memory, and a controller for controlling storage of data in both the solid state memory and the hard disk drive memory. Other methods, systems, and computer program products are also described according to various embodiments.

Abstract: One or more techniques and/or computing devices are provided for communicating storage controller failures utilizing service processor traps. A first storage controller, of a first storage cluster, has a disaster recovery relationship with a second storage controller of a second storage cluster. The first storage controller comprise a first service processor configured to monitor health of the first storage controller. Responsive to identifying a failure of the first storage controller, the first service processor uses stored communication configuration of a second service processor of the second storage controller to send a service processor trap to the second service processor. In this way, the second service processor initiates a switchover operation by the second storage controller to provide clients with failover access to data previously available through the first storage controller before the failure.

Abstract: A method, system, and computer program product for managing performance of an application I/O comprising determining paths from a first host to a node in a cluster that are flaky; and initiating a failover mechanism for the application I/O from the node in the cluster to a second node in the cluster ensuring seamless execution of the application I/O in the cluster.

Abstract: An integrated circuit (IC) includes addressable blocks of memory, and at least one redundant block of memory. A block of memory includes two or more chunks of memory. The IC also includes redundancy control cells. Control circuitry is included to access a first chunk of a redundant block of memory in place of a first remapped chunk one of the addressable blocks of memory, and a second chunk of a redundant block of memory in place of a second remapped chunk one of the addressable blocks of memory, based on the redundancy control cells.

Abstract: Various aspects describe an on-chip, hardware error-generator component. In some cases, the hardware error-generator component connects to a data path between two components contained within a same chip. Upon receiving an error simulation input, the hardware error-generator component modifies data being transmitted on the data path by inserting a data pattern that simulates an error condition. Alternately or additionally, the hardware error-generator randomly alters one or more of the transmitted data bits.

Abstract: Examples provide a fault tolerant virtual machine (VM) using pooled memory. When fault tolerance is enabled for a VM, a primary VM is created on a first host in a server cluster. A secondary VM is created on a second host in the server cluster. Memory for the VMs is maintained on a shared partition in pooled memory. The pooled memory is accessible to all hosts in the cluster. The primary VM has read and write access to the VM memory in the pooled memory. The secondary VM has read-only access to the VM memory. If the second host fails, a new secondary VM is created on another host in the cluster. If the first host fails, the secondary VM becomes the new primary VM and a new secondary VM is created on another host in the cluster.

Abstract: A system and method allows users to provide portions of scripts or scripts for retrieval of information from one or more web sites of one or more businesses by demonstrating operation of the one or more web sites and identifying locations of one or more fields on each web page of the one or more web sites, and the system and method stores the scripts and uses the scripts to retrieve information from such web site or web sites for any number of users. Different portions of different scripts may be used as a single script to retrieve information from a single web site. Scripts or portions of scripts may be repaired using information from previously working scripts or portions, the web site when the script or portion worked, and the web site when the script or portion did not work.

Abstract: Cloud computing benchmarking is performed wherein the resource usage of a measuring benchmarking application is compensated for as to not impact measurement. The measurements are of a cloud instance's benchmarking indicia which may include performance, functions and characteristics of the cloud instance. The benchmarking indicia use scalable measures as to allow the use of arithmetic operations such as those used in statistical functions. The benchmarking application is dispatched along with a configuration file and is controlled from a central controller to specified cloud instances. The dispatched benchmarking application takes measurements of the cloud instance based on the configuration file. The benchmarking application then stores the measurements in a results file for return back to the central controller. At the central controller, results files from one or more benchmarking applications are stored in a data store for comparative and statistical analysis.

Abstract: In one implementation, a system for user action duration includes a monitor engine to monitor a number of async operations to be loaded on a user interface, a detection engine to determine a repeating async operation from the number of async operations that has a pattern of repeating timeouts, a removal engine to remove the repeating async operation from the number of async operations, and a calculation engine to calculate a total time for the remaining number of async operations based on a total timeout of each of the remaining number of async operations.

Abstract: This disclosure is directed to automated methods and systems for calculating hard thresholds used to monitor time-series data generated by data-generating entity. The methods are based on determining a cumulative distribution that characterizes the probability that data values of time-series data generated by the data-generating entity violate a hard threshold. The hard threshold is calculated as an inverse of the cumulative distribution based on a user defined risk confidence level. The hard threshold may then be used to generate alerts when time-series data generated later by the data-generating entity violate the hard threshold.

Abstract: A method, apparatus and program product utilize a flight recorder having active error detection functionality to proactively detect errors in a computer or a sub-system or component thereof. The active error detection may be based on one or more trends detected in the trace data logged by the flight recorder and reflective of particular types of errors that may be present in a computer during operation, such that an error may be logged, and in some instances, an exception may be triggered.

Abstract: The performance of computer system responses to user requests is measured and evaluated in the context of physical computing resource operation. Diagnostic information related to computer system performance is selectively provided based the measured performance and physical computing resource operation.

Abstract: Embodiments of the invention may provide for collecting specified data each time that a call to a given method occurs, wherein a given call to the given method is associated with a set of arguments comprising one or more particular argument values for the given method, and the collected data includes an element uniquely identifying each of the particular argument values. The process may further include storing the collected data at a selected location, and selecting a call threshold for the given method, wherein the call threshold comprises a specified number of occurrences of the given call to the given method, when the program is running. The collected data may be selectively analyzed at the storage location, to determine whether an occurrence of the given call to the given method has exceeded the call threshold.

Abstract: A method includes, with a hypervisor, receiving a first request from a guest to write a first piece of data to a first memory location within a kernel code page. The method further includes determining that the first request triggers a violation based on a kernel protection mechanism, and in response to determining that the first request triggers the violation, determining that the first piece of data includes a breakpoint. The method further includes, in response to determining that the first piece of data includes the breakpoint, copying a second piece of data currently stored at the first memory location to a second memory location within non-guest writeable memory and overwriting the first memory location with the first piece of data.

Abstract: A processor includes an innovation engine, a non-volatile memory, a reserved device, one or more user-defined devices, and logic to execute the user-defined devices. The processor also includes a debug engine with logic to monitor the processor for trigger conditions and record data associated with the trigger conditions. The innovation further includes logic to selectively load the debug engine.

Abstract: A method and apparatus for testing application software for installation on hardware platforms. A software tool is qualified using a tool qualifier module running on a first virtual computer system having a configuration that comprises a processor of first processor type and a first virtual machine emulating a processor of second processor type. A benchmark performance is established for the first virtual machine. A second virtual computer system has a configuration that comprises a processor of third type and a second virtual machine emulating the processor of the second processor type. The second virtual machine is verified using a qualifier module to determine whether its performance is consistent with the benchmark performance to form a qualified second virtual machine. After the tool has been qualified, the tool is transferred from the first virtual machine to the qualified second virtual machine without needing to be requalified.

Abstract: Mechanisms are provided for evaluating test cases for testing a software product based on a requirements change. The mechanisms analyze a test case corpus to identify a plurality of first relationships between elements of test cases in the test case corpus and generate a test case relationship model based on the identified plurality of first relationships. The mechanisms receive a proposed requirements change to change one or more requirements of the software product and then perform a search of the test case relationship model to identify test case relationships corresponding to the proposed requirements change. The mechanisms identify a subset of test cases affected by the proposed requirements change and generate an output specifying the identified subset of test cases.

Abstract: Embodiments of the present invention provide methods, computer program products, and systems to increase code coverage. Embodiments of the present invention can receive a copy of source code and data associated with a sample execution of a set of instructions specified by the copy of the source code. Embodiments of the present invention can insert, into the set of instructions specified by the copy of the source code, an instruction that corresponds to a code statement that precedes an untraversed code path within the received copy of the source code. Embodiments of the present invention can execute the set of instructions that include the inserted instruction and provide an option to redirect execution of the set of instructions at the inserted instruction. Embodiments of the present invention can generate a test case that increases code coverage based on the redirected execution of the set of instructions.

Abstract: A method and a system to create a software test environment on demand are described. An example system includes a dependency module to, upon receiving a command identifying a primary function to be created in a test environment, identify one or more dependencies of the primary function. The dependencies are other functions or databases that the primary function depends upon. The dependency module generates a topology of the test environment that indicates the relationship of the dependencies to the primary function. A provisioning module provisions a plurality of pools based on the topology. An enterprise service bus (ESB) routing module updates ESB routing of the primary function to route to the plurality of pools in the test environment. A credentials module provides credentials of the pools in the test environment.

Abstract: A technique relates testing an application under test using (AUT) testing. The testing software creates a testcase by executing the AUT under normal usage, and normal usage is defined as operating the AUT for its intended purpose. The normal usage is not part of the testing. Creating the testcase includes capturing artifacts related to running the AUT under the normal usage, and the artifacts include an input artifact to the AUT and an output artifact resulting from executing the AUT. Also, the testcase is executed by re-executing the AUT using the input artifact previously captured in the artifacts of the testcase in order to obtain a new output artifact. The testing software verifies the new output artifact resulting from execution of the testcase by comparing the output artifact previously captured in the artifacts from executing the AUT under the normal usage to the new output artifact from executing the testcase.

Abstract: Address-based thresholds for freemained frames are used to determine retention actions. Based, at least in part, on a comparison of a number of freemained frames for an address space against a threshold of freemained frames for the address space, freemained frames can be retained or rejected and/or the threshold can be adjusted.

Abstract: The inventive concept relates to a user system including a solid state disk. The user system may include a main memory for storing data processed by a central processing unit; and a solid state disk for storing the selected data among data stored in the main memory. The main memory and the solid state disk form a single memory hierarchy. Thus, the user system of the inventive concept can rapidly process data.

Abstract: Systems and methods are disclosed for efficient buffering for a system having non-volatile memory (“NVM”). In some embodiments, a control circuitry of a system can use heuristics to determine whether to perform buffering of one or more write commands received from a file system. In other embodiments, the control circuitry can minimize read energy and buffering overhead by efficiently re-ordering write commands in a queue along page-aligned boundaries of a buffer. In further embodiments, the control circuitry can optimally combine write commands from a buffer with write commands from a queue. After combining the commands, the control circuitry can dispatch the commands in a single transaction.

Abstract: A non-volatile memory is arranged to have a plurality of sectors. Each sector of the plurality of sectors includes a plurality of record locations. A memory controller includes an erase counter, a failed sector flag, and a retired sector flag for each of the plurality of sectors. If a record location of a sector fails to program, another location in the sector is selected to be programmed. The failed sector flag is set if a predetermined number of selected record locations of the sector fails to program. If the failed sector flag is set for a particular sector twice, and an erase count is greater than a predetermined erase count, then the retired sector flag is set for the failed sector indicating the sector is to be permanently retired from use. A new sector of the plurality of sectors becomes the current active sector for record programming operations. The method for retiring a sector occurs dynamically, during operation of the non-volatile memory.

Abstract: Software for reclaiming a sequential storage medium that includes: copying all active data blocks in a first part of sequentially written data on a first sequential storage medium, to a second sequential storage medium, the first part extending from a first intermediate position to an end of the sequentially written data; and defining all data blocks in a second part of the sequentially written data on the first sequential storage medium, to be a new sequentially written data, the second part extending from a beginning to a second intermediate position of the sequentially written data, and excluding the active data blocks copied to the second sequential storage medium.

Abstract: A method of operating a storage device according to an exemplary embodiment includes receiving a first target value and a second target value of a plurality of target values respectively corresponding to a first operating parameter and a second operating parameter of a plurality of target values of operating parameters from a host, loading a first existing value and a second existing value of a plurality of existing values of the first operating parameter and the second operating parameter, processing a machine learning algorithm using the first target value, the second target value, the first existing value and the second existing value to generate an adaptive schedule, and executing the background operation based on the schedule.

Abstract: A method for storing data on a storage device includes receiving data to be stored and a logical address for storing the data. A physical address is determined and the data to be stored is stored at the determined physical address. A table that associates logical addresses with physical addresses is examined to determine a difference relationship between the determined physical address and a corresponding physical address for one of other logical addresses. Information representing the determined physical address is stored in the table, in association with the received logical address, as a function of the determined difference relationship. A data storage device includes controller circuitry and memory for storing a lookup table that associates logical addresses with physical addresses. The controller circuitry operates in accordance with the method.

Abstract: The present invention provides a data storage device that includes a flash memory and a controller. The flash memory has a plurality of blocks, and each of the blocks has a plurality of pages arranged sequentially along a first direction. The controller determines whether an X-th page of a temporary block of the blocks can be successfully read when the data storage device resumes operation after a power-off event, and writes dummy data and a temporary-block table into the (X+1)-th page of the temporary block when the X-th page can be successfully read, wherein the X-th page is the page that was read last from the temporary block before the power-off event occurred, the temporary-block table records the information of all the pages in the temporary block, and X is a positive integer.

Abstract: Provided are a computer program product, system, and method for determining the location for volumes of data being initially stored within a storage space, regardless of the physical location of the data. The storage space includes stripes composed of volumes, which can be logically represented as a utilization histogram of stripe locations offset from one another. Sometime the stripes are fully allocated with one large volume or partially allocated with multiple, arbitrary-sized smaller volumes. When there are multiple smaller volumes that do not utilize all of the available stripe space, gaps form. To minimize the creation of such gaps, when a volume of data is initially stored, a start location to place the volume of data is selected by using selection criteria as guidance.

Abstract: Managing a cache includes determining from metadata of a received service request whether a cache data response may satisfy the request as a function of recognizing a cacheable method name specification within request metadata by a service provider associated with the request, and determining whether the request is an inquiry in order to decide if the request may be satisfied by the cached data. Aspects also include searching the cache for the data response if determined the data is cacheable and the request is an inquiry, and sending the request on to a service provider if the data response is not a cacheable response, or the request is an update request.

Abstract: Methods and apparatus for supporting cached volumes at storage gateways are disclosed. A storage gateway appliance is configured to cache at least a portion of a storage object of a remote storage service at local storage devices. In response to a client's write request, directed to at least a portion of a data chunk of the storage object, the appliance stores a data modification indicated in the write request at a storage device, and asynchronously uploads the modification to the storage service. In response to a client's read request, directed to a different portion of the data chunk, the appliance downloads the requested data from the storage service to the storage device, and provides the requested data to the client.

Abstract: Techniques and mechanisms to efficiently cache data based on compression of such data. The technologies of the present disclosure include cache systems, methods, and computer readable media to support operations performed with data that is compressed prior to being written as a cache line in a cache memory. In some embodiments, a cache controller determines the size of compressed data to be stored as a cache line. The cache controller identifies a logical block address (LBA) range to cache the compressed data, where such identifying is based on the size of the compressed data and on reference information describing multiple LBA ranges of the cache memory. One or more such LBA ranges are of different respective sizes. In other embodiments, LBA ranges of the cache memory concurrently store respective compressed cache lines, wherein the LBA ranges and are of different respective sizes.

Abstract: Some embodiments provide a physical forwarding element that dynamically adjusts the number of flows allowed in a flow table cache. In adjusting, the physical forwarding element initially sets the maximum number of flows allowed in the cache. From the flow table cache, the physical forwarding then iterates through the set maximum number of flows and records the length of time it took to iterate through the flows. Based on the duration, the physical forwarding element then automatically adjusts the size of the flow table cache by increasing or decreasing the number of flows allowed in the cache. Alternatively, the physical forwarding element may choose to keep the cache size the same based on the duration.