Abstract: A system comprising: a first subsystem comprising one or more first processors, and a second subsystem comprising one or more second processors. The second subsystem is configured to process code over a series of steps delineated by barrier synchronizations, and in a current step, to send a descriptor to the first subsystem specifying a value of each of one or more parameters of each of one or more interactions that the second subsystem is programmed to perform with the first subsystem via an inter-processor interconnect in a subsequent step. The first subsystem is configured to execute a portion of code to perform one or more preparatory operations, based on the specified values of at least one of the one or more parameters of each interaction as specified by the descriptor, to prepare for said one or more interactions prior to the barrier synchronization leading into the subsequent phase.

Abstract: A concurrency-restricting lock may divide a set of threads waiting to acquire the lock into an active circulating set (ACS) that contends for the lock, and a passive set (PS) that awaits an opportunity to contend for the lock. The lock, which may include multiple constituent lock types, lists, or queues, may be unfair over the short term, but improve throughput of the underlying multithreaded application. Culling and long-term fairness policies may be applied to the lock to move excess threads from the ACS to the PS or promote threads from the PS to the ACS. These policies may constraint the size or distribution of threads in the ACS (which may be NUMA-aware). A waiting policy may avoid aggressive promotion from the PS to the ACS, and a short-term fairness policy may move a thread from the tail of a list or queue to its head.

Abstract: The present invention generally relates to a system and method to enhance functionality of an executable application in a computer system in which application program interfaces associated with one or more executable applications are hooked to modified application program interfaces to provide increased functionality.

Abstract: Systems and methods for managing Application Programming Interfaces (APIs) are disclosed. For example, the system may include one or more memory units storing instructions and one or more processors configured to execute the instructions to perform operations. The operations may include receiving a call to an API node. The operations may include determining that the call is associated with the first version of the API. The operations may include determining that the API node is associated with a second version of the API. The operations may include translating the call into a translated call using a translation model, the translated call being associated with the second version of the API.

Abstract: Methods, systems, and computer-readable storage media for detecting and managing events from data of an Internet-of-Things (IoT) network, and actions can include receiving a first call from a first application, the first call including timeseries data from one or more IoT devices in a first IoT network, retrieving a rule set for processing the timeseries data, and determining that an anomaly is represented in the timeseries data based on the rule set, and in response, generating an event, the event having a configuration that is customized by an enterprise associated with the first application, executing an event workflow to transition the event between states, and transmitting an event response to the first application.

Abstract: Disclosed herein are system, method, and computer program product embodiments for obtaining feedback in an explicit, non-disruptive manner. An embodiment operates by determining a trigger corresponding to a feedback event, where the trigger is associated with a particular application that is registered with a feedback application associated with the feedback event; detecting an application event corresponding to the trigger occurs during an execution of the particular application; receiving a screenshot of a user interface of the particular application at a time of the detecting; providing a notification indicating that feedback corresponding to the application event is requested; receiving a request to launch the feedback event; and receiving feedback corresponding to the feedback event via the feedback application.

Abstract: A technique for improving determination of handling of guides to events generated in an information system is provided. An event monitoring apparatus for monitoring an event including an event message indicated by a character string related to a phenomenon occurring in an information system includes a guide storage unit that stores a plurality of guides including guide messages indicated by a character string and indicating a method of handling the event and a threshold relating to similarity between the guide messages of the guides and event messages in association with each other; an event storage unit that records the event from the information system; and a guide provision unit that calculates the similarity between the event messages included in the event and the guide messages of the guide and associates a guide whose similarity exceeds a threshold with the event.

Abstract: An event-driven compute service generates a checkpoint package based on an initialized state of a function. The checkpoint package may be generated through proactive or reactive checkpointing. The checkpoint package includes function code and checkpoint data for an initialized state of the registered function. The event-driven compute service registers the checkpoint package. In response to a determination that an event matches a defined event to trigger the registered checkpoint package, the registered checkpoint package launches in a container. A checkpoint framework causes the container to launch the registered function from the initialized state according to the checkpoint data of the registered checkpoint package. The container terminates the registered function upon completion of one or more tasks.

Abstract: The disclosure relates to technology for mapping events to workflow instances. One or more event messages are received with an embedded token from one or more event sources associated with an application. A workflow specification is received that specifies a location of the token embedded in the one or more event messages, and the token is extracted from the one or more event messages using the location of the token specified in the workflow specification. The events are then mapped to a workflow instance of the application based on the token the one or more event messages.

Abstract: A method is disclosed. An implementation establishment system may receive a first message including a request method model and a template from a request processor. The implementation establishment system may generate at least one test API call based on the request method model and the template. The implementation establishment system may then transmit the at least one test API call to the request processor. The implementation establishment system may receive at least one response based on the at least one test API call from the request processor. The implementation establishment system may evaluate the at least one response. The implementation establishment system may generate a response notification based on the at least one response. The implementation establishment system may transmit the response notification to the request processor.

Abstract: An electronic apparatus includes a memory and circuitry. The memory stores a plurality of programs, and program registration information including identification information of the plurality of programs each of which is permitted to be executed in the electronic apparatus. The circuitry executes a first program of the plurality of programs stored in the memory. The circuitry executes a second program according to a determination that the identification information of the program registration information includes identification information of the second program stored in an external memory connectable to the electronic apparatus. The circuitry causes the first program and the second program, which are executed, to be communicable with each other to newly add a function to the electronic apparatus.

Abstract: A method, computer program product, and a system where a processor(s) obtains data comprising issues and respective issue resolution plans for the issues experienced in a distributed computing system. The processor(s) cognitively analyzes the data to identify components of the distributed computing system for status evaluation and generates a script to perform a health check on the components and to automatically resolve performance issues of the components identified during the health check. The processor(s) executes the script, where for each component, the processor(s) determined if a status of the component indicates a performance issue and if not, update the data utilized in the cognitive analysis. If yes, the processor(s) attempts to resolve the status and updates the data with the results.

Abstract: A method for predicting a location of a fault in a system is described. The method includes obtaining a faulty unit pertaining to a Supervised Self-Organizing Map (SSOM), wherein the faulty unit has been derived from a sample of machine-level metrics for the system and the SSOM has been trained with a first layer of machine-level metrics and a second layer of service-level metrics. The method further includes expanding a circle originating at the faulty unit until a number of normal units of the SSOM falls within the circle, computing, for each machine-level metric, a score based on differences between the faulty and normal units, wherein a set of scores comprises the respective score for each machine-level metric, and selecting a sub-set of the set, wherein the sub-set comprises the greatest scores of the set, whereby the fault is predicted as located according to metrics represented by the sub-set.

Abstract: Systems, products and methods for enabling symptom verification. Verifying a symptom may include eliminating repeated symptom definitions or eliminating symptoms having low accuracy. A computer system enables verification of a symptom including a rule for detecting a set of events related to a given problem. The computer system includes a symptom database which stores the symptom, a specimen database which stores a specimen including a set of events detected according to a rule of a certain symptom, and an analysis unit which analyzes the specimen stored in the specimen database using a new symptom in order to determine whether to add the new symptom to the symptom database. The present disclosure also includes a method and a computer program for enabling verification of a symptom including a rule for detecting a set of events related to a given problem.

Abstract: An error detecting device for detecting failure of a hierarchical system comprises a detected signal receiving interface and a processor. The detected signal receiving interface receives a parent failure event occurring in the hierarchical system. If the processor diagnoses that the parent failure event is in a failure state, the detected signal receiving interface receives a first child failure event occurring in the hierarchical system. If the processor diagnoses that the parent failure event is not in the failure state, the detected signal receiving interface receives a second child failure event occurring in the hierarchical system. The parent failure event depends on the first child failure event. The second child failure event depends on the parent failure event. The processor sequentially diagnoses until the detected signal receiving interface receives one of the failure events at a bottom level in a binary search tree structure.

Abstract: In one or more embodiments, one or more systems, methods, and/or processes may start a single threaded power on self test process without a periodic handler to communicate with a watchdog timer of an information handling system; may initialize the watchdog timer with an amount of time; may store the amount of time and watchdog timer access interface information via a memory medium of the information handling system; may, after storing the amount of time and the watchdog timer access interface information, boot an operating system; may provide information indicating a location of the amount of time and the watchdog timer access interface information to the operating system; and may periodically reset the watchdog timer via a device driver of the operating system.

Abstract: The present disclosure relates to processing operations that enable use of cache memory for content validation and error remediation of content. Functionality of the cache is extended to enable interfacing between a cache and a validation component, which is configured to validate data read directly from the cache. Corrupted content may be updated and propagated to a permanent data store associated with an application/service, system, etc. Use of the cache may be optimal for targeting recent and/or heavily accessed content as well as a means for offloading data processing operations from a permanent data storage. Examples described herein extend to those in which data associated with an electronic file is already stored in cache memory as well as those in which update occurs directly to a permanent data storage and subsequently forwarded for validation processing.

Abstract: Embodiments described include methods, apparatuses, and systems including a permutation generator to permute locations of one or more bits (e.g., data bits and/or parity bits) in a codeword. In embodiments, the bits are to be written to a memory device based on the permuted locations to reduce a recurrence of bit error patterns associated with the bits when stored in the memory device. In some embodiments, the locations are based at least in part on a pseudorandom number, generated based at least in part on information available at a read time and a write time. In some embodiments, the pseudorandom number is based upon a memory address of the memory device, such as a 3D NAND or other memory device. Additional embodiments may be described and claimed.

Abstract: A flit-based packetization approach is used for transmitting information between electronic components. A protocol stack can generate transaction layer packets from information received from a transmitting device, assemble the transaction layer packets into one or more flits, and protect the flits with a flit-level cyclic redundancy check (CRC) scheme and a flit-level forward error correction or parallel-forward error correction (FEC) scheme. Flit-level FEC schemes can provide improved latencies and efficiencies over per-lane FEC schemes. To improve retry probability, flits can contain information indicating whether immediately preceding flits are null flits. Receivers can avoid sending a retry request for a corrupted flit if a seceding flit indicates the corrupted flit is a null fit. Parity flits can be used to protect groups of flits and correct single-flit errors.

Abstract: A frequency signal generator includes a controllable oscillator unit, a frequency control unit and an error detection unit. The controllable oscillator unit generates and provides a frequency signal. The frequency control unit generates a frequency control signal and the controllable oscillator unit varies a frequency of the frequency signal based on the frequency control signal. Further, the error detection unit receives the frequency control signal, detects an error within the frequency control signal and provides an error signal. The error signal comprises information on a detected error.

Abstract: A solid state storage device includes a buffer, a non-volatile memory and a control circuit. A write data is temporarily stored in the buffer. The non-volatile memory includes plural dies. The plural dies include respective first spaces as data storage areas. If an amount of the write data in the buffer does not reach a predetermined data amount when a power failure occurs, the control circuit performs a parity check process on the write data to generate a parity data. The control circuit stores the write data in the data storage areas of the plural dies. The control circuit stores the parity data and a position information in a system storage area of the non-volatile memory.

Abstract: A method of parity training for a dynamic random access memory, DRAM, is disclosed. The method comprises enabling a link error checking and correcting, ECC, functionality in a write operation of the DRAM, and remapping a parity function of a write parity pin to an data inversion function, a data replacing function, or a logical function, whereby data transferred to the DRAM through the write parity pin is used for indicating an inversion operation, a logical operation, or a substitution operation for data of a data pin.

Abstract: Systems and methods for recovering corrupted data or missing data from a cache are provided. When a data corruption is discovered in a storage system, the cache may be searched to determine if a valid copy of the corrupted data can be recovered from the cache.

Abstract: An integrated circuit comprising a memory array configured to store data chunks with corresponding error correction codes and error correction logic includes control logic that executes a recovery procedure to access a selected data chunk and corresponding error correction code from the memory array, to utilize the error correction logic to identify a location in the memory array of an error bit in the selected data chunk, and to access the identified location to write the corrected data. The recovery procedure is sequentially applied to a plurality of data chunks over a recovery operation region designated for a given instance of the recovery operation. Memory coupled with the control logic can store one or more recovery parameters that identify the recovery operation region in the memory.

Abstract: A system and method for adaptive multiple read of NAND flash memory. A solid state drive may employ adaptive multiple-read to perform enhanced performance error correction using soft decisions without a performance penalty that otherwise might result from performing unnecessary reads. The soft decision error correcting algorithm may employ lookup tables containing log likelihood ratios. The method may include performing one or more read operations to obtain one or more raw data words for a code word, attempting to decode the code words using the one or more raw data words, and performing additional read operations when the decoding attempt fails. This process may be repeated until a decoding attempt succeeds.

Abstract: Examples of the present disclosure provide apparatuses and methods for error code calculation. The apparatus can include an array of memory cells that are coupled to sense lines. The apparatus can include a controller configured to control a sensing circuitry, that is coupled to the sense lines, to perform a number of operations without transferring data via an input/output (I/O) lines. The sensing circuitry can be controlled to calculate an error code for data stored in the array of memory cells and compare the error code with an initial error code for the data to determine whether the data has been modified.

Abstract: A memory system may include: a nonvolatile memory device comprising a plurality of memory blocks; and a controller suitable for checking a read operation time, a read level class, an error occurrence, and an error occurrence class when performing the read operation on each of the memory blocks, classifying the memory blocks into various classes based on a result of the checking, and differently setting a durability parameter for each of the memory blocks based on a result of the classifying of the memory blocks.

Abstract: Presented herein are methodologies for implementing erasure coding in a distributed log structured storage system. A method includes receiving a write request for first data from a file system, selecting a physical sector on a selected storage device in an array of storage devices on which to store the first data, assigning a key to the physical sector, storing the key and an indication of the physical sector in a key-to-physical medium map, erasure coding the data, including generating parity data associated with the first data, writing the first data and the parity data as a data stripe to each storage device in the array of storage devices and, in response to receiving the write request, sending the key to the file system. Read, update, and delete procedures in the context of a log structured framework are also described.

Abstract: An apparatus stores path configuration information specifying a first path configuration and a second path information each of which indicates a target path configuration from a target processor to IO devices. When an error is detected from among the IO devices in a state where the target path configuration is the first path configuration, the apparatus changes the first path configuration to the second path configuration. When an error is detected from among the IO devices under the second path configuration, the apparatus identifies a suspect component included in the target path configuration, based on a comparison result of comparison between a first IO device whose error has been detected under the first path configuration, and a second IO device whose error has been detected under the second path configuration.

Abstract: In some implementations, a user can be notified when a content item operation initiated by the user on a client device may render a shared or linked content item inaccessible to the user or others. The notification can give the user an option to undo the content item operation. In some implementations, movement of a content item from one directory location to another directory location can be recorded in entries of a local content journal. The local content journal entries can be shared with a content management system and other client devices so that the corresponding content items on the client devices can be moved without downloading additional copies of the content item to the client devices.

Abstract: Disclosed is a method, apparatus, and system for partition level restore, the operations comprising: determining a restoration source virtual machine disk image and a restoration target virtual machine disk image; determining partition information for the restoration source and target virtual machine disk images; determining whether the partition information for the restoration source virtual machine disk image matches the partition information for the restoration target virtual machine disk image; and in response to determining that the partition information for the restoration source virtual machine disk image matches the partition information for the restoration target virtual machine disk image, copying all data from a partition to be restored on the restoration source virtual machine disk image to a corresponding partition on the restoration target virtual machine disk image.

Abstract: In response to determining that continuous data protection is to be enabled for a particular table of a database service, a service component verifies that automated transmission of change records of the table to a log-structured journal has been configured. A given change record comprises a before-image and an after-image associated with a committed database write, and is assigned a unique sequence number. In response to a determination to restore the table as of a specified point in time, a restore record set is identified from the journal with respect to a selected snapshot of the table. The restore record set includes change records which are not represented in the snapshot and are to be represented in the restored table. A restore result table is created using the selected snapshot and the restore record set.

Abstract: According to some embodiment, methods and systems for serverless data deduplication are disclosed. A blob of data is received at a cloud services platform, where the blob of data includes incremental data. The blob of data is used to create an object in a first object store included in the cloud services platform. A function as a service (FaaS) function is triggered when the object is created. The FaaS function deduplicates the object to generate a deduplicated object. The deduplicated object is stored in a second object store included in the cloud services platform.

Abstract: A computing device for storing backups of virtual machines includes a persistent storage and a backup manager. The persistent storage stores backup policies. The backup manager identifies an end of a backup generation session for a virtual machine of the virtual machines and, in response to identifying the end of the backup generation session, identifies a continuity chain implicated by the backup generation session using the backup policies; performs a membership analysis of the identified continuity chain to identify a continuity state of the continuity chain; makes a first determination that the identified continuity chain is broken based on the identified continuity state; and, in response to the first determination, remediates the continuity chain.

Abstract: An agent for managing virtual machines includes a persistent storage and a processor. The persistent storage stores backup/restoration policies. The processor identify an end of a backup generation session for the virtual machines; make a first determination that the backup generation was a batch type backup session and, in response to the first determination, performs a batch level continuity analysis of backups generated via the backup generation session to identify a set of backup failures of the backup generation session; performs an unscheduled batch backup generation session based on the identified set of backup failures; and remediates the backup/restoration policies using the identified set of backup failures to ensure backup continuity of all backups associated with each of the virtual machines.

Abstract: A backup agent for facilitating restorations of virtual machines includes a persistent storage and a backup/restoration policy updater. The persistent storage stores backup/restoration policies. The backup/restoration policy updater identifies a change of a label associated with data of a production host and, in response to identifying change in the label, identifies a virtual machine of the virtual machines associated with the data; performs a threat analysis of the identified virtual machine to determine a new security policy for the identified virtual machine; and updates a policy of the backup/restoration policies associated with the identified virtual machine based on the identified new security policy.

Abstract: A data backup method and a terminal are disclosed in the present disclosure. The data backup method including: receiving a backup trigger instruction; starting a photographing function in respond to the backup trigger instruction, and acquiring a displayable information including a preset operation instruction by photographing; decoding a operation instruction from the displayable information; and performing a data backup process according to the operation instruction. Through this way, the present disclosure provides a data backup method. The method enables emergency transmission and backup of data when the screen or other input interface is inoperable.

Abstract: Consolidating data across several backups to a single virtual machine (VM) at a single instance. A process stores a VM to be backed up such that each backup comprises a single VM disk (VMDK). Upon request from the backup server, the deduplication system returns the location of the VMDKs as a network file system (NFS) path for each VMDK. This path entry is exported to the hypervisor hosting a proxy VM. The entry is mounted as a data store to the hypervisor. The proxy VM uses the VMDK which is in the data store and mounts the disk. This is performed for each VMDK so that the proxy VM mounts the NFS paths that is exported from the deduplication system onto a local file system of the base VM. From the local file system, it creates the mount points to become a user-searchable drive.

Abstract: The present teaching relates to request management and data recovery in a data system. In one example, a request is received for a transaction of data by a first node in the data system. A second node in the data system is determined based on the request. The second node is to carry out the transaction. The request is stored into a first request queue at the first node. The request is sent to the second node. A notice is obtained indicating that information associated with the transaction has been persistently stored. The request is removed from the first request queue in response to the notice.

Abstract: In various embodiments, an apparatus includes a system-on-chip (SoC) to be disposed in a vehicle having a plurality of cores; a hypervisor arranged to partition the cores into at least two domains, an operational domain and a failover domain; a first operating system (OS) arranged to manage execution of at least a first application in the operational domain to provide a first plurality of functions for the vehicle; a second OS arranged to manage execution of at least a second application in the failover domain to provide a second plurality of functions for the vehicle, on occurrence of a failure of the first application. The second functions comprise a subset of the first functions or less embellished versions of some of the first functions, and the second OS has less capabilities than the first OS. Other embodiments, including storage media and methods, are also described and claimed.

Abstract: In one example, a distributed cluster may include compute nodes having a master node and a replica node, an in-memory data grid formed from memory associated with the compute nodes, a first high availability agent running on the replica node, and a second high availability agent running on the master node. The first high availability agent may determine a failure of the master node by accessing data in the in-memory data grid and designate a role of the replica node as a new master node to perform cluster management tasks of the master node. The second high availability agent may determine that the new master node is available in the distributed cluster by accessing the data in the in-memory data grid when the master node is restored after the failure and demote a role of the master node to a new replica node.

Abstract: A plurality of storage nodes is provided. Each of the plurality of storage nodes includes nonvolatile solid-state memory for user data storage. The plurality of storage nodes is configured to distribute the user data and metadata associated with the user data throughout the plurality of storage nodes such that the plurality of storage nodes maintain the ability to read the user data, using erasure coding, despite a loss of two of the plurality of storage nodes. The plurality of storage nodes is configured to initiate an action based on the redundant copies of the metadata, responsive to achieving a level of redundancy for the redundant copies of the metadata. A method for accessing user data in a plurality of storage nodes having nonvolatile solid-state memory is also provided.

Abstract: The present invention is a system intended to ensure the safe and efficient operation of cryptocurrency mining farm based on Bitcoin payment systems that in particular manages its functioning and the operational parameters of its equipment. The system comprises a power supply unit (PSU), a control microcomputer installed in the PSU, logging devices installed on hashboards across the farm miners that log working parameters for the farm, and a logging device to log the operational parameters of the farm that is installed in the PSU; the logging devices support data transfer to miners' microcomputers via a serial peripheral interface, an automatic power-off device is installed in the PSU. The decision-making module of the master is connected to the interface in order to perform emergency shutdown of the farm if its current working parameters differ from optimal.

Abstract: A storage apparatus includes a control unit and an output unit. When the control unit receives cyclic information that is cycled within a specific group in which storage apparatuses with properties close to a property of the relevant storage apparatus are classified, and includes performance information of each storage apparatus belonging to the specific group and evaluation information indicative of an evaluation result of the performance information of each storage apparatus. The control unit acquires the performance information, combines it with the cyclic information, causes a result of evaluation of the performance information of each storage apparatus with respect to a specified evaluation index to be included in the cyclic information, and transmits the cyclic information to a storage apparatus which is a next cycling destination. And the output unit outputs at least one of the performance information and evaluation information included in the cyclic information.

Abstract: A method for validating software transforms. A target program binary is mutated, producing a plurality of variants. It is determined whether each variant passes a test suite. Upon determining the variant does not pass the test suite, the variant is discarded. Upon determining the variant passes the test suite, the variant is compared to the target program binary. A candidate transform is extracted which meets scope criteria. The candidate transform is applied to each of a plurality of test programs. It is determined whether the candidate transform is safe. Upon determining that the candidate transform is not safe, the candidate transform is discarded. Upon determining that the candidate transform is safe, the candidate transform is collected.

Abstract: A device may receive, from a user device, a request for a code assessment of a proposed change to an enterprise resource planning (ERP) system of an organization to identify an impact of implementing the proposed change on custom code associated with the ERP system. The device may obtain data identifying custom items associated with the custom code from a data structure associated with the ERP system. The device may generate custom code metadata for the custom items by performing error checks to determine whether the custom items will cause errors after the proposed change is implemented. The device may generate an assessment report for the code assessment by processing the custom code metadata. The device may provide the assessment report for display on an interface of the user device, and may perform actions to permit the proposed change to be implemented without the errors occurring.

Abstract: Systems and methods for managing Application Programming Interfaces (APIs) are disclosed. For example, the system may include one or more memory units storing instructions and one or more processors configured to execute the instructions to perform operations. The operations may include sending a first call to a first node-testing model associated with a first API and receiving a first model output comprising a first model result and a first model-result category. The operations may include identifying a second node-testing model associated with a second API and sending a second call to the second node testing model. The operations may include receiving a second model output comprising a second model result and a second model-result category. The operations may include performing at least one of sending a notification, generating an updated first node-testing model, generating an updated second node-testing model, generating an updated first call, or generating an updated second call.

Abstract: Automated systems and methods for optimizing a model are disclosed. For example, in an embodiment, a method for optimizing a model may comprise receiving a data input that includes a desired outcome and an input dataset identifier. The method may include retrieving an input dataset based on the identifier and receiving an input model based on the desired outcome. The method may also comprise using a data synthesis model to create a synthetic dataset based on the input dataset and a similarity metric. The method may also comprise debugging the input model using synthetic dataset to create a debugged model. The method may also comprise selecting an actual dataset based on the input dataset and the desired outcome. In some aspects, the method may comprise optimizing the debugged model using the actual dataset and storing the optimized model.

Abstract: Systems, methods, computer program products, and apparatuses to determine a count of trace records to be generated by each block of a plurality of blocks of an instrumented binary code to be executed on a graphics processor, each trace record to comprise a trace record type, the trace record types of a plurality of trace record types, determine a respective execution count for each of the plurality of blocks of the instrumented binary code to be executed on the graphics processor, and determine a respective size of each of a plurality of trace buffers to be allocated in memory based on the determined counts of trace records generated by each block and the execution count for each block, each trace buffer to store trace records of a respective one of the plurality of trace record types.

Abstract: A validation and testing method is provided. The validation and testing method is executable by a processor coupled to a memory. The validation and testing method includes inserting intermediary save points within an instruction stream. The method includes executing the instruction stream including the intermediary save points. The method includes executing a save operation for data in one or more registers at each of the one or more intermediary save points.