Abstract: A method includes receiving, at a load balancer for a plurality of computing components, a workload request. The method also includes accessing a database including a respective non-linear scalability model for each of the plurality of computing components. The method further includes determining a particular computing component from the plurality of computing components based on each respective non-linear scalability model; and scheduling the workload request for execution by the particular computing component.

Abstract: Methods and systems for optimizing distributed workloads on information handling systems involve determining workload attributes for a computing task for distributed execution among distributed information handling systems. The workload attributes are used to dynamically determine optimal allocation and configuration of distributed hardware resources at the distributed information handling systems. After dynamic confirmation of the allocation and configuration of the distributed hardware resources, the computing task is segmented for distributed execution.

Abstract: Systems, apparatuses, and methods for classification based automated instance management are disclosed. Classification based automated instance management may include automatically commissioning an application instance based on a plurality of classification metrics, and automatically monitoring the application instance based on the plurality of classification metrics. Automatically monitoring the application instance may include identifying a plurality of instance monitoring policies associated with the application instance based on the plurality of classification metrics. Automatically monitoring the application instance may include automatically suspending the application instance plurality of instance monitoring policies and automatically decommissioning the application based on the plurality of instance monitoring policies.

Abstract: Processes in a message passing system may be launched when messages having data patterns match a function on a receiving process. The function may be identified by an execution pointer within the process. When the match occurs, the process may be added to a runnable queue, and in some embodiments, may be raised to the top of a runnable queue. When a match does not occur, the process may remain in a blocked or non-executing state. In some embodiments, a blocked process may be placed in an idle queue and may not be executed until a process scheduler determines that a message has been received that fulfills a function waiting for input. When the message fulfills the function, the process may be moved to a runnable queue.

Abstract: In a method for processing work items that have not been completed by a first escalation, a computer determines that the first escalation failed to complete execution, processed fewer work items than the first escalation is configured to process, or completed execution beyond an allotted processing time. The computer duplicates the first escalation to form a second escalation. In addition, the computer configures the second escalation to process the work items that have not been completed by the first escalation. Furthermore, the computer disables the first escalation and activates the second escalation to process the work items that have not been completed by the first escalation.

Abstract: In a multithreaded data processing system including a plurality of processor cores, storage-modifying requests of a plurality of concurrently executing hardware threads are received in a shared queue. The storage-modifying requests include a translation invalidation request of an initiating hardware thread. The translation invalidation request is removed from the shared queue and buffered in sidecar logic in one of a plurality of sidecars each associated with a respective one of the plurality of hardware threads. While the translation invalidation request is buffered in the sidecar, the sidecar logic broadcasts the translation invalidation request so that it is received and processed by the plurality of processor cores. In response to confirmation of completion of processing of the translation invalidation request by the initiating processor core, the sidecar logic removes the translation invalidation request from the sidecar.

Abstract: A microprocessor includes a main processor and a service processor. The service processor is configured to detect and break a deadlock/livelock condition in the main processor. The service processor detects the deadlock/livelock condition by detecting the main processor has not retired an instruction or completed a processor bus transaction for a predetermined number of clock cycles. In response to detecting the deadlock/livelock condition in the main processor, the service processor causes arbitration requests to a cache memory to be captured in a buffer, analyzes the captured requests to detect a pattern that may indicate a bug causing the condition and performs actions associated with the pattern to break the deadlock/livelock. The actions include suppression of arbitration requests to the cache, suppression of comparisons cache request addresses and killing requests to access the cache.

Abstract: A system, method and computer program product are provided for sharing information in a distributed system. After information is received, it is stored on a bulletin board. In use, the information is shared, in real-time, among a plurality of heterogeneous processes.

Abstract: A technique is described for generating error buffer that includes errors from both a program and event handlers called by the program. A program in an event-driven environment triggers an event. In response to the triggered event, the program calls event handlers related to the event. The event handlers are executed and error messages generated during the execution are stored in a local error buffer. Upon completion of the event handlers, the local error buffers are returned to the program and the program merges the local error buffers with an error buffer associated with the program.

Abstract: Methods and systems for implementing client control in a distributed strict queue are disclosed. A plurality of messages are distributed to a plurality of queue servers based on strict order parameters for the messages. Messages that share a value for the strict order parameter are distributed to the same queue server. The messages are enqueued at the queue servers. Messages that share a value for the strict order parameter are enqueued in a strict order based on the time of receipt at the queue server. A control message is sent from the queue servers to one or more queue clients. The control message causes modification of a configuration at the queue clients. The queue clients are configured to process the messages based on the configurations.

Abstract: The present application provides a method and a device for preventing window's lagging, and relates to the field of computer technology. The method comprises: when a child window is created by a thread, a middle window being firstly created in a thread different from the thread in which each child window of a window system is positioned, wherein the middle window is the parent window of the child window currently created, the parent window of the middle window is a frame parent window, and the thread in which the child window currently created is positioned differs from the thread in which the frame parent window is positioned; if window's lagging of a child window occurs, a window's lagging message of the child window in which window's lagging occurs being sent to the thread in which the corresponding middle window is positioned; and the middle window and the child window in which window's lagging occurs are separated from a window frame by the thread in which the middle window is positioned.

Abstract: An order controller stores each received event in a separate entry in one of at least two queues with a separate counter value set from an arrival order counter at the time of storage, wherein the arrival order counter is incremented after storage of each of the received events and on overflow the arrival order counter wraps back to zero. The order controller calculates an exclusive OR value of a first top bit of a first counter for a first queue from among the at least two queues and a second top bit of a second counter for a second queue from among the at least two queues. The order controller compares the exclusive OR value with a comparator bit to determine whether a first counter value in the first counter was stored before a second counter value in the second counter.

Abstract: Recording an unstructured event in context can include detecting a first occurrence indicative of a start to the unstructured event utilizing a sensing feature of a client device. Upon detection of the first occurrence, device activity data associated with the client device is tracked. A second occurrence indicative an end to the unstructured event is detected utilizing the sensing feature. Following detection of the second occurrence, an event object for the unstructured event spanning between the first and second events is presented. The event object includes or is otherwise associated with the device activity data tracked during the timespan.

Abstract: Systems and methods are disclosed for providing secure information processing. In one exemplary implementation, there is provided a method of secure domain isolation. Moreover, the method may include configuring a computing component with data/programming associated with address swapping and/or establishing isolation between domains or virtual machines, processing information such as instructions from an input device while keeping the domains or virtual machines separate, and/or performing navigating and/or other processing among the domains or virtual machines as a function of the data/programming and/or information, wherein secure isolation between the domains or virtual machines is maintained.

Abstract: A processor core of a data processing system receives a push instruction of a sending thread that requests that a message payload identified by at least one operand of the push instruction be pushed to a mailbox of a receiving thread. In response to receiving the push instruction, the processor core executes the push instruction of the sending thread. In response to executing the push instruction, the processor core initiates transmission of the message payload to the mailbox of the receiving thread. In one embodiment, the processor core initiates transmission of the message payload by transmitting a co-processor request to a switch of the data processing system via an interconnect fabric.

Abstract: Digital objects are stored and accessed within a fixed content storage cluster by using a page mapping table and a pages index. A stream is read from the cluster by using a portion of its unique identifier as a key into the page mapping table. The page mapping table indicates a node holding a pages index indicating where the stream is stored. A stream is written to the cluster by storing the stream on any suitable node and then updating a pages index stored within the cluster. The cluster recovers from a node failure by first replicating streams from the failed node and reallocating a page mapping table to create a new pages index. The remaining nodes send records of the unique identifiers corresponding to objects they hold to the new pages index. A node is added to the cluster by reallocating a page mapping table.

Abstract: A non-transitory computer-readable recording medium stores a memory management program that causes a computer to execute a process. The process includes detecting writing into a memory; and saving, in association with each other in a predetermined storage area, data before the writing which is stored in a data area of a write destination of the detected writing, and context information of a processor at a time of detecting the writing into the memory.

Abstract: A method for assisting evaluation of anomalies in a distributed storage system is disclosed. The method includes a step of monitoring at least one system metric of the distributed storage system. The method further includes steps of maintaining a listing of patterns of the monitored system metric comprising patterns which previously did not result in a failure within one or more nodes of the distributed storage system, and, based on the monitoring, identifying a pattern (i.e., a time series motif) of the monitored system metric as a potential anomaly in the distributed storage system. The method also includes steps of automatically (i.e. without user input) performing a similarity search to determine whether the identified pattern satisfies one or more predefined similarity criteria with at least one pattern of the listing, and, upon positive determination, excepting the identified pattern from being identified as the potential anomaly.

Abstract: A method may be performed in a data storage device that includes a memory and a controller, in response to a request to read data from the memory. The data is located within a first word line of the memory. The method includes accessing the data from the first word line and determining, based on a probability threshold, whether to perform a remedial action with respect to a second word line.

Abstract: Various embodiments of the present disclosure describe a method, device, and system for repairing run-time errors. The method includes at a client side, obtaining dump file information and version information of an application where a run-time error occurs; calculating the obtained dump file information and version information according to a preset algorithm to get an error identification associated with the run-time error; sending an error report carrying the error identification to an error information acquisition server; receiving a repair application issued by the error information acquisition server according to the error identification; and activating the repair application to perform repairing. When embodiments of the present disclosure are employed, the time required for repairing application run-time errors can be reduced.

Abstract: An apparatus and method detect the use of stale data values due to weak consistency between parallel threads on a computer system. A consistency error detection mechanism uses object code injection to build a consistency error detection table during the operation of an application. When the application is paused, the consistency error detection mechanism uses the consistency error detection table to detect consistency errors where stale data is used by the application. The consistency error detection mechanism alerts the user/programmer to the consistency errors in the application program.

Abstract: Systems and methods relating generally to solid state memory, and more particularly to systems and methods for recovering data from a solid state memory. An example data processing system includes a first circuit operable to yield a modified soft data set from a data set accessed from a solid state memory device, and a second circuit operable to apply a data decoding algorithm to the modified soft data to yield a decoded output.

Abstract: An operating method of a memory controller includes performing a soft read operation to read data stored in a semiconductor memory device using a soft read voltage, performing a soft decision ECC decoding operation to the read data based on a first log likelihood ratio (LLR) value, and performing the soft decision ECC decoding operation to the read data based on a second LLR value when the soft decision ECC decoding operation based on the first LLR value fails. The first and second LLR values are selected between a default LLR value and an updated LLR value. The updated LLR value is generated on a basis of numbers of error bits and non-error bits of the read data, which are obtained through the soft decision ECC decoding operation to the read data.

Abstract: In one embodiment, a system includes a processor and logic configured to receive data including a plurality of data elements, each data element having one or more bits, and pass each data element along with a corresponding parity bit to an input of a data path, a first binary sequence generator configured to create a binary sequence having a plurality of bonus bits, wherein a total length of the binary sequence is equal to or greater than a maximum burst size of the data, and a first parity module configured to provide a parity calculation using bits of each data element of the data with a bonus bit from the binary sequence to produce a parity bit for each data element. Other systems, methods, and computer program products for providing end-to-end parity generation and checking that the scheme provides coverage for both data and sequencing faults are also disclosed.

Abstract: A dynamic random access memory (DRAM) array is configured for selective repair and error correction of a subset of the array. Error-correcting code (ECC) is provided to a selected subset of the array to protect a row or partial row of memory cells where one or more weak memory cells are detected. By adding a sense amplifier stripe to the edge of the memory array, the adjacent edge segment of the array is employed to store ECC information associated with the protected subsets of the array. Bit replacement is also applied to defective memory cells. By implementing ECC selectively rather than to the entire array, integrity of the memory array is maintained at minimal cost to the array in terms of area and energy consumption.

Abstract: Embodiments include a computer system for temporary pipeline marking for processor error workarounds, the computer system having a processor configured to perform a method. The method includes monitoring a pipeline of the processor for an event that is predetermined to place the processor in a stuck state that results in an errant instruction execution result due to the stuck state or repeated resource contention causing performance degradation. The pipeline is marked for a workaround action based on detecting the event. A clearing action is triggered based on the marking of the pipeline. The marking of the pipeline is cleared based on the triggering of the clearing action.

Abstract: A computing device operates an application to receive and implement new functionality from a network service. If the new functionality causes the application to fail, the application can automatically discard or ignore the new functionality when the application is re-launched.

Abstract: The present invention provides a method of and apparatus for implementing changes within a data system. The method receiving a request including one or more objects to be imported into a data system, creating a back up request comprising a copy of the objects included within the request, implementing the back up request in the system to generate a modified back up request including a log of the objects modified in the request, storing the modified back up request. This allows a log of changes to objects in the data system to be generated using a copy of a request including a list of changes to the objects. Once the modified back up request has been generated the request may be imported into the system.

Abstract: A data storage device includes a nonvolatile memory apparatus including a memory block including a plurality of pages; and a processor suitable for writing write data in target pages of the memory block, and backing up special management data of the write data in at least one backup page of the memory block.

Abstract: Aspects of the subject technology relate to executing a boot sequence from a recovery image. A determination of a validity of one or more keyblocks is made. A determination of a first version identifier and a second version identifier is made. A comparison of the first version identifier and the second version identifier is performed. A boot sequence from a recovery image is executed based on the comparison.

Abstract: An interface between an existing local file system and a data store generates and exports to the data store a versioned file system. The state of the local file system at a given point in time can be determined using the versioned file system. In operation, the interface creates and exports to the data store structured data representations, which correspond to versions of the local file system, as well as actual file system data that these structured data representations represent. A cache associated with the interface stores recently used data and metadata, as well as all write data and metadata waiting to be transferred to the data store. Prior to transfer, one or more data transformations may be applied to the data and metadata. In one embodiment, the data store comprises one or more cloud storage service providers. A content control system is used to configure and manage the interface.

Abstract: According to one embodiment of the present disclosure, a method for multiplex backup using next relative addresses may be provided. The method may include receiving a first chunk and a second chunk that are each associated with a first file. A next relative address may be appended to the first chunk. The next relative address may indicate a position in a storage device. The first chunk with the next relative address may be written to the storage device at a first address. The method may further include writing the second chunk to the storage device at the position indicated by the next relative address of the first chunk.

Abstract: The management of backup sets based on user feedback techniques include a method, and a system. In some embodiments of these techniques, the method includes receiving an update to a backup set from a first client device. The method further includes analyzing the update made to the backup set. The method further includes updating a default backup set stored in a storage device based on the update to the backup set. This Abstract is provided for the sole purpose of complying with the Abstract requirement rules. This Abstract is submitted with the explicit understanding that it will not be used to interpret or to limit the scope or the meaning of the claims.

Abstract: A mass storage memory device is disclosed. The device includes a nonvolatile memory, a volatile memory configured to store logical to physical (L2P) data associating logical addresses of data stored in the nonvolatile memory with physical locations of the nonvolatile memory at which the data is stored, and a controller. The controller writes L2P data in the nonvolatile memory so the L2P data can be preserved through a power failure. The controller also writes L2P data stored in the nonvolatile memory to the volatile memory to rebuild the L2P table.

Abstract: The present application is directed to systems and methods for transferring data between data backup sites. Backup data for transferring from a source data backup site to a destination data backup site is determined based on a storage parameter, the backup data comprising data associated with a client device. A transfer parameter is received from the destination data backup site, the transfer parameter comprising a storage logical site available for data storage. The determined backup data is matched to the storage logical site based on a parameter selected from a group consisting of the storage parameter, and the transfer parameter. A transfer of the determined backup data to the storage logical site is scheduled based on a parameter selected from a group consisting of the storage parameter, the transfer parameter, and a schedule parameter.

Abstract: Multi-reliability regenerating (MRR) erasure codes are disclosed. The erasure codes can be used to encode and regenerate data. In particular, the regenerating erasure codes can be used to encode data included in at least one of two or more data messages to satisfy respective reliability requirements for the data. Encoded portions of data from one data message can be mixed with encoded or unencoded portions of data from a second data message and stored at a distributed storage system. This approach can be used to improve efficiency and performance of data storage and recovery in the event of failures of one or more nodes of a distributed storage system.

Abstract: The present application is directed to systems and methods for transferring data between data backup sites. A backup data transfer of data associated with a client device is scheduled, and backup data is transferred from a source data backup site to a destination data backup site. A backend process associated with the client device is suspended, and a determination is made as to whether all backup data for the client has transferred from the source backup data site to the destination backup data site. Responsive to the determination, the backend process associated with the client device is resumed.

Abstract: Embodiments of the present invention provide an approach for protecting and restoring data within a networked (e.g. cloud) storage computing environment through asynchronous replication and remote backup of data and its associated metadata. Under embodiments of the present invention, data backup and recovery functionality provides data backups by detecting incremental updates to the data and its associated metadata at specific points in time determined by policies. The policies are configurable based on user requirements. Multiple copies of the data backups can be made and stored in separate compressed files at backup/disaster recovery locations. The backups of data and its associated metadata, which includes file system configuration information can be used to restore the state of a computer file system to that of a given point-in-time. Accordingly, a data protection approach is disclosed for protecting data at both the file system level and application level.

Abstract: Disclosed herein are system, method, and computer program product embodiments for utilizing a backup catalog to perform synchronized backup and recovery of heterogeneous database systems. An embodiment operates by performing a global data backup of a heterogeneous database system comprising a first database management system (DBMS) at a first server and a second DBMS at a second server and recording a global data backup entry identifying the global data backup into a backup catalog. Upon receiving log backup notifications regarding asynchronous log backups on the first server and the second server, log backup entries identifying the asynchronous log backups are recorded into the backup catalog. To successfully perform a point-in-time recovery, the embodiment operates by using the backup catalog to identify data and log backups required for the recovery of the first and second servers to a recovery timestamp associated with the point-in-time recovery.

Abstract: A method for synchronously running an application in a high availability environment including a plurality of calculating modules interconnected by a very high-speed broad band network, includes: configuring the modules into partitions including a primary and a secondary partition and a monitoring partition; running the application on each running partition, inputs-outputs processed by the primary partition transmitted to the secondary running partition via the monitoring partition; synchronizing the runnings via exploiting microprocessor context changes; transmitting a catastrophic error signal to the monitoring partition; continuing the running by switching to a degraded mode, the running continuing on a single partition.

Abstract: A computer implemented method, system, and computer program product for non-disruptively moving a replicated volume from a first storage medium to a second storage medium, the method comprising notifying a first data protection appliance that the replicated volume is moving from a first storage medium to a second storage medium; setting a replication connection between second volume and target of the first volume while maintaining replication connection from first volume to target of the first volume.

Abstract: Exemplary embodiments of the present invention relate to a failure recovery apparatus of digital logic circuit and method thereof when a fault occurs in the digital logic circuit. A failure recovery apparatus according to an embodiment of the present invention comprises: a fault detection block configured to determine fault occurrence by comparing output results of a plurality of digital logic circuit which perform the same operation using a clock having a first cycle; and a failure recovery block configured to perform a failure recovery operation of the plurality of digital logic circuit by using a clock having a second cycle which is longer than the first cycle when it is determined as that a fault occurs. According to exemplary embodiments of the present invention, when a fault occurs in digital logic circuits due to external factors, it provides high reliability in failure recovery of the digital logic circuits.

Abstract: One embodiment provides a storage system. The storage system includes storage system control logic to identify at least one target storage device in response to detection of a failed storage device, request a state of a target device logical block address (LBA) from each of the at least one target storage device, and read data associated with a mapped device LBA from each target storage device and write the data to at least one replacement storage device. Another embodiment provides a storage device. The storage device includes device control logic to determine a state of a target device logical block address (LBA) in response to a request; a host interface to provide a reply to the request, the reply including a state indicator related to the state of the target device LBA; a map table including a plurality of device LBAs and respective state indicators; and non-volatile memory (NVM) including data related to at least one mapped LBA.

Abstract: A system and method for preventing cascading failures of clusters in a large-scale distributed system are disclosed. An example method begins with determining the current system conditions including the state and capacity of each cluster in the system. Given the current system conditions, the maximum number of entities that can be served by the system may be determined. The determined maximum number of entities are then served. In the event of a cluster failure, a determination is made as to whether the entire load from a cluster can be failed over by the system without creating cascading failures. Responsive to determining that the entire load from a cluster cannot be failed over by the system without creating cascading failures, a partial amount of cluster load is identified to failover in the event of cluster failure.

Abstract: A storage apparatus has a redundant configuration equipped with a plurality of components and includes a first controller and second controller, wherein the first controller is provided with a first processor and a third processor for monitoring the first controller; wherein the second controller is provided with a second processor and a fourth processor for monitoring the second controller; wherein the first processor and the second processor are connected via a first path and the third processor and the fourth processor are connected via a second path; and wherein if a failure occurs at the first controller, the second processor blocks the first path, acquires failure information including a failure location of the first controller via the third processor, the fourth processor, and the second path, executes first failure location identifying processing, and notifies a management terminal of the failure location.

Abstract: To prevent a user from initiating potentially dangerous virtual machine migrations, a storage migration engine is configured to be aware of replication properties for a source datastore and a destination datastore. The replication properties are obtained from a storage array configured to provide array-based replication. A recovery manager discovers the replication properties of the datastores stored in the storage array, and assigns custom tags to the datastores indicating the discovered replication properties. When storage migration of a virtual machine is requested, the storage migration engine performs or prevents the storage migration based on the assigned custom tags.

Abstract: A computer implemented method, system, and computer program for providing co-temporanious access to a single volume at a first site and a second site, the method comprising exposing the volume at the first site, exposing the volume at the second site; wherein the volume has the same identifier at the first site and the second site and wherein the write IO to the first volume is being replicated to the second volume, and redirecting IO to the second volume to the first volume.

Abstract: A recovery manager discovers replication properties of datastores stored in a storage array, and assigns custom tags to the datastores indicating the discovered replication properties. A user may create storage profiles with rules using any combination of these custom tags describe replication properties. The recovery manager protects a storage profile using a policy-based protection mechanism. Whenever a new replicated datastore is provisioned, the datastore is dynamically tagged with the replication properties of their underlying storage, and will belong to one or more storage profiles. The recovery manager monitors storage profiles for new datastores and protects the newly provisioned datastore dynamically, including any or all of the VMs stored in the datastore.

Abstract: A method for fault recognition in a distributed real-time computer system comprising fault containment units (FCUs), which has a global timebase, wherein the fault containment units communicate by means of messages via at least one message distribution unit, wherein a commitment time is associated with a message formed by a fault containment unit, and wherein a message distribution unit that receives a message relays the message to one or more fault containment units operating in parallel, and wherein a processing fault containment unit (VFCU) does not transmit or use any of its results that are influenced by one or more of the received messages to the environment of the processing fault containment unit or before the commitment times associated with the received messages.

Abstract: The invention relates to a method and apparatus. In the method, a programmable random access memory testing circuit detects a signal to initiate testing of at least one random access memory circuit, the testing circuit being connected to a bus to which a processor and the at least one memory circuit is connected, the at least one memory circuit comprising at least a first memory block. The testing circuit determines that the bus is not reserved and reserves the bus. The testing circuit reads application data in a first memory block to a temporary memory of the testing circuit. The testing circuit executes marching test for the first memory block in a memory circuit. The testing circuit returns the application data back to the first memory block in the memory circuit. The testing circuit releases the bus.