Abstract: Trend estimation for application-agnostic statistical fault detection of multi-process applications in environments with data trend includes at least one of: a multi-process application runs on a host. Statistical events are collected and sent to a statistical fault detector. The statistical fault detector creates one or more distributions and compares recent statistical event data to historical statistical event data and uses deviation from historical norm for fault detection. Trend is estimated, and if needed, removed from event data prior to the creation of distributions. Trend is estimated using spectral techniques, filter banks and Maximum Entry Spectral Estimation, and dominant frequencies are estimated and utilized to adapt to the environment.

Abstract: A method of predicting GPU malfunctions includes installing a daemon program at a GPU node, the daemon program periodically collecting GPU status parameters corresponding to the GPU node at a pre-determined time period. The method also includes obtaining the GPU status parameters from the GPU node and comparing the obtained GPU status parameters with mean status fault parameters to determine whether the GPU is to malfunction, where the mean status fault parameters are obtained by use of a pre-configured statistical model. Prior to a GPU enters a malfunction state, the GPU can be replaced, or the programs executing on the GPU can be migrated to other GPUs for execution, without affecting the normal business operations.

Abstract: One or more processors acquire dependency metadata, where the dependency metadata is used for representing dependency on data among at least two components of an application. The processor(s) acquire error information and data output, where the error information is used for describing errors that occur while running the application, and where the data output includes data output by the at least two components while running the application. The processor(s) analyze, based on the error information, dependency metadata and data output relevant to the error information, where the analyzing includes determining, based on a null pointer exception in the error information and dependency metadata corresponding to the null pointer exception, that corresponding data has not been output by a component corresponding to the null pointer exception. The processor(s) then use an analysis result to improve the operation of a computer that is running the application.

Abstract: A system for mitigating operational impairment of a computer system includes a plurality of computing nodes. Each of the computing nodes includes a processor and memory coupled to the processor. The computing nodes are configured to: implement a plurality of computing devices; identify an impairment in operation of a first of the computing devices; execute a first remediation operation to mitigate the impairment; analyze operation of the first of the computing devices after execution of the first remediation operation to determine whether the first remediation operation is effective to mitigate the impairment; and change a frequency with which the first remediation operation is applied to mitigate the impairment based on whether the first remediation operation is deemed effective to mitigate the impairment.

Abstract: Embodiments include method, systems and computer program products for an interactive, multi-level failsafe capability. In some embodiments, a failed count indicative of a number of failed attempts to launch an application may be received. A failsafe mode level corresponding to the failed count may be determined. The failsafe mode level may be initialized in response to determining the failsafe mode level corresponding to the failed count. The failsafe mode level may determine the functionality that may be enabled. Users may perform interactive debugging by editing configuration settings and manually enabling functionality.

Abstract: Technology relating to configurable reliability schemes for memory devices is disclosed. The technology includes a memory controller that selectively controls at least a type or an extent of a reliability scheme for at least a portion of a memory device. The technology also includes a computing device that can dynamically select and employ reliability schemes from a collection of different reliability schemes. A reliability scheme may be selected on a per-process, per-allocation request, per-page, per-cache-line, or other basis. The reliability schemes may include use of parity, use of data mirroring, use of an error correction code (ECC), storage of data without redundancy, etc.

Abstract: Apparatus, systems, and methods to embed ECC data with cacheline data in a memory page are described. In one embodiment, an electronic device comprises a processor and a memory control logic to receive a request to read or write data to a memory device, wherein the data is mapped to a memory page comprising a plurality of cache lines, displace at least a portion of the plurality of cache lines to embed error correction code information with the data, and remap the portion of the plurality of cache lines to another memory location, and retrieve or store the data and the error correction code information on the memory page. Other embodiments are also disclosed and claimed.

Abstract: A method for distributed coding in a storage array is presented. The method includes dividing data into multiple stripes for storage in a storage array including storage devices with a topology of a hypercube of a dimension t?3. The storage devices in same hypercubes of dimension t?1 including the hypercube of a dimension t have even parity. Global parities are added to the hypercube such that a minimum distance of a code is enhanced.

Abstract: A method includes receiving, from a first user device, social media data for storage in the social media DSN. The method further includes dispersed storage error encoding the social media data in accordance with dispersed storage error encoding parameters to produce a plurality of sets of encoded data slices. The method further includes generating metadata regarding the social media data. The method further includes storing the sets of encoded data slices and the metadata as a full record. The method further includes generating a partial record of the social media data, wherein the partial record includes one or more of: the metadata, a summary of the social media data, and a link to the full record. The method further includes determining a group to which the first user device is affiliated. The method further includes providing the partial record to one or more other user devices affiliated with the group.

Abstract: A computing device includes an interface configured to interface and communicate with a dispersed storage network (DSN), a memory that stores operational instructions, and a processing module operably coupled to the interface and to the memory such that the processing module, when operable within the computing device based on the operational instructions, is configured to perform various operations. The computing device determines characteristic(s) of encoded data slices (EDSs) of a data object and determines a first estimated class for the EDSs based on the characteristic(s) of the EDSs of the data object. The computing device then selects storage locations within storage units (SUs) of the DSN for the EDSs to be distributedly stored based on the first estimated class and collects write and/or delete request analytics associated with the EDSs. Based on updated information regarding the analytics, the computing device may then update/move/change the storage locations of the EDSs.

Abstract: A controller device is configured to communicate with storage nodes of a distributed storage system (DSS) in which erasure codes are used to encode source data onto the storage nodes and ranks of matrices containing coding coefficients associated with the erasure codes indicate whether repairs of failed storage nodes of the DSS are feasible. A decomposition structure is generated to be used as a guide for transforming the matrices to upper triangle form (UTF) for use in computing the ranks of the matrices. While the DSS is operating to perform repairs of the failed storage nodes, as part of determining feasible repair strategies that will preserve subsequent repairs of failed storage nodes, the ranks of the matrices are computed by transforming the matrices to UTF using operations on the submatrices according to the decomposition structure.

Abstract: Embodiments of the present invention provide methods, systems, and program products for concurrent data retrieval from multiple loud storage devices. Embodiments of the present invention can be used to retrieve stripes of target data from at least a first network device, retrieve redundancy data of the target data from a second network storage device that is different from the first network storage device concurrently and reconstructing the target data based on the stripes of the target data and the redundancy data.

Abstract: A mechanism is provided in a data processing system. The mechanism determines a maximum queue depth of a queue for each solid state drive in a plurality of solid state drives. A given data block is mirrored between a group of solid state drives within the plurality of solid state drives. The mechanism tracks outstanding input/output operations in a queue for each of the plurality of solid state drives. For a given read operation to read the given data block, the mechanism identifies a solid state drive within the group of solid state drives based on a number of empty slots in the queue of each solid state drive within the group of solid state drives.

Abstract: A method begins by a dispersed storage (DS) processing module identifying an encoded slice requiring rebuilding. The method continues by the DS processing module determining whether the encoded data slice is part of a fan-out encoded data slice group and, when it is part of a fan-out encoded data slice group determining by the DS processing module whether a valid encoded data slice of the fan-out data slice group is available. When a copy of the encoded data slice of the fan-out encoded data slice group is not available, the method continues by the DS processing module rebuilding the encoded data slice. A storage unit then stores the rebuilt encoded data slice and creates copies of the rebuilt encoded data slice to produce a rebuilt fan-out encoded data slice group.

Abstract: Provided are a computer program product, system, and method for generating a chain of a plurality of write requests including a commit wait flag and plurality of write requests. The commit wait flag is set to one of an indicated first value or a second value. The commit wait flag is set to the first value to cause a storage server to process the write requests by requiring a current write request being processed to complete before transferring data for a next write request following the current write request. The commit wait flag is set to the second value to cause the storage server to process the write requests by transferring data for the next write request before completing the current write request preceding the next write request. The write request chain is sent to the storage server to apply the write requests to the storage.

Abstract: A computer-implemented method for enhancing electronic discovery searches may include (1) receiving a search query for at least one instance of a user being identified within a backup image of a volume of data, the search query being conducted for electronic discovery, (2) identifying metadata associated with the backup image specifying at least one action performed by the user on a computing system while the volume of data was mounted for use on the computing system, (3) performing the search query on the backup image and receiving a result of the search query in response to performing the search query, (4) enhancing the result of the search query with contextual information relating to the search query based on the metadata, the contextual information facilitating further electronic discovery, and (5) providing the enhanced result of the search query. Various other methods, systems, and computer-readable media are also disclosed.

Abstract: Aspects of the subject disclosure may include, for example, a method for A method, comprising enabling, by a system comprising a processor, a first modification of a first user profile at a secondary data repository of a communication network, wherein the first modification is directed by a first application operating at a first communication device of the communication network, identifying a usage event that is associated with the first communication device according to the first modification to the first user profile, and replicating a second modification to a second user profile at a primary data repository according to a change in operation of a second application associated with the usage event that is identified to the first communication device, where the replicating is according to an update policy for the primary data repository. Other embodiments are disclosed.

Abstract: A database system may maintain a plurality of log records at a distributed storage system. Each of the plurality of log records may be associated with a respective change to a data page. The plurality of log records may be transformed (e.g., cropped, prune, reduce, fused, deleted, merged, added, etc.).

Abstract: The logging of tasks associated with multiple transactions in the context in which the computing system is capable of having multiple of the transactions active at a given time, and thus in which the order of completion of the transactions is not guaranteed to be the same as the order of initiation of the transactions. A sequence of transaction segment records is added to the log. Each transaction segment record comprises a transaction identifier range that does not overlap with the transaction identifier range in any of the sequence of transaction segment records including the transaction identifier range of any neighboring transaction segment record in the sequence of transaction segment records. Each transaction segment record also includes a log entry identifier range extending from the first task of the first of the transactions to be initiated to the last task of the last transaction to complete.

Abstract: Tracking health of component in a computer system is disclosed. A health score for software components is determined for each of a plurality of time periods. The computing system determines a problem software component whose health score indicates the unhealthy status at a certain point in time. The computing system determines a set of software components that are linked by dependency relationships to the problem software component. The computing system tracks events at which software components in the set have a health score that went from the healthy status to the unhealthy status. The computing system rolls back in time through the events to locate a software component in the set that was first in time to have its health score go from the healthy status to the unhealthy status.

Abstract: The disclosed computer-implemented method for healing images in deduplication storage may include (i) detecting that a data segment stored within deduplication storage is corrupted by executing an algorithm on the data segment to generate a numerical identifier for the data segment and determining that the numerical identifier does not match a previously stored numerical identifier for the data segment, (ii) checking, during a backup operation, whether a digital fingerprint of a data segment of an image being backed up matches a digital fingerprint of the corrupted data segment that was taken prior to corruption and that is already stored within the deduplication storage, and (iii) appending the data segment from the image being backed up to a container that already contains the corrupted data segment rather than replacing the corrupted data segment. Various other methods, systems, and computer-readable media are also disclosed.

Abstract: Embodiments of the present invention provide a method, computer program product, and computer system for leveraging checkpoint restart. The method includes determining a first set of work stages within a first computation algorithm. A set of permissions associated with the first set of work stages are identified, and the work stages are stored as checkpoints in either a public location or a private location. Upon deployment of a second computation algorithm, a second set of work stages within the second computation algorithm is compared to the first set of work stages. If the second set of work stages match with the first set of work stages, the second computation algorithm is executed using the checkpoint associated with the matching work stages.

Abstract: A system and method thereof for performing loss-less migration of an application group. In an exemplary embodiment, the system may include a high-availability services module structured for execution in conjunction with an operating system, and one or more computer nodes of a distributed system upon which at least one independent application can be executed upon. The high-availability services module may be structured to be executable on the one or more computer nodes for loss-less migration of the one or more independent applications, and is operable to perform checkpointing of all state in a transport connection.

Abstract: Embodiments of the present invention provide a method, computer program product, and computer system for leveraging checkpoint restart. The method includes determining a first set of work stages within a first computation algorithm. A set of permissions associated with the first set of work stages are identified, and the work stages are stored as checkpoints in either a public location or a private location. Upon deployment of a second computation algorithm, a second set of work stages within the second computation algorithm is compared to the first set of work stages. If the second set of work stages match with the first set of work stages, the second computation algorithm is executed using the checkpoint associated with the matching work stages.

Abstract: Systems and methods to mirror data and otherwise manage memory are provided. A buffer may be coupled to a processor and be configured to write a first copy of data to a first memory located at a first server computer and a second copy of the data to a second memory that is accessible to both the first server computer and a second server computer. The buffer may be coupled directly to at least one of the first memory and the second memory via a memory bus, copper cable, or an optical cable. The buffer may write the first and the second copies of the data concurrently.

Abstract: A system to protect and reconfigure a computer network in case of advance warning of a disruption event that would disrupt the operation of the computer network is presented. The system comprises a main control system (MCS) that comprises a software system that makes continuous local backups of data nodes, maintains a plurality of remote backups, and maintains an ordered list of the remote backups. With the first warning of the disruption event, the MCS: 1) locks down some virtual servers at each remote backup and secures a selected remote backup; 2) determines the expected start and end time of the disruption event; 3) warns users about the disruption event; 4) uses the selected remote backup to provide a local copy of the data nodes; and 5) shuts down vulnerable critical systems. When the disruption event occurs, the MCS promotes the selected remote backup to be the primary data node.

Abstract: Various embodiments are generally directed to techniques for determining whether one node of a HA group is able to take over for another. An apparatus includes a model derivation component to derive a model correlating node usage level to node data propagation latency through and to node resource utilization from a first model of a first node of a storage cluster system and a second model of a second node of the storage cluster system, the first model based on a first usage level of the first node under a first usage type, and the second model based on a second usage level of the second node under a second usage type; and an analysis component to determine whether the first node is able to take over for the second node based on applying to the derived model a total usage level derived from the first and second usage levels.

Abstract: Methods, computing systems and computer program products implement embodiments of the present invention that include defining, for a computer system, one or more system tests, and performing each of the system tests on the computer system. Each of the system tests includes one or more system commands, and in some embodiments, a given system test may be performed by executing one or more system commands while the computer system simultaneously processes additional system commands that perform input/output operations. Upon detecting a failure of a given system command in a given system test to execute correctly, the computer system can be configured to suppress execution of the given system command. In some embodiments, the computer system includes a hypervisor controlling a virtual machine configured as a node of a software defined storage system, and the failure can be a disruption of the hypervisor or the virtual machine.

Abstract: A detailed execution schedule of self-diagnosis processing is set according to various requests. A self-diagnosis device includes a plurality of functional blocks, a storage unit that stores a plurality of processing units, each of which is an aggregate of some functional blocks selected from the plurality of functional blocks, and a start condition of self-diagnosis processing of each processing unit, and a self-diagnosis unit that selects the processing unit where the self-diagnosis processing is started based on the start condition of each processing unit and executes the self-diagnosis processing of each functional block in the selected processing unit.

Abstract: An electronic device has terminals for interfacing internal signals to other electronic devices. Each terminal is electrically coupled to a terminal driver and a terminal control circuit for receiving a terminal configuration defining the properties and multiplexing of the terminal. The actual configuration of the terminal driver is set according to the terminal configuration. The device has at least one terminal checker arranged for comparing the actual configuration to at least one check configuration, the check configuration defining a configuration of the terminal driver that is either allowed or not allowed, and for, when said comparing indicates a not allowed configuration, setting the actual configuration to a default configuration. Advantageously safe operation of the device in a system is achieved by monitoring the configuration of the multiplexed terminals, and switching to a default configuration when in error.

Abstract: Self-healing charging devices and techniques for identifying and/or troubleshooting causes of performance degradation in user devices are described. The self-healing charging devices described herein can leverage performance logs associated with user devices to identify problems on the user devices while the user devices are charging. Additionally or alternatively, the self-healing charging devices can leverage predictive models learned from a collection of data derived from a plurality of users associated with a network to identify usage and/or performance patterns for predicting issues that can arise based on usage patterns of the user of the user device. In some examples, the self-healing charging devices can be communicatively coupled to at least one network for offloading some of the processing.

Abstract: Systems, methods and computer program products assess processor performance metrics by monitoring probes constructed using instruction sequences. A first probe value can be determined from execution of a broad spectrum probe in an execution environment. In response to determining that the first probe value is not a first expected probe value, a targeted probe providing a second probe value directed to a subsystem of the execution environment, a feature of the subsystem, or a component of the execution environment is executed. In response to determining that the second probe value is not a second expected probe value, a differential between the second probe value and the second expected probe value can be used to determine that a bottleneck exists in at least one of the subsystem of the execution environment, the feature of the subsystem, or the component of the execution environment.

Abstract: Techniques for optimizing power and computational density of data centers are described. According to various embodiments, a benchmark test is performed by a computer data center system. Thereafter, transaction information and power consumption information associated with the performance of the benchmark test are accessed. A service efficiency metric value is then generated based on the transaction information and the power consumption information, the service efficiency metric value indicating a number of transactions executed via the computer data center system during a specific time period per unit of power consumed in executing the transactions during the specific time period. The generated service efficiency metric value is then compared to a target threshold value. Thereafter, a performance summary report indicating the generated service efficiency metric value, and indicating a result of the comparison of the generated service efficiency metric value to the target value, is generated.

Abstract: There is disclosed a method of monitoring an infrastructure comprising managed units, the method comprising the steps of: acquiring data associated with a first performance indicator from a first managed unit; determining a first quantized distribution function of at least a subset of pieces of data of the acquired data of the first managed unit; determining if the first quantized distribution function verifies one or a plurality of predefined rules describing particular distribution functions of performance indicators.

Abstract: An apparatus, system, and method are provided for evaluating database accesses. The apparatus may comprise a computer program that causes a computer system to exchange profiling data between a client application module and a database module; execute a database access; determine a database access policy violation at a detection point module; and selectively request context information from a context point module related to the database access.

Abstract: At least one application in a computing environment is executed and one or more performance metrics of the application are measured. The measured performance metrics are analyzed and an operational performance regression is detected. The detected operational performance regression is correlated with one or more recorded changes and the correlated changes are identified as a cause of the operational performance regression. The elements of the computing environment are alerted in accordance with the identified changes to adjust operational performance.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for dynamic sandboxing.

Abstract: Recording a replay-able trace of execution of an executable entity using cache data includes executing one or more threads of the executable entity concurrently across one or more processing units of the one or more processors. During execution of the one or more threads, a separate replay-able trace is recorded for each thread independently. Recording includes, for each thread, recording initial processor register state for the thread. Recording also includes, for each thread, and upon detecting a processor data cache miss, recording at least one line of cache data imported into the processor data cache.

Abstract: Recording a replay-able trace of execution of an executable entity using cache data includes executing one or more threads of the executable entity concurrently across one or more processing units of the one or more processors. During execution of the one or more threads, a separate replay-able trace is recorded for each thread independently. Recording includes, for each thread, recording initial processor register state for the thread. Recording also includes, for each thread, and upon detecting a processor data cache miss, recording at least one line of cache data imported into the processor data cache. Recording also includes recording the occurrence of at least one event by recording its side effects.

Abstract: Code block rating for guilty changelist identification and test script suggestion is discussed herein. An embodiment operates by assigning, by at least one processor, a respective code block rating to each code block of a plurality of code blocks; determining, by at least one processor, a change list rating for a change list, wherein the determining comprises: assigning, by at least one processor, a respective suspicious code block rating to each code block of the plurality of the code blocks modified by the change list, wherein the respective suspicious code block rating of a code block is based upon the respective code block rating of the code block, and calculating, by at least one processor, the change list rating based upon the respective code block ratings of each code block modified by the change list; and performing, by at least one processor, maintenance on the change list based upon the calculated change list rating.

Abstract: In a method of service emulation, a plurality of messages communicated between a system under test and a target system for emulation are recorded in a computer-readable memory. Ones of the messages are clustered to define a plurality of message clusters, and respective cluster prototypes are generated for the message clusters. The respective cluster prototypes include a commonality among the ones of the messages of the corresponding message clusters. One of the message clusters is identified as corresponding to a request from the system under test based on a comparison of the request with the respective cluster prototypes, and a response to the request for transmission to the system under test is generated based on the one of the message clusters that was identified. Related computer systems and computer program products are also discussed.

Abstract: A service oriented architecture (SOA) provides on-demand service call debugging and call stack tracing. The service call (e.g., an API) includes a new field and optional signature value. The field is a ‘debug-requested’ field, and the optional field is a unique call-id signature. The service provider can enable debugging in accordance with the debug-requested field for this service call, and tag all debugged data with the unique call-id. If it is necessary to call other services to fulfill the request, then the service can pass the ‘debug-requested’ field and the ‘unique id’ in the call to that service. Using this mechanism, detailed debugging can be supported across an entire stack for only those requests that need it and the performance/latency impact of having debugging enabled only applies to the subset of calls which need debugging.

Abstract: Embodiments of the present invention provide methods, systems, and computer program products for building an environment. Embodiments of the present invention can be used to allocate resources and build an environment such that the environment is built when a user is prepared to test one or more portions of code in the environment. Embodiments of the present invention can be used to reduce the “lag time” developers experience between waiting for the code to be built and for resources to be provisioned, and can also provide a less costly alternative to maintaining and operating dedicated environments.

Abstract: A device may obtain text to be processed to extract constraints corresponding to an object in the text. The constraints may define values permitted to be associated with the object. The device may extract the constraints based on identifying patterns in the text. The device may generate, based on the constraints, positive test data and negative test data for testing values for the object. The positive test data may include a first value that satisfies each of the constraints, and the negative test data may include a second value that violates at least one of the constraints. The device may provide information that identifies the positive test data and the negative test data.

Abstract: A method of holding information for identifying a cause for an object becoming problematic and presenting the information to a user. The method ascertains the cause of memory consumption by a program in a computer system. This method includes: acquiring a first call path related to the creation of an object from a memory; acquiring a second call path related to the connection to the object from the memory; and determining a common part of the acquired first and second call paths, wherein the common part indicates the cause in the program.

Abstract: The method includes capturing an execution scenario associated with a real-time execution of an application, determining at least one scenario variable based on the execution scenario, generating a test case based on a code template, the execution scenario and the at least one scenario variable, and updating a test suite using the test case, the test suite configured to define a quality test of the application.

Abstract: A method including measuring an initial precision measurement of at least one value of a number with a decimal point, measuring an infinite precision measurement of a value of the number with a decimal point, where a format of the number with a decimal point or of a primitive operation manipulating a number with a decimal point is first replaced with a predetermined optimal format. Additionally, manipulating, for at least one instruction, at least one number with a decimal point, including writing at least one variant performing the same function as the at least one instruction, and measuring, for each variant, at least one value of the at least one number with a decimal point obtained with the variant, and selecting the optimal variant as a function of the measured value and the initial precision and infinite precision values and replacing the at least one instruction with the selected variant.

Abstract: Methods, computer program products, and systems for managing memory in a computer system in which memory locations in use at any given time are represented as a set of memory objects in a first object graph. The first object graph includes a system root object associated by references to each of the memory objects. A method includes creating a second root object for the memory so as to form a second object graph for the memory. The method also includes, in response to the dereferencing of a first object from the first object graph, associating the dereferenced first object with the second object graph so that the second object graph includes at least one dereferenced object.

Abstract: For data management by a processor device in a computing storage environment, a threshold for an amount of Non Volatile Storage (NVS) space to be consumed by any particular logically contiguous storage space in the computing storage environment is established based on at least one of a Redundant Array of Independent Disks (RAID) type, a number of point-in-time copy source data segments in the logically contiguous storage space, and a storage classification. Establishing the threshold for the amount of NVS to be consumed based on the number of point-in-time copy source data segments in the logically contiguous storage space further includes considering resources needed to perform a Copy Source To Target (CST) operation required prior to the point-in-time copy source data segments being destaged.

Abstract: Provided are an apparatus and method for processing sequential writes to a block group of physical blocks in a memory device. Sequential write data for a plurality of consecutive logical addresses is received and a determination is made of consecutive physical blocks comprising a block group. Each of the physical blocks has data for a plurality of the consecutive logical addresses. The sequential write data is written to consecutive physical data locations having data for the determined consecutive physical blocks of the block group. The block group metadata for the block group is updated.