Abstract: Various examples of techniques for identifying a corrupt data lane and using a spare data lane are described herein. Some examples include a system of coordinating spare lane usage between link partners. One such example comprises analyzing data from a link partner to identify a corrupt lane, and communicating the corrupt lane to the link partner, wherein the communication does not require sideband communication channel. In some embodiments, communicating the corrupt lane to the link partner comprises identifying a transmit lane corresponding to the corrupt lane, transmitting a set of data intended for a corresponding transmit lane using a spare data lane, and transmitting bad data to the link partner using the corresponding transmit lane.

Abstract: Method, system, and networked embodiments for processing PDSE extended sharing violations are provided. A single special page referred to as a “sync” page is added to the PDSE dataset. The sync page is loaded from DASD to local cache at PDSE dataset open and remains open until the last close of the PDSE dataset. The in-core version of the sync page maintains a list of index update records for all computer systems within a sysplex and the on-DASD version of the sync page maintains a list of index update records for all computer systems connected to shared DASD.

Abstract: A system may include a processing unit executing program instructions (SW), a data acquisition (DAQ) hardware device for acquiring sample data and/or generating control signals, and host memory configured to store data samples and various data associated with the DAQ and processor operations. The DAQ device may push HW status information to host memory upon being triggered by predetermined events taking place in the DAQ device, e.g. timing events or interrupts, to avoid or reduce SW reads to the DAQ device. The DAQ device may update dedicated buffers in host memory with status data on any of these events. The status information pushed to memory may be read in a manner that allows detection of race conditions. Interrupts generated by the DAQ device may be similarly handled. Upon generating an interrupt, the DAQ device may gather information required to handle the interrupt, and push the information into system memory, along with information identifying the interrupt.

Abstract: Methods and devices for tracking data flows in a computing device include monitoring memory in a hardware component of the computing device to identify a read operation that reads information from a tainted memory address, using heuristics to identify a first, second, and third number of operations performed after the identified read operation, marking memory addresses of write operations performed after first number of operations and before the second number of operations as tainted, and marking memory addresses of write operations performed after the third number of operations and before the second number of operations as untainted.

Abstract: A method of operating a memory system includes receiving information data corresponding to a second program unit that is a part of a first program unit and a write request for the information data from a host; generating a codeword by performing error correction code (ECC) encoding on the received information data such that a partial parity bit corresponding to the information data among all parity bits of the codeword is updated; and providing a memory device with the generated codeword and a write command regarding the codeword.

Abstract: Methods and apparatus associated with storing data in high or low energy zones are described. Example apparatus include a data storage system (DSS) that protects a message using an erasure code (EC). A location in the DSS may have an energy efficiency rating or a latency. Example apparatus include circuits that produce EC encoded data that has a likelihood of use, that select a location to store the EC encoded data in the DSS based on the energy efficiency rating, the latency, or the likelihood of use, that store the EC encoded data in the location, and that compute an order of retrieval for EC encoded data stored in the location. The order of retrieval may be based on the energy efficiency rating or the latency. The EC encoded data may also have a priority based on the number of erasures for which the EC corrects.

Abstract: A read reclaim method of a storage device includes determining a number of page read reclaims based on degradation information in a read operation, and performing page read reclaim when a number of pages marked as read reclaim object reaches the number of page read reclaims.

Abstract: In various embodiments, an apparatus, system, and method may increase data integrity in a redundant storage system. In one embodiment, a request is received for data stored at a storage system having a plurality of storage elements, where one or more of the plurality of storage elements include parity information. A determination is made that one of the plurality of storage elements is unavailable, the unavailable storage element being a functional storage element and including at least a portion of the data. Responsive to the determination, the data is reconstructed based on at least a portion of the parity information and data from one or more of the plurality of storage elements other than the unavailable storage element; a response is provided to the request such that the response includes the reconstructed data.

Abstract: A charge constrained bit sequence is processed to obtain a lower bound on a number of bit errors associated with the charge constrained bit sequence. The lower bound is compared against an error correction capability threshold associated with an error correction decoder. In the event the lower bound is greater than or equal to the error correction decoder threshold, an error correction decoding failure is predicted.

Abstract: According to an embodiment, a semiconductor device includes an error corrector, a read controller, and a majority processor. The error corrector is configured to perform error correction on data read from a storage, and output the number of errors contained in the data when errors cannot be corrected by the error correction. The read controller is configured to read pieces of data from a first address in the storage according to respective read conditions, select, from the read conditions, a read condition corresponding to a smallest of the numbers of errors obtained by the error correction performed on the pieces of data corresponding to the respective read conditions, and perform reading from the first address multiple times according to the selected read condition. The majority processor is configured to perform a majority process between a plurality of pieces of data obtained by the multiple times of reading.

Abstract: A magazine-based data storage library is described that essentially provides a first tape cartridge adapted to retain first data and first metadata, a second tape cartridge adapted to retain second data and second metadata, a random access storage memory, such as a hard disk drive, whereon parity of the first data and the second data along with the first metadata and second metadata is retained. It is not required that the first data and the second data be written in parallel. The parity data on the random access storage memory is transferred to a parity tape, which can be used to reconstruct any data lost from either the first tape cartridge or the second tape cartridge.

Abstract: A method for storing data. The method includes receiving data to write to persistent storage, calculating parity values for a grid using the data, where each of the parity values is associated with one selected from of the Row Q Parity Group, the Row P Parity Group, the Column Q Parity Group, the Column P Parity Group, and the Intersection Parity Group. The method further includes writing the data to a data grid in the persistent storage, where the data grid is part of the grid, and writing the parity values for the grid to a portion of the grid, where the portion of the grid comprises physical locations associated with a Row Q Parity Group, a Row P Parity Group, a Column Q Parity Group, a Column P Parity Group, and an Intersection Parity Group, wherein the portion of the grid is distinct from the data grid.

Abstract: A method and system for service-aware parity placement in a storage system, including after receiving the service notification specifying a target SD: writing a RAID stripe to the persistent storage, where the parity block of the RAID stripe is stored on the target SD and none of the data blocks in the RAID stripe are stored on the target SD. The method further includes performing a modified garbage collection operation that includes identifying a live RAID stripe in the persistent storage, writing a new RAID stripe to a new location in the persistent storage, where the new RAID stripe includes a copy of at least a portion of data from the live RAID stripe and a parity block in the new RAID stripe is stored on the target SD, and issuing a removal notification when the modified garbage collection operation is completed.

Abstract: Example apparatus and methods produce a set of rateless erasure codes (e.g., fountain codes) for a file stored in a primary data store (e.g., hard drive) or in an archive system. The archive system may store the file in a redundant array of independent disks (RAID). A first subset of the rateless erasure codes are stored in an object storage using a synchronous protocol. A second subset of rateless erasure codes are stored in the object storage using an asynchronous protocol. The object storage system may inform the archive system when desired redundancy has been achieved or when desired redundancy has been lost. The archive system may buffer rateless erasure codes before providing the codes to the object storage to improve performance. A failure in the archive system or object storage system may be mitigated by retaining the file in the primary data store until the desired redundancy is achieved.

Abstract: Data reconstruction in a RAID storage system, by determining if a parity stripe has been reconstructed and if the parity stripe has been allocated, by the checking of a reconstruction/rebuild table and a space allocation table. Before reconstruction of a parity stripe occurs, the non-volatile memory of a failed hybrid drive is checked to determine if it is accessible and if so the data is copied to the new hybrid drive instead of reconstruction occurring.

Abstract: A method includes converting, by a first computing device of a DSN, a user virtual memory address of a data object identified in a data access request into a DSN virtual memory address. The method further includes processing, by at least one of the first computing device and a second computing device of the DSN, the DSN virtual address to determine that a first storage units of the storage units stores first encoded data slices of each set of at least some of the plurality of sets of encoded data slices; and a second storage units of the storage units stores second encoded data slices of each set of the at least some of the plurality of sets of encoded data slices. The method further includes converting, by the first storage unit, DSN virtual addresses of the first encoded data slices into physical addresses within the first storage unit.

Abstract: In a distributed computing system, cloning operations determine when each of multiple backup database instances most recently experienced an update. If a most recently updated backup database instance was updated within a prescribed time period of one or more other backup database instances, a source instance for cloning is deemed to be one of these database instances satisfying a prescribed proximity criteria relative to a designated database instance. If a difference in update times is greater than the prescribed time period for the two most recent backup database instances, the source instance for cloning is deemed to be the most recently updated backup database instance. The control center conducts cloning to a target instance using the selected backup database instance as a source instance.

Abstract: Various operations, functionalities and systems are described herein for backing up one or more node to an offsite location, restoring the one or more node from the offsite location, restoring the one or more node to a point-in-time (PIT) from the offsite location, cloning the one or more node from the offsite location, and cloning the one or more node to a PIT from the offsite location. Example operating contexts include one or more cluster of nodes running a NoSQL (Not only Structured Query Language) distributed database and backup, restore and/or cloning on those one or more cluster of nodes.

Abstract: Various operations, functionalities and systems are described herein for backing up one or more node to an offsite location, restoring the one or more node from the offsite location, restoring the one or more node to a point-in-time (PIT) from the offsite location, cloning the one or more node from the offsite location, and cloning the one or more node to a PIT from the offsite location. Example operating contexts include one or more cluster of nodes running a NoSQL (Not only Structured Query Language) distributed database and backup, restore and/or cloning on those one or more cluster of nodes.

Abstract: A computer system comprises a processor unit arranged to run a hypervisor running one or more virtual machines; a cache connected to the processor unit and comprising a plurality of cache rows, each cache row comprising a memory address, a cache line and an image modification flag; and a memory connected to the cache and arranged to store an image of at least one virtual machine. The processor unit is arranged to define a log in the memory and the cache further comprises a cache controller arranged to set the image modification flag for a cache line modified by a virtual machine being backed up, but not for a cache line modified by the hypervisor operating in privilege mode; periodically check the image modification flags; and write only the memory address of the flagged cache rows in the defined log.

Abstract: Methods, apparatus, and computer program products for modifying re-accommodations. A report characterizing execution of a re-accommodation may be stored in a report database. The report may include an impacted Passenger Name Record (PNR) table that associates each PNR impacted by the re-accommodation with an identifier. The identifier may identify an envelope in a history file comprising a portion of the history file that documents changes made to the PNR by the re-accommodation. In response to receiving a request to modify the re-accommodation, the report may be retrieved from the report database. PNRs impacted by the previous re-accommodation, and changes made to each PNR, may be determined using data in the impacted PNR table and the history files of the PNRs. The impacted PNR table may thereby enable building and execution of a modifying re-accommodation that selectively undoes or redoes a previously executed re-accommodation to implement new solutions to scheduling changes.

Abstract: A system and method to create a clone of a source computing system, the system including the steps of selecting a memory space coupled to the source computing system, retrieving uncoded data from the selected memory space, encoding the uncoded data by use of a bit-marker-based encoding process executing on a backup server, storing encoded data in a protected memory coupled to the backup server, wherein the protected memory is protected from a power interruption, retrieving the encoded data from the protected memory; and decoding the encoded data onto a target computing system, wherein the target computing system is separate from the source computing system.

Abstract: An image forming apparatus comprises a first and a second HDDs (Hard Disk Drives), a RAID (Redundant Arrays of Inexpensive Disks) controller to execute rebuilding processes in which data stored in the first HDD is copied to the second HDD restored, and a CPU (Central Processing Unit). When there arises the necessity for accessing from the CPU to at least of the first and the second HDDs, and the priority of data which is the object for access by the CPU is higher than the priority of data which is being processed under the rebuilding processes, the image forming apparatus stops the rebuilding processes. The image forming apparatus restarts the rebuilding processes, when the access from the CPU is finished.

Abstract: Methods, storage arrays and computer readable media for triggering a failover between an active controller and a standby controller of a storage array are provided. One method includes determining by the active controller a number of connected fabrics available between ports of the active controller and a host and determining by the standby controller a number of connected fabrics available between the ports of the standby controller and the host. The method further includes executing a policy configuration to determine if the number of connected fabrics for each of the active controller and the standby controller meet a threshold for triggering the failover. The failover being a forced failover where the active controller takes a role of the standby controller and the standby controller takes a role of the active controller.

Abstract: Implementations provide for automated container migration in a Platform-as-a-Service (PaaS) system. A method of the disclosure includes receiving, by a processing device executing a control server of a multi-tenant Platform-as-a-Service (PaaS) system, identification of a distressed node of the multi-tenant PaaS system and a resource under contention at the distressed node, providing, by the control server, identification of the resource under contention to the distressed node, receiving, by the control server, identification of a candidate container executing on the distressed node, wherein the candidate container contributes to the resource under contention on the distressed node and is launched from an instance of an application image corresponding to an application of the PaaS system, and sending, by the control server, the identification of the candidate container to a PaaS master component of the PaaS system and a request to migrate the candidate container from the distressed node.

Abstract: A mechanism is provided in a data processing system for unobtrusive failover in a clustered file system. A node in the clustered file system periodically monitors publicized resource events from a cluster manager in the clustered file system for a triggering event that triggers a grace period. Responsive to detecting a triggering event, the node enters a grace period without restarting. During the grace period, the node processes a state request from a first client.

Abstract: A debug circuit set in a host device includes a first USB interface, a USB communication unit, a UART communication unit, a detection unit and a switch unit. The USB communication unit is configured to communicate with other devices. The UART communication unit is configured to obtain debug information of the host device. The detection unit is configured to output a detection signal. The debug circuit communicates with other devices through the first USB interface when the switch unit connects the USB communication unit with the first USB interface. The debug circuit outputs the debug information through the first USB interface when the switch unit connects the UART communication unit with the first USB interface.

Abstract: A technique includes receiving a first signal from a first bus, and receiving a second signal from a second bus. The first and second buses are used for redundant communications. The technique includes interpreting the first and second signals to derive a bus data input signal for a controller based at least in part on detection of a predetermined bus fault.

Abstract: Performance of a computer system is measured based, at least in part, on a performance metric. In response to determining that the computer system is experiencing a performance issue based on measuring the performance, the performance metric is matched with an anti-pattern to identify a performance issue, wherein the anti-pattern defines an incorrect solution to a defined problem occurring in the computer system. Also, a pattern repository is queried to identify a pattern that defines a correct solution to the defined problem based, at least in part, on the match between the performance metric and the anti-pattern. In response to identifying the pattern, implementing the pattern in the computer system to improve the performance.

Abstract: Automatic correlation, in which an automatic correlation accelerator tool accesses at least a first and a second recording of a base script that defines operations executed in testing performance of a system. The tool causes the system to execute the first recording of the base script and the second recording of the base script and stores, in electronic storage, dynamic value data that describes dynamic values generated during execution of the first recording of the base script and during execution of the second recording of the base script. The tool automatically, without human intervention, analyzes the stored dynamic value data to identify candidates for correlation within the base script and generates a correlated script based on the identified candidates for correlation and the base script.

Abstract: An example method can include receiving network data related to a distributed system. A statistical model of the distributed system based on the network data can be employed to determine a statistical deviation of a given flow of information through a portion of the distributed system. A number of statistically deviated flows connected to the given flow can be determined based on a context of the distributed system. A determination can be made if the given flow is an anomaly based on the number of statistically deviated flows connected to the given flow.

Abstract: The embodiments provide an application diagnostics apparatus including an instrumentation engine configured to monitor one or more methods of a call chain of the application in response to a server request according to an instrumentation file specifying which methods are monitored and which methods are associated with a code extension, an extension determining unit configured to determine that at least one monitored method is associated with the code extension based on code extension identification information, a class loading unit configured to load the code extension from a resource file when the at least one monitored method associated with the code extension is called within the call chain, a code extension execution unit configured to execute one or more data collection processes, and a report generator configured to generate at least one report for display based on collected parameters.

Abstract: An example method for creating and operating a mobile application for an existing legacy system is provided in accordance with an aspect of the present disclosure. The method includes encapsulating a plurality of user interface (UI) automation scripts of an existing legacy system with an application programming interface (API) wrapper associated with a mobile application. In response to a call from the mobile application, the method further includes utilizing a selected one of the plurality of recorded UI automation scripts in the API wrapper to execute at least one action in the legacy system. The method also includes returning results from the at least one action in the legacy system to the mobile application.

Abstract: A debug device to more accurately compute current consumption or a current consumption quantity from a computer program to be executed in a mobile terminal when a computer program is debugged. The mobile terminal includes a terminal log information acquisition unit configured to acquire terminal log information indicating an operating state of hardware constituting the mobile terminal during debug execution and a current consumption computation unit configured to compute the current consumption or the current consumption quantity of the mobile terminal during debug execution on the basis of the terminal log information and computation information for computing the unique current consumption or the unique current consumption quantity from the operating state of the hardware which is pre-stored.

Abstract: A method identifies syntaxes of disparately syntaxed components of a message file. One or more processors receive a message at a computer, where the message comprises disparately syntaxed components. Processor(s) detect a selection of a selected component from the disparately syntaxed components. Processor(s) display a description of a syntax used by the selected component on a user interface, where the description of the syntax displayed on the user interface comprises a description of what each data element, within the selected component, represents. Processor(s) identify a set of leading characters for the selected component, where the set of leading characters for the selected component organizes the disparately syntaxed components according to their respective syntax rules.

Abstract: A computer-implemented method, computer program product, and system is provided for determining test case efficiency. In an implementation, a method may include determining each code unit executed by a test case in a test suite including a plurality of test cases, wherein a product-under-test includes a plurality of code units. The method may also include determining an execution time for the test case. The method may further include calculating an efficiency rating of the test case based upon, at least in part, a number of code units executed by the test case and the execution time for the test case.

Abstract: A method and system generate test cases for applications that include User Graphical Interfaces (GUIs). The system may extract GUI information from prototype requirements (e.g., interactive wireframes), generate a screen model for each screen of the GUI by using a subset of extracted GUI information, generate an application model representing the prototype requirements by combining the screen model for each screen, and generate test cases by using the sequence of the GUICs and the event types included in the test path and a semantic knowledge base. The semantic knowledge base is generated by using the relationships between GUICs and the GUIC events.

Abstract: A system and method for generating a file that includes a name that hashes directly to a request block is provided. The request block includes instructions describing how to generate or validate data corresponding to the request block. The system and method can further for a data manipulation program that executes in accordance with instructions of the request block.

Abstract: A system and method for generating a file that includes a name that hashes directly to a request block is provided. The request block includes instructions describing how to generate or validate data corresponding to the request block. The system and method can further for a data manipulation program that executes in accordance with instructions of the request block.

Abstract: A first execution plan for a first version of a structured query language statement can be requested from a database management system. The first execution plan for the first version of the structured query language statement can be loaded into a first directed graph tree structure comprising a plurality of nodes. The first directed graph tree structure can be scanned to determine whether a full table scan for accessing requested data is represented by at least a one of the plurality of nodes of the directed graph tree structure. Responsive to determining that the full table scan for accessing the requested data is represented by the at least one of the plurality of nodes of the directed graph tree structure, a first indicator that indicates a fault condition can be output.

Abstract: Embodiments of the invention relate to sparsity-driven matrix representation. In one embodiment, a sparsity of a matrix is determined and the sparsity is compared to a threshold. Computer memory is allocated to store the matrix in a first data structure format based on the sparsity being greater than the threshold.

Abstract: A memory system with a programming status is provided. The memory includes at least one first memory, at least one second memory and a controller. Each of the at least one first memory includes a plurality of memory regions to store data. Each of the at least one second memory includes a plurality of memory regions for programming the data from the at least one first memory. The controller is coupled to the second memory and utilized to record a programming status of the data. Whether the programming is successful or not is checked when the at least one first memory or the at least one second memory is going to be implemented by inquiring the programming status, and the at least one first memory stores the data until the programming is checked to be successful.

Abstract: The present disclosure provides a data storing method for writing update data into a flash memory module to replace original data. The flash memory module includes at least one block including a plurality of sectors. Each of the sectors records a flag. The data storing method includes: getting a first sector, wherein all the bits of the flag of the first sector are the second storage status; writing the update data into the first sector, and programming at least one bit as the first storage status and at least one bit as the second storage status in the flag of the first sector; identifying a second sector storing original data, wherein at least one bit of the flag of the second sector is first storage status and at least one other bit is second storage status; programming all the bits of the second sector as the first storage status.

Abstract: A host based caching technique may be used to determine caching policies for a hybrid hard disk drive. Because the host based caching may make use of knowledge about what data is being cached, improved performance may be achieved in some cases.

Abstract: An apparatus and method for processing unit reclaiming requests in a solid state memory device. The present invention provides a method of managing a memory which includes a set of units. The method includes selecting a unit from the set of units having plurality of subunits. The method further includes determining a number of valid subunits m to be relocated from the units selected for a batch operation where m is at least 2. The selecting is carried out by a unit reclaiming process.

Abstract: System and method for operating a solid state memory containing a memory space. The present invention provides a computerized system that includes a solid state memory having a memory space; a controller adapted to use a first portion of the memory space as a cache; and a garbage collector adapted to use a second portion of the memory space to collect garbage in the solid state memory. The controller is adapted to change a size of at least one of the first portion and the second portion of the memory space during operation of the solid state memory.

Abstract: A method for managing a multi-channel memory device includes at least following steps: when the multi-channel memory device is controlled to operate in an M-channel mode, reserving a partial memory space across N memory channels of the multi-channel memory device, where the reserved partial memory space is not used under the M-channel mode, M and N are positive integers, and M is smaller than N; and when the multi-channel memory device is controlled to switch from the M-channel mode to an N-channel mode, accessing data in the reserved partial memory space across the N memory channels used under the N-channel mode. The method for managing a multi-channel memory device can improve switch response time.

Abstract: Embodiments of the invention relate to receiving a write request that includes a write data and an address of a target block in tertiary storage. In response to the write request, a write-miss is detected at a cache located in persistent storage. Based on detecting the write-miss, the write data and associated metadata are written to a fast write storage location and the write request is marked as complete. In addition, the target block is retrieved from the address in the tertiary storage and stored in the cache. Contents of the fast write storage location are merged with the contents of the target block in the cache.

Abstract: A method for managing a cache memory of a storage system, the method may include storing a first retrieval metadata of a first data that is cached in the cache memory, in response to an expected or an actual occurrence of a cache memory consuming event; wherein the cache memory consuming event involves storing second data in the cache memory for a second caching period; replacing, in the cache memory, the first data by the second data; wherein the second caching period is a fraction of a first caching period associated with the first data; and evicting the second data from the cache memory and retrieving the first data to the cache memory in response to an actual or estimated end of the cache memory consuming event; wherein the retrieving of the first data involves retrieving the first data from a storage unit that differs from the cache memory while using the first retrieval metadata.

Abstract: A cache memory includes: a tag storage section in which one of a plurality of indexes, each index containing a plurality of tag addresses and one suspension-indicating section, is looked up by a first address portion of an accessed address; a data storage section; a tag control section configured to, when the suspension-indicating section contained in the looked-up index indicates suspension, allow access relevant to the accessed address to wait, and when the suspension-indicating section contained in the looked-up index indicates non-suspension, compare a second address portion different from the first address portion of the accessed address to each of the plurality of tag addresses contained in the looked-up index, and detects a tag address matched with the second address portion; and a data control section.