Abstract: For experience-based dynamic sequencing of a set of process options, a first process option is executed at a first stage in a first sequence for a first set of members. The sequence includes several stages of executing a subset of the process options. An experience value is determined corresponding to executing the first process option. The experience value is normalized to calculate a normalized experience value corresponding to the first process option. Using the normalized experience value in a later stage from the plurality of stages, an evaluation is made whether a first trigger threshold is satisfied in a first activation function of a second process choice. When the first trigger threshold of the first activation function being satisfied, the second process choice is included in the first sequence at the later stage.

Abstract: An information processing system includes a first server, a second server and an information processing apparatus, the information processing apparatus including a processor configured to manage a process of causing OS running on the first server to run on the second server, and the first server including a driver configured acquire an address of the physical memory area allocated for running Booting OS to boot the OS and a controller configured to notify the processor of the address of the physical memory area, wherein the processor causes the Booting OS to run at the address of the physical memory area of the first server or the second server, and causes the OS to run on the second server by transferring the OS to the second server from the first server.

Abstract: Computers are connected via multidimensional mesh or torus connection in a network. In response to a request for executing maintenance processing on computers in the network, an apparatus detects execution-scheduled jobs to be executed after an execution start time of the maintenance processing, based on execution-scheduled start times of jobs to be executed by the computers. The apparatus calculates, for each execution-scheduled job, a characteristic value of an axial length of an execution-scheduled job area in each axial direction of multidimensional axes in the network, where the execution-scheduled job area includes a group of computers to execute the each execution-scheduled job. The apparatus determines a maintenance area in the network on which the maintenance processing is to be executed, based on the characteristic values of the axial lengths of the execution-scheduled job areas, and executes the maintenance processing on computers in the maintenance area.

Abstract: A data processing system includes an interrupt controller that counts, as an interrupt processing execution count, executions of interrupt processing by threads executed by data processing devices; and a processor that is configured to select one scheduling method from among a plurality of scheduling methods, based on the interrupt processing execution count.

Abstract: A system for processing media on a resource restricted device, the system including a memory to store data representing media assets and associated descriptors, and program instructions representing an application and a media processing system, and a processor to execute the program instructions, wherein the program instructions represent the media processing system, in response to a call from an application defining a plurality of services to be performed on an asset, determine a tiered schedule of processing operations to be performed upon the asset based on a processing budget associated therewith, and iteratively execute the processing operations on a tier-by-tier basis, unless interrupted.

Abstract: Optimizing operational costs in a computing environment includes identifying high-cost jobs that are executed to generate one or more reports in the computing environment, identifying one or more reports the generation of which is dependent on the execution of the high-cost jobs, and culling at least a first job from among the high-cost jobs, in response to determining that a benefit achieved from the reports that depend on the first job does not justify costs associated with generating the reports.

Abstract: The present invention relates to a method for computing tasks by computing clients. The method comprises distributing tasks to the clients; the determination of the association between distributed task and clients is based on a minimization of a size of a union of the subsets of data associated with tasks distributed to computing clients of at least one group in the plurality of clients groups. In addition, for each current computing client in the plurality of computing clients retrieving the subset of data associated with the task distributed to said current computing client from the storage node of the group of the current computing client, and computing the task distributed to said current computing client based on said retrieved subset of data associated with the task distributed to said current computing client.

Abstract: A system for parallel execution of program portions on different processors permits speculative execution of the program portions before a determination is made as to whether there is a data dependency between the portion and older but unexecuted portions. Before commitment of the program portions in a sequential execution order, data dependencies are resolved through a token system that tracks read access and write access to data elements accessed by the program portions.

Abstract: An information processing system for processing jobs managed by a plurality of queues includes a first input unit, a determination unit, and a second input unit. The first input unit inputs a first job regularly generated in the information processing system to a first queue. The determination unit determines a queue to which a second job should be input, out of a plurality of queues, wherein the second job is generated upon reception of a request corresponding to an input via a screen provided by the information processing system. The second input unit inputs the second job to a queue determined to be an input target of the second job by the determining. The determination unit determines the queue to which the second job should be input based on a processing state of data to be processed for the second job.

Abstract: Examples may include techniques for allocating configurable computing resources from a pool of configurable computing resources to a logical server or virtual machine. The logical server or virtual machine may use allocated configurable computing resources to implement, execute or run a workload.

Abstract: A cloud services brokerage platform system includes a virtual data center (VDC) and an architecture management interface. The virtual data center (VDC) includes a plurality of resource groups. Each one of the resource groups includes one or more VDC resources. Each one of the VDC resources is associated with a respective set of resource group specification parameters. The architecture management interface enables an architectural layout of the one or more VDC resources to be displayed. The architectural layout includes a visual depiction of the one or more VDC resources of each one of the resource groups. An arrangement of the visual depiction is dependent upon the respective set of resource group specification parameters.

Abstract: The following description relates to a method and an apparatus for merging distributed stream processing services. A method for merging distributed stream processing services according to an example includes generating a global service tree based on one distributed stream processing service; when a new distributed stream processing service different from the one distributed stream processing service is inputted, generating an individual service tree for the new distributed stream processing service; and updating the global service tree by merging at least one node commonly existing in both the global service tree and the individual service tree. Common resources may be allocated to tasks (or instances) existing commonly in distributed stream processing services.

Abstract: A manager agent access a grain hierarchy that represents a state for a computation that is to performed by a distributed processing system, wherein the grain hierarchy includes manager agent grains including metadata for manager agent processes that manage the performance of the computation by the distributed processing system, and worker agent grains including, for tasks to be performed by the distributed processing system, metadata for worker agents that each correspond to a subset of the plurality of data processors for performing the task. A manager agent performs processes defined by a manager agent grain to manage the computation by worker agents and storing, within the grain, metadata describing the manager agent process performed by the manager agent, and worker agents perform tasks assigned to the worker agents based on an assignment of a respective worker agent grain to the worker agent.

Abstract: Adaptive queued locking for control of speculative execution is disclosed. An example apparatus includes a lock to: enforce a first quota to control a number of threads allowed to concurrently speculatively execute after being placed in a queue; and in response to the first quota not having been reached, enable a first thread from the queue to speculatively execute; and an adjuster to change a first value of the first quota based on a result of the speculative execution of the first thread.

Abstract: A communication terminal has communication circuit, a processor and a storing module operable to store a plurality of application programs. The terminal includes comprising: a table that a plurality of timer times are registered, a notifying module operable to notify expiration when reaching at a timer time that is registered in the table, an executing module operable to execute at least two or more application programs when the expiration is notified by the notifying module, and an enabling module operable to enable the communication circuit when executing the application program by the executing module. Communication is performed by the at least two or more application programs while the communication circuit is being enabled.

Abstract: Disclosed are an application management method and device, the method including: acquiring at least one piece of condition information, where at least one function of at least one application relies on the condition information; and judging whether a change occurs to a state of availability of a function of an application relying on the condition information according to the acquired condition information: if the change occurs, changing a state of the corresponding application according to the change. The device includes an acquisition module, a judgment module and an application state change module implementing the method. Resources consumed by an application are reduced as a condition on which a function of the application relies cannot satisfy normal use of the application, unnecessary user operations are reduced, and user experience is improved.

Abstract: Handling locale information on a computing platform, a computer obtains, in response to an event that an application is pushed to a computing platform, locale information corresponding to the application. The computer determines the type of the application, configures a runtime executable file required by the application according to the locale information corresponding to the application and the type of the application, creates a script for configuring a locale of an operating system on the computing platform consistent with the locale information corresponding to the application, and creates a droplet for the application that includes the configured runtime executable file required by the application and is associated with the created script.

Abstract: A computer-implemented method comprises executing, in a first container of a first computer system, input source instructions; executing, using the same first computer system, a plurality of containerized application programs in different corresponding containers; monitoring, by the input source instructions, the one or more different containerized application programs by identifying one or more system calls that resulted from the different container applications generating statistical messages relating to operation of the containerized application programs; generating, by the input source instructions, one or more enriched messages based on the system calls that were identified and based on the statistical messages; transmitting the one or more enriched messages to a first metric collector, and aggregating a plurality of the enriched messages into a set of aggregated metrics values; sending, from the first metric collector to a monitoring application that is hosted on a second computer system, the aggregated

Abstract: Described are methods, apparatus and computer programs for managing persistence within a data processing system such as a messaging system, database system or file system. The method for managing persistence includes a deferred evaluation (230,330,430) of at least one criterion associated with costs and/or benefits of saving to persistent storage, instead of persistence behaviour being fully predefined. The evaluation may be performed when a disk write is about to be performed (240,340,440), or at various times during processing of a data update and at various points within a data processing network. In a messaging solution, the method for managing persistence includes a dynamic evaluation (230,330,430) of costs and/or benefits of saving to persistent storage, with the evaluation being performed at various points in the messaging network after the message has been created and sent by the originating entity.

Abstract: This invention teaches how to use prediction software and algorithms to minimize the risk of failure, and to increase the likelihood of success of information technology (IT) and telecommunications system changes. The method identifies the systems, people, documents and other unanticipated consequences of system changes. The invention teaches how use of the prediction software and algorithms allow system administrators to find more advantageous ways and times to perform system changes.

Abstract: A method, apparatus, and/or computer program product analyzes data processing. Dependency metadata, which is used for representing dependency on data among at least two components of an application, is acquired. Error information, which is used for describing errors that occurred while running the application, and data output, which includes data output by components used to run the application, are acquired. Based on the error information, dependency metadata and data output relevant to the error information are analyzed to provide an analysis result. The analysis result includes at least one of: a prompt for an error correction method, a relevant dependency metadata leading to an occurrence of an error, and relevant data output leading to an occurrence of an error.

Abstract: A method for managing a storage system and an associated apparatus are provided. The method includes: providing at least one heartbeat monitoring path between a set of expander control circuits within an expansion module in the storage system, for transmitting at least one of a plurality of heartbeat monitoring signals for a set of management modules in the storage system, wherein the expansion module is utilized for installing a set of shared storage devices, and each shared storage device within the set of shared storage devices is coupled to the set of expander control circuits, to allow the set of management modules to control the set of shared storage devices through the set of expander control circuits, respectively; and performing heartbeat monitoring according to the plurality of heartbeat monitoring signals, for at least one of the set of management modules to perform high availability management on shared storage devices.

Abstract: A processor activates a first monitoring process for initializing a timer and a second monitoring process with higher priority than the first monitoring process. The processor executes the second monitoring process to monitor whether the first monitoring process has been executed. When determining that the first monitoring process has not been executed, the processor executing the second monitoring process determines whether the load state of the processor satisfies prescribed conditions. If the load state satisfies the prescribed conditions, the processor executing the second monitoring process initializes the timer.

Abstract: A dump management apparatus having a memory; and a processor that executes a process including: selecting, in response to receiving a notification of an occurrence of a failure from a failure node of a parallel computer having a plurality of nodes, a plurality of nodes that are not scheduled to execute a job within at least a first time needed to perform dump processing of a memory of the failure node and have a memory capacity needed to perform the dump processing as dump-processing target nodes from among a plurality of nodes within a reference range near the failure node; selecting the dump-processing target nodes with a first priority according to which a plurality of adjacent nodes are preferentially selected as a candidate over a plurality of dispersing nodes from among candidates for the dump-processing target nodes; and causing the failure node to transfer a dump file inside the memory of the failure node to memories of the dump-processing target nodes.

Abstract: Provided is a method of providing a fault management service in a cloud. During requisition of a cloud service involving a service element provided by the cloud it is determined whether solutions are available for potential faults related to the service element. The available solutions are highlighted for potential faults related to the service element to a user. Upon selection of a highlighted solution by the user, the selected solution is applied to the service element.

Abstract: An apparatus includes at least one processor to implement a communicator configured to determine whether a wakeup condition of the apparatus is satisfied while the apparatus is currently in a sleep mode, and transmit a wakeup command and a recover communication command in response to determining that the wakeup condition is satisfied; and an operator configured to perform a wakeup operation in response to the wakeup command and, and control communication of the communicator to be recovered in response to the recover communication command.

Abstract: A computing device for correcting data errors may receive data stored by a memory device; calculate a syndrome associated with the data; initiate a calculation of error correction information for the data based on the syndrome; search for the error correction information in a cache based on the syndrome; discontinue the calculation of the error correction information when the error correction information is found in the cache before the error correction information is calculated; and correct an error associated with the data using the error correction information from the cache.

Abstract: A system and method of performing selective error coding in memory management of a memory device are described. The method includes performing a process of detecting and correcting memory errors in the memory of the memory device either prior to or after a chip mark associated with the memory device is in place. The method also includes localizing hard errors of the memory device based on a second process of detecting the memory errors in the memory of the memory device, the hard errors being persistent memory errors that persist from the process of detecting and correcting the memory errors to the second process, determining an extent of the hard errors based on the localizing, and preventing placement of the chip mark or removing the chip mark after de-allocating one or more ranges of addresses based on a result of the determining the extent of the hard errors.

Abstract: A system and method of performing selective error coding in memory management of a memory device are described. The method includes performing a process of detecting and correcting memory errors in the memory of the memory device either prior to or after a chip mark associated with the memory device is in place. The method also includes localizing hard errors of the memory device based on a second process of detecting the memory errors in the memory of the memory device, the hard errors being persistent memory errors that persist from the process of detecting and correcting the memory errors to the second process, determining an extent of the hard errors based on the localizing, and preventing placement of the chip mark or removing the chip mark after de-allocating one or more ranges of addresses based on a result of the determining the extent of the hard errors.

Abstract: The semiconductor memory device includes first group dies including at least one buffer die, and second group dies including a plurality of memory dies stacked on the first group dies and conveying data through a plurality of TSV lines. Here, at least one of the plurality of memory dies includes a first type ECC circuit which generates transmission parity bits using transmission data to be transmitted to the first group die, and the buffer die includes a second type ECC circuit which corrects, when a transmission error occurs in the transmission data received through the plurality of TSV lines, the transmission error using the transmission parity bits and generates error-corrected data.

Abstract: An SSD controller maintains a zero count and a one count, and/or in some embodiments a zero/one disparity count, for each read unit read from an SLC NVM (or the lower pages of an MLC). In an event that the read unit is uncorrectable in part due to a shift in the threshold voltage distributions away from their nominal distributions, the maintained counts enable a determination of a direction and/or a magnitude to adjust a read threshold to trade the threshold voltage shift and restore the read data zero/one balance. In various embodiments, the adjusted read threshold is determined in a variety of described ways (counts, percentages) that are based on a number of described factors (determined threshold voltage distributions, known stored values, past NVM operating events). Extensions of the forgoing techniques are described for MLC memories.

Abstract: A method includes generating a first error correcting code (ECC) codeword and a second ECC codeword. The method further includes generating redundancy information based on at least a portion of the first ECC codeword and further based on at least a portion of the second ECC codeword. The method further includes storing the first ECC codeword, the second ECC codeword, and the redundancy information at a word line of a memory of a data storage device.

Abstract: The present invention is related to systems and methods for storing and recovering data from a distributed storage system.

Abstract: A data storage method is used to improve storage consistency of a distributed storage system. The method includes: a primary storage node performs EC coding on a to-be-stored data segment to obtain a target EC stripe; determines in a storage node group to which the primary storage node belongs, m+k target storage nodes used to store m+k target EC blocks of the target EC stripe; sends a preparation message to the target storage nodes; receives a response message sent by a target storage node; and sends an execution message to the target storage nodes to instruct the target storage nodes to write target EC blocks that are in preparation logs.

Abstract: A method includes determining whether to request retrieval of the data segment from at least one of redundant array of independent discs (RAID) memory and dispersed storage network (DSN) memory. The method further includes, when the computing device determines to request retrieval from the RAID memory, sending a read request to the RAID memory. When the retrieval of the data segment from the RAID memory was unsuccessful, the method further includes generating a set of read requests regarding a set of encoded data slices corresponding to the data segment. The method further includes sending the set of read requests to a set of storage units of the DSN memory. The method further includes receiving at least a decode threshold number of encoded data slices from at least some storage units. The method further includes decoding the at least the decode threshold number of encoded data slices to recover the data segment.

Abstract: Software that provides a subset of error correcting code (ECC) bits to be used for parity purposes. The software performs the following steps: (i) providing, in a data block, a first set of redundant bits adapted to detect and correct errors in the data block, based, at least in part, on a first set of error detection/correction (EDC) requirements; and (ii) providing, within the first set of redundant bits, a first sub-set of parity bit(s) adapted to provide single bit error detection for the data block. The EDC requirements include: (i) a minimum hamming distance, and (ii) the bit(s) in the first set of redundant bits that are not in the first sub-set of parity bit(s) include enough bit(s) to create at least P unique (M-2)-tuples, where P equals the number of bits in the first sub-set of parity bits, and where M equals the minimum hamming distance.

Abstract: A method includes identifying an encoded data slice for rebuilding. The method further includes determining whether a rebuilding threshold for the set of encoded data slices has been reached. When the rebuilding threshold has been reached, the method further includes determining, based on a condition of the DSN, whether to execute a rebuilding function, to delay execution of the rebuilding function, to adjust a rebuilding network protocol, or to modifying rebuilding criteria. When the determination is to execute the rebuilding function, the method further includes rebuilding the encoded data slice.

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: Methods, storage facilities and computer software products implement embodiments of the present invention that include mapping, by a storage system including one or more storage devices, a set of storage blocks on a given storage device to a redo log file configured to store transactions performed by a transaction processing system. An archiving condition is specified, and upon the transaction processing system completing a given transaction a copy of the given transaction is stored to the redo log file. Upon the archiving condition being met, the storage system can remap the set of storage blocks to an archive log file.

Abstract: Capturing post-snapshot quiescence writes in a linear image backup chain. In one example embodiment, a method for capturing post-snapshot quiescence writes in a linear image backup chain may include taking a first snapshot of a source storage at a first point in time using a Volume Shadow Copy Service (VSS), identifying a first set of block positions of blocks that are allocated in the source storage at the first point in time, identifying a second set of block positions of blocks that are written to the first snapshot during post-snapshot quiescence of the first snapshot by the VSS or by one or more VSS writers, resulting in a first quiesced snapshot, copying the blocks in the first set from the first snapshot to a full image backup, and copying the blocks in the second set from the first quiesced snapshot to a first incremental image backup.

Abstract: Capturing post-snapshot quiescence writes in an image backup. In one example embodiment, a method for capturing post-snapshot quiescence writes in an image backup may include taking a first snapshot of a source storage at a first point in time using a Volume Shadow Copy Service (VSS), identifying a first set of block positions of blocks that are allocated in the source storage at the first point in time, identifying a second set of block positions of blocks that are written to the first snapshot during post-snapshot quiescence of the first snapshot by the VSS or by one or more VSS writers, resulting in a first quiesced snapshot, calculating a third set of block positions by performing a Boolean OR operation on the first and second sets of block positions, and copying blocks in the third set of block positions from the first snapshot to a full image backup.

Abstract: A system for disaster recovery including a controller (i) for controlling bandwidth usage of a disaster recovery system in accordance with a plurality of recovery point objectives (RPOs), each RPO designating a maximal time loss constraint for data recovery for an enterprise production system, and a corresponding bandwidth allocation for the disaster recovery system to use in replicating data for the enterprise production system, wherein the RPOs are applied in accordance with a calendar-based schedule of dates and times, and (ii) for issuing an RPO alert when the RPO maximal time loss constraint for a current date and time is not satisfied.

Abstract: Restoring a virtual machine is disclosed. An indication of the virtual machine of a primary site to be restored at a remote site using a copy stored at the remote site of a backup data of the virtual machine of the primary site is received. The virtual machine is restored to the remote site using a backup application deployed at the remote site as a virtual appliance managed using a virtual environment management platform.

Abstract: Method and system for asynchronously dispersing Disaster Recovery (DR) enabling data between a plurality of storage sites. The method comprises: receiving, at a primary storage site, a written block and a write frequency counter associated with the written block. In case the write frequency counter is below a threshold: receiving information dispersal parameters including number indicative of a size difference between said written block and DR enabling data based on said written block; number of slices to slice said DR enabling data into and data indicative of DR storage sites of said plurality of storage sites for storing said slices. Further calculating DR enabling data based on written block, wherein DR enabling data is larger than said written block by size difference; slicing DR enabling data in accordance with number of slices; and dispersing slices in accordance with data indicative of DR storage sites.

Abstract: Technologies for hardware-assisted application checkpointing include a computing device having a processor with hardware checkpoint support. In response to encountering a checkpoint event during execution of an application, the computing device saves the execution state of the application to nonvolatile storage using the hardware checkpoint support. The computing device may also restore the execution state using the hardware checkpoint support. The hardware checkpoint support may save part or all of the virtual memory space of the application in a manner transparent to the executing process. The hardware checkpoint support may be invoked using one or more system hooks such as system calls or processor instructions. The computing device may monitor for checkpoint events using hardware event monitors of the processor, chipset, or other components of the computing device. The computing device may store execution state in a dedicated flash memory cache. Other embodiments are described and claimed.

Abstract: A method includes sending a data retrieval request regarding a data segment of a data object to redundant array of independent disk (RAID) memory and to dispersed storage network (DSN) memory. The method further includes receiving a first read response from a first one of the RAID memory and the DSN memory. The method further comprises recovering the data segment from the first read response. The method further includes determining whether to wait for a second read response from a second one of the RAID memory and the DSN memory. When the computing device determines to wait, the method further includes receiving the second response within a given time frame. The method further includes recovering a copy of the data segment from the second read response. When the data segment substantially matches the copy of the data segment, the method further includes utilizing either the data segment or the copy of the data segment.

Abstract: A computer, hypervisor, and method are disclosed for allocating physical cores for maintaining an OS without changing the number of logical cores even if physical cores become an obstacle, and for suppressing the performance of a virtual computer from deteriorating. The hypervisor allocates a first physical core to a first logical core of a first virtual machine, and allocates a plurality of physical cores to one or more logical cores of a second virtual computer. When an obstacle occurs in the first physical core, the hypervisor allocates, to one or more logical cores, the physical cores other than the second physical core among the plurality of physical cores allocated to the one or more logical cores of the second virtual computer. The hypervisor changes the physical core allocated to the first logical core from the first physical core in which the obstacle occurred to the second physical core.

Abstract: One or more techniques and/or systems are provided for dynamic mirroring. A first storage node and the second storage node within a first storage cluster may locally mirror data between one another based upon a local failover partnership. The first storage node and a third storage node within a second storage cluster may remotely mirror data between one another based upon a primary disaster recovery partnership. If the third storage node fails, then the first storage node may remotely mirror data to a fourth storage node within the second storage cluster based upon an auxiliary disaster recovery partnership. In this way, data loss protection for the first storage node may be improved, such that the fourth storage node provide clients with access to mirrored data from the first storage node in the event the second storage node and/or the third storage node are unavailable when the first storage node fails.

Abstract: A method provides rebuilding data in a hot spare storage device when multiple storage devices fail in a storage system. The method includes a storage controller determining if a first storage device storing first data has failed within a first group of storage devices. In response to the first storage device failing, the first data is rebuilt in the hot spare storage device from a copy of the first data stored in a first mirrored storage device of the first group of storage devices. In response to a second storage device failing, third data is generated by performing a first exclusive or (XOR) operation with the first data stored on the hot spare storage device and a copy of the second data stored in a second mirrored storage device of the second group of storage devices. The third data is rebuilt in the hot spare storage device. The method recovers original data and prevents complete failure of a virtual disk.

Abstract: A technique is provided for accumulating failures. A failure of a first row is detected in a group of array macros, the first row having first row address values. A mask has mask bits corresponding to each of the first row address values. The mask bits are initially in active status. A failure of a second row, having second row address values, is detected. When none of the first row address values matches the second row address values, and when mask bits are all in the active status, the array macros are determined to be bad. When at least one of the first row address values matches the second row address values, mask bits that correspond to at least one of the first row address values that match are kept in active status, and mask bits that correspond to non-matching first address values are set to inactive status.