Abstract: A remote client screen shots monitoring system for monitoring at least one client includes a preboot execute environment (PXE) module, a terminal multiplexing module, and a monitoring module. The PXE module controls the client to boot up. The client executes operations after booting us and generating screen shots in the process. The monitoring module obtains the screen shots from each client, converts each obtained screen shot to one file, and analyzes each converted file against certain predetermined words which may indicate a fault. The terminal multiplexing module places each generated screen shot together with those of other monitored clients in a display. The monitoring module can accordingly determine whether a fault exists in any one client. A remote client screen shots monitoring method is also provided.

Abstract: A memory system comprising: a memory device including a plurality of memory dies each having a plurality of the memory blocks; and a controller suitable for performing a command operation to the memory dies, wherein the memory device comprises means for performing an error check operation to a first data provided from the controller to store the first data the memory device.

Abstract: A method of directional label rectification with adaptive graph for multivariate time-series data includes obtaining an input matrix containing sensor data and a first event matrix containing event data, identifying in the input matrix at least one feature pattern and a first corresponding time stamp, identifying in the first event matrix at least one fault signature and a second corresponding time stamp, if both a label matrix and an affinity matrix are known, then optimizing a weight matrix, else if both the label matrix and the weight matrix are known, then optimizing the affinity matrix, else optimizing the label matrix, creating a dynamically rectified event matrix by applying the label matrix, the affinity matrix, and the weight matrix to the first event matrix; and applying the dynamically rectified event matrix to forecast a future status of the asset. A system and computer-readable medium are disclosed.

Abstract: Embodiments of the present disclosure relate to a method and apparatus for managing a failure of a device. The method comprises detecting whether a failure occurs in a device, and generating a failure report for the failure in response to the failure occurring in the device. The method further comprises querying a device object repository with the failure report, and the object device repository stores historical failure information associated with the device and a fix solution corresponding to the historical failure information. The method further comprises obtaining the fix solution from the device object repository based on a comparison between the failure report and the historical failure information. Embodiments of the present disclosure can manage the failure of the device more effectively.

Abstract: A Radio Frequency Identification (RFID) tag IC stores an identifier and a check code. The IC determines whether the stored identifier is corrupted by comparing it to the check code. If the stored identifier does not correspond to the check code then the IC may terminate operation or indicate an error. The IC may also reconstruct the correct identifier from the check code.

Abstract: A data write method for writing data is provided. The data writing method is adapted to a memory controller adopting an ECC scheme and includes: encoding the data to generate a codeword; writing the codeword into the memory array according to a first write condition; and performing a verify operation. The step of performing the verify operation includes: reading the codeword from the memory array; comparing the read codeword with the codeword and obtaining an error bit number of the read codeword; decoding the read codeword to generate a decoded data by an ECC decoder; comparing the decoded data with the data; and comparing the error bit number of the read codeword with a pass threshold if the decoded data is identical to the data. If the error bit number of the read codeword is greater than the pass threshold, the data write method further comprises writing the codeword into the memory array according to a second write condition, where the second write condition is different from the first write condition.

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: A data protection technique combines error correcting code and redundant array of independent disk functionality for a non-volatile memory (NVM) array of a data storage system. The technique includes receiving, by a controller, data for storage in the NVM. In response to receiving the data for storage in the NVM array, the controller forms first component codewords based on encodings with a first level code of respective first portions of the data. In response to receiving the data for storage in the NVM array, the controller forms a second component codeword based on an encoding with a second level code of a second portion of the data and the first component codes. The controller stores a respective portion of each of the first and second component codeswords on packages of the NVM array. The storing achieves maximum equal spreading of each of the component codewords across all of the packages.

Abstract: A data storage device is disclosed comprising a non-volatile storage medium (NVSM). A reliability metric for each symbol of each of a plurality of codewords read from the NVSM is generated, and a number of erasures for a first codeword are generated, wherein the number of erasures exceeds the correction power of the first codeword. A reliability metric of the first codeword is modified corresponding to one of the erasures. The reliability metrics for each codeword including the modified reliability metrics of the first codeword are first iteratively processed using a low density parity check (LDPC) type decoder, thereby first updating the reliability metric for each symbol of each codeword. The reliability metrics for the first codeword are second updated using the parity sector, and the second updated reliability metrics for the first codeword are second iteratively processed using the LDPC-type decoder.

Abstract: A computing system includes: a data block including data pages and each of the data pages includes data sectors and each of the data sectors include sector data and a sector redundancy; a storage engine, coupled to the data block, configured to: apply a first protection across the data pages, apply a second protection across the data sectors, and correct at least one of the data sectors when a sector correction with the sector redundancy failed with the first protection and the second protection.

Abstract: Data is read from memory cells in the memory device. The read data is transferred over a link to a memory controller that is external of the memory device. While the transferring of the read data is ongoing, error detection of the read data is performed inside the memory device using an error correction code.

Abstract: Incremental RAID stripe update parity calculation includes receiving a first portion of data of a RAID stripe for writing to a first memory location of a plurality of solid state drives. A first parity value is calculated for the first portion of data of the RAID stripe. A second portion of data of the RAID stripe is received for writing to a second memory location that is different from the first memory location A second parity value is calculated in dependence upon the second portion of the data of the RAID stripe and upon the first parity value Responsive to successfully writing the second portion of data of the RAID stripe, the first parity value is replaced with the second parity value.

Abstract: A method, non-transitory computer readable medium and computing device that determines in response to an event when currently owned spare data storage devices by one of a pair of storage node computing devices in a high availability pair are insufficient to satisfy a requirement for the event for one or more additional spare data storage devices having one or more data storage device parameters. One or more currently owned spare data storage devices by the other one of the storage node computing devices sufficient to satisfy the requirement are identified. The identified one or more currently owned spare data storage devices owned by the other one of the pair of storage node computing devices that satisfy the requirement are assigned to the one of the pair of storage node computing devices.

Abstract: A highly resilient, scalable, high-performance data storage system that stripes its content across peer computers in a data cluster, across data clusters in a cluster group, and across cluster groups in a multi-cluster-group Hyper Storage System. Multiple peers can fail within a data cluster, even beyond the FEC level configured in the cluster, without disrupting the clients. Multiple entire data clusters can fail or be taken out of service without disrupting the clients. Peer failures are detected by the cluster and all missing data is seamlessly regenerated through vertical and/or horizontal resiliency so the great majority of I/O operations complete successfully.

Abstract: Systems, methods, and computer-readable media for fast convergence for virtual ethernet segments in EVPN and PBB-EVPN networks are disclosed. A first provider edge (PE) device can receive one or more advertising messages corresponding to one or more virtual ethernet segments, wherein each of the one or more advertising messages can include a port identifier. The first PE device maintains a table including the one or more virtual ethernet segments and the corresponding port identifier. The first PE device can receive a failure message from a second PE device that identifies a first port on the second PE device, and identifies, based on the table, at least one affected virtual ethernet segment that is associated with the first port. The first PE device can remove any routes that are associated with the at least one affected virtual ethernet segment and trigger mass designated-forwarding election for impacted virtual ethernet segments.

Abstract: A method of generating time-coordinated snapshots across virtual machines (VMs) managed by at least one hypervisor executing in at least one host computer is described. The method includes: controlling at least one hypervisor to activate write caches for caching write traffic, generated by the VMs, targeting virtual disks; receiving, from the at least one hypervisor, messages that indicate idle periods in the write traffic; determining a quiescent window in the write traffic across the VMs from the idle periods; controlling the at least one hypervisor to flush the write caches up to a start time of the quiescent window; and controlling the at least one hypervisor to generate snapshots of the VMs.

Abstract: A system is provided for creating selective snapshots of a database that is stored as one or more segments, wherein a segment comprises one or more memory pages. The system includes a memory storage comprising instructions and one or more processors in communication with the memory. The one or more processors execute the instructions to determine whether a snapshot process is configured to access a selected segment of the one or more segments, assign a positive mapping status to an accessed segment for which the determining unit has determined that it is accessed by the snapshot process and to assign a negative mapping status to a non-accessed segment, and create a snapshot comprises a step of forking the snapshot process with an address space that comprises a subset of the one or more segments.

Abstract: For accessing files from block-level backups of a virtual disk, an apparatus is disclosed. The apparatus includes a changed block module that obtains a list of changed blocks between a previous and a current backup of a virtual disk. The apparatus includes a mapping module that maps logical clusters of the virtual disk to the changed blocks and identifies files corresponding to the logical clusters. The apparatus further includes a changed file module that designates the files corresponding to the logical clusters as changed files, unless current attributes of the files for the current backup match attributes of the files in a backup file index corresponding to the previous backup of the virtual disk. The changed file module further stores the current attributes and extents for the changed files within blocks of a backup storage device for updating in the backup file index.

Abstract: Embodiments are directed to a large-scale data backup system and method. A backup process accesses a defined policy defining how the virtual machines are to be grouped into a plurality of groups, and groups the plurality of virtual machines into the plurality of groups according to the defined policy with each group containing a number of virtual machines that can be backed up in a single backup operation without causing a system error. It then takes a snapshot backup of each group of the plurality of groups in a respective data rollover operation, and saves the snapshot backup of each group to a storage media. The policy may be a user-defined policy or a dynamic system-defined policy, and may be based on characteristics such as total number of virtual machines, system characteristics, and backup system constraints.

Abstract: Rolling back data on tape in a file system is provided. A management tape is prepared. The management tape has only index files recorded thereon. The index files contain information about start positions and lengths of corresponding data files recorded on normal tapes. The index files further contain identification information for the normal tapes. A first index file of the management tape is read. The first index file is related to a data file to be rolled back. The first index file is read out from the management tape mounted on a first tape drive. The data file to be rolled back is read out of a first normal tape. The first normal tape is identified based on information in the first index file. The first normal tape is mounted on a second tape drive.

Abstract: A fault monitoring device includes a notice reception part configured to receive a notice indicating occurrence of faults from a virtual network device, and a recovery process part configured to carry out a recovery process for one device having the highest priority of fault response among the virtual network device producing the notice, a physical device implementing the virtual network device, and another virtual network device involved in dependency with the virtual network device.

Abstract: An illustrative “VM heartbeat monitoring network” of heartbeat monitor nodes monitors target VMs in a data storage management system. Accordingly, target VMs are distributed and re-distributed among illustrative worker monitor nodes according to preferences in an illustrative VM distribution logic. Worker heartbeat monitor nodes use an illustrative ping monitoring logic to transmit special-purpose heartbeat packets to respective target VMs and to track ping responses. If a target VM is ultimately confirmed failed by its worker monitor node, an illustrative master monitor node triggers an enhanced storage manager to initiate failover for the failed VM. The enhanced storage manager communicates with the heartbeat monitor nodes and also manages VM failovers and other storage management operations in the system. Special features for cloud-to-cloud failover scenarios enable a VM in a first region of a public cloud to fail over to a second region.

Abstract: The disclosure is directed towards fault-tolerant methods, systems and architectures for data distribution. One method includes generating fault distribution tables. The table entries correspond to a copy of data records. The entry and copy are associated with a fault status, a node, and a group that are based on a position of the entry within the distribution table. The method also includes storing the copy of the data record that corresponds to the entry in a database that is included in a plurality of databases. In response to determining an unavailable node included in the plurality of nodes, the method determines a fault status, a node, and a group. The method provides an available node sequential access to data records that are stored in a particular database that is stored locally on the available node in a tree structure.

Abstract: A scan circuit and methods of operating a scan circuit are provided. The method for operating a scan circuit includes providing a first scan flip-flop which includes an overwrite feature. With the overwrite feature enabled, a change in functional behavior of the first scan flip-flop occurs based on a control signal. The method may further include capturing data at a first input of the first scan flip-flop during a first state of the control signal and resetting captured data by using the overwrite feature during a first transition of the control signal. The method may further include forming a scan chain with one or more of the first scan flip-flops and one or more second scan flip-flops. The second scan flip-flops may include a similar overwrite feature, having the overwrite feature disabled.

Abstract: A connection confirmation system includes a connection detection apparatus and an information processing apparatus communicable with each other. The connection detection apparatus acquires a setting relating to a connection mode of a device to be connected to a sound processing apparatus, detects a connection mode of a device actually connected to the sound processing apparatus, and determines a difference between the detected actual connection mode and the connection mode indicated by the acquired setting.

Abstract: A system includes a first software module, a storage module and a second software module. The first software module receives first data and analyzes the first data to obtain first processed data corresponding to the first data. The storage module stores the first processed data. The second software module receives second data and obtains values in first processed data corresponding to parameters of the second software module, and analyzes the obtained values and the second data to obtain second processed data.

Abstract: A data logger includes functional units for acquisition, digitization, storage and evaluation of measurement data and for wireless transmission of data to an external data processing device. The external data processing device provides photographic acquisition for recording of static and/or dynamic patterns of electromagnetic radiation. An optical indicator device emits and/or reflects electromagnetic radiation. The functional unit for data transmission is coupled to the optical indicator device such that data will can be transmitted in coded form via time-controlled and/or intensity-controlled activation.

Abstract: The operation of an automatic service monitoring system (SMS) is directed by stored control information. Methods and mechanisms are provided to create portable control modules based on the control information. The portable modules may be transmitted or otherwise conveyed to a second SMS and imported there to establish the control information that directs and determines operational aspects of the second SMS.

Abstract: Examples of techniques for packet flow tracing in a parallel processor complex are disclosed. In one example implementation according to aspects of the present disclosure, a computer-implemented method may include receiving, at the parallel processor complex, a task to be executed by the parallel processor complex, wherein the parallel processor complex comprises a trace processor and a plurality of task execution processors; creating, by the trace processor, a trace entry by allocating an element from a shared queue; loading, by the trace processor, the trace entry into a common trace buffer; and loading, by the trace processor, the trace entry into a host interface/queue pair index trace buffer.

Abstract: The present invention concerns a method for verifying traceability of first code instructions in a procedural programming language generated from second code instructions in a modelling language, characterized in that it comprises the implementation, by a piece of equipment (1), of steps of: (a) Syntactic analysis: o of the first instructions so as to generate an AST, and o of the second instructions so as to generate an MDT; (b) Semantic analysis: o Of the AST so as to identify patterns representative of basic functional blocks of the first instructions; o Of the MDT so as to identify characteristic properties of basic functional blocks of the second instructions; (c) Matching, pairwise, the identified basic functional blocks, and confirming the traceability of first code instructions only if: o for each block of the first instructions, there is a functionally equivalent block in the second instructions, and o for each block of the second instructions, there is a functionally equivalent block in the first in

Abstract: Methods, systems and computer readable medium are provided for sequentially analyzing a series of thread dump samples to estimate the intensity statistic of newly classified stack segments of stack frames. According to one embodiment, a branch point along one or more linearly connected stack frames of a stack segment can be detected, where the stack segment is associated with one or more thread intensity statistic parameters. Upon detecting the branch point along the one or more linearly connected stack frames of the stack segment, the system can split the stack segment into a plurality of new stack segments that each include a subset of the stack frames, where the plurality of new stack segments are referenced by the stack segment. The system can then initialize the one or more thread intensity statistic parameters for each of the new stack segments.

Abstract: In an approach for utilizing overlay hooks to increase code coverage, a processor inserts an overlay hook in program code at a location within the program code corresponding to a condition statement. A processor executes the program code. Upon reaching the overlay hook, a processor branches to a set of instructions operative to document an outcome of the condition statement. A processor executes the condition statement. A processor records the outcome of the condition statement.

Abstract: A system, method, and computer program product are provided for web testing and automation offline storage and analysis. In operation, an automated testing flow of a system under test is monitored by a testing system. Further, an instruction is received by the testing system to capture a snapshot of the system under test during the automated testing flow of the system under test. In response to receiving the instruction to capture the snapshot of the system under test, a complete snapshot of the system under test is saved by the testing system. The complete snapshot includes an appearance of the system under test, digital assets being utilized in association with the automated testing flow of the system under test, and current code associated with the automated testing flow of the system under test, such that full client-side functionality of the system under test is available to a tester offline.

Abstract: The present technology consists of an automatic application testing tool that can initiate execution of an application submitted for testing by an application developer. The application testing tool can analyze views of the application while the application is executing to determine navigation objects and possible interactions with the navigation objects. The application testing tool can automatically apply possible interactions to the navigation objects and can record application execution data during the testing.

Abstract: A system, method, and computer program product are provided for production driven testing. In operation, a system discovers production data associated with at least one project. The system designs optimized test scenarios utilizing the production data for a scoping phase, a development phase, and a testing phase associated with the at least one project. The system prioritizes tests associated with the optimized test scenarios based on the production data, test history, and development activities. Further, the system automatically executes the tests using the production data on a staging framework associated with the system. The system monitors the execution of the tests, including monitoring progress and production coverage associated with the at least one project. Moreover, the system outputs production based feedback and testing scope optimization information resulting from monitoring the execution of the tests.

Abstract: A method is disclosed including instrumenting a first version of an application on a plurality of end user devices and receiving execution data for the first version of the application from at least some of the plurality of end user devices. The execution data may be generated by the instrumentation in response to an execution of the first version of the application by the at least some of the end user devices. The method further includes automatically generating execution scripts based on the received execution data. The execution scripts may be configured to reproduce the execution of the first version of the application by the at least some of the end users devices. The method further includes automatically executing at least one of the execution scripts on an updated version of the application.

Abstract: A system and method for generating and adapting a test case is provided. The system may process an application prototype to extract information regarding the navigational flow of the application prototype and information regarding one or more GUI components used therein. The system may also generate a prototype test suite based on the application prototype that includes one or more test cases for testing the functionality of the application once implemented. The system may also process a production application to extract information regarding the navigational flow of the production application and information regarding one or more GUI components used therein. The system may identify differences between the production application and prototype and may automatically adapt the prototype test suite and generate an application test suite capable of testing the production application.

Abstract: Development-time awareness of production environment dependency injection configuration in a software development or test environment. In a software development or test environment, metadata is retrieved relating to configuration data of injection sources and target injection sites in applications of a configured target production server or a representation of a configured target production server. A configuration data structure is formed that cross-references target injection sites and injectable sources determined from the configuration data, the configuration data structure being associated with the production server and available to the software development or test environment. The configuration data structure is referenced to carry out dependency injection related features.

Abstract: A method for automated software testing may include mapping test cases to lines in files in a codebase. Each test case covers one or more lines in one or more files and has corresponding test results. The method may further include obtaining a change list including one or more changes. Each change specifies a changed line in a changed file. The method may further include determining impacted test cases, based on the mapping and the change list, prioritizing the impacted test cases based, in part, on test results corresponding to each impacted test case, executing, based on the prioritization, one or more impacted test cases to obtain executed test cases, and obtaining, for each executed test case, new test results.

Abstract: Discussed herein are embodiments of methods and systems which allow engineers or administrators to create modular plugins which represent the logic for various fault detection tests that can be performed on data pipelines and shared among different software deployments. In some cases, the modular plugins each define a particular test to be executed against data received from the pipeline in addition to one or more configuration points. The configuration points represent configurable arguments, such as variables and/or functions, referenced by the instructions which implement the tests and that can be set according to the specific operation environment of the monitored pipeline.

Abstract: In general, techniques are described for monitoring memory usage in computing devices. A computing device comprising a memory and a control unit that executes a kernel of an operating system having kernel sub-systems may implement the techniques. A memory manager kernel subsystem, in response to requests for amounts of the memory from other one kernel sub-systems, allocates memory blocks from the memory. The memory manager, in response to requests to de-allocate one or more of the allocated memory blocks, determines the corresponding requested amounts of memory and sizes of the de-allocated blocks. The memory manager then generates memory usage information based on the determined requested amounts of memory and the determined ones of the two or more different sizes. The memory usage information specifies usage of the memory in terms of the two or more different sizes of the allocated plurality of memory blocks.

Abstract: Method and apparatus for data storage. In some embodiments, a solid-state memory includes an array of non-volatile memory cells arranged into erasable blocks. A register stores a multi-bit sequence value. A controller randomizes input data to be written to a selected erasable block by combining the input data with the multi-bit sequence value shifted by a number of bit locations responsive to an accumulated access count for the selected erasable block.

Abstract: Disclosed embodiments are directed to systems and methods for improving garbage collection and wear leveling performance in data storage systems. The embodiments can improve the efficiency of static wear leveling by picking the best candidate block for static wear leveling and/or postponing static wear leveling on certain candidate blocks. In one embodiment, one or more source blocks for a static wear leveling operation are selected based at least on whether the one or more blocks have a low P/E count and contain static data, such as data that has been garbage collected.

Abstract: A storage system connectable to a host includes a plurality of interface units, a plurality of semiconductor memory modules, each being detachably coupled with one of the interface units, and a controller configured to maintain an address conversion table indicating mappings between logical addresses and physical addresses of memory locations in the semiconductor memory modules. When the controller determines that a first semiconductor memory module needs to be detached, the controller converts physical addresses of the first semiconductor memory module into corresponding logical addresses using the address conversion table and copies valid data stored in the corresponding logical addresses to another semiconductor memory module and update the address conversion table to indicate new mappings for the corresponding logical addresses of the valid data.

Abstract: The disclosed embodiments provide a method, apparatus, and system for selecting, based on feedback from previous garbage collections, a portion of a referenced memory area for garbage collection within a time window. During the execution of a software program, the system selects a given portion of a referenced memory area on which garbage collection can be completed within the given time window and attempts to complete garbage collection on at least the given portion of the referenced memory area before the end of the given time window. Next, the system selects, based on the results of the garbage collection performed during the given time window, a subsequent portion of the referenced memory area on which garbage collection can be completed within the subsequent time window and attempts to complete garbage collection on at least the subsequent portion of the referenced memory area before the end of the subsequent time window.

Abstract: A technique relates to enabling a multiprocessor computer system to make a non-coherent request for a cache line. A first processor core sends a non-coherent fetch to a cache. In response to a second processor core having exclusive ownership of the cache line in the cache, the first processor core receives a stale copy of the cache line in the cache based on the non-coherent fetch. The non-coherent fetch is configured to obtain the stale copy for a predefined use. Cache coherency is maintained for the cache, such that the second processor core continues to have exclusive ownership of the cache line while the first processor core receives the stale copy of the cache line.

Abstract: A first request is received to access a first set of data in a first cache. A likelihood that a second request to a second cache for the first set of data will be canceled is determined. Access to the first set of data is completed based on the determining the likelihood that the second request to the second cache for the first set of data will be canceled.

Abstract: Techniques are described for memory coherence in a multi-core system with a heterogeneous memory architecture comprising one or more hardware-managed caches and one or more software-managed caches. According to one embodiment, a set of one or more buffers are allocated in memory, and each respective buffer is associated with a respective metadata tag. The metadata tag may be used to store metadata that identifies a state associated with the respective buffer. The multi-core system may enforce coherence for the one or more hardware-managed caches and the one or more software-managed caches based on the metadata stored in the metadata tag for each respective buffer in the set of one or more buffers. The multi-core system may read the metadata to determine whether a particular buffer is in a hardware-managed or a software-managed cacheable state. Based on the current state of the particular buffer, the multi-core system may perform coherence operations.

Abstract: Embodiments of the invention are directed to methods for handling cache prefetch requests. The method includes receiving a request to prefetch data from main memory to a cache. The method further includes based on a determination that the prefetch request is a speculative prefetch request, determining if the cache is being used for transactional memory. The method further includes based on a determination that the cache is not being used for transactional memory, processing the prefetch request. The method further includes based on a determination that the cache is being used for transactional memory, and a determination if the prefetch request can be processed without affecting transactional memory, processing the prefetch request. The method further includes based on a determination that the cache is being used for transactional memory, and a determination if the prefetch request can be processed without affecting transactional memory, rejecting the prefetch request.

Abstract: Apparatuses, systems, methods for a spatial memory streaming (SMS) prefetch engine are described. In one aspect, an SMS prefetch engine uses trigger-to-trigger stride detection to promote training table entries to pattern history table (PHT) entries and to drive spatially related prefetches in more distant regions. In another aspect, an SMS prefetch engine maintains a blacklist of program counter (PC) values to not use as trigger values. In yet another aspect, an SMS prefetch engine uses hashed values of certain fields, such as the trigger PC, in entries of, e.g., filter tables, training tables, and PHTs, as index values for the table.