Abstract: Implementations of the present invention allow software resources to be duplicated efficiently and effectively while offline. In one implementation, a preparation program receives an identification of a software resource, such as a virtual machine installed on a different volume, an offline operating system, or an application program. The preparation program also receives an indication of customized indicia that are to be removed from the software resource. These indicia can include personalized information as well as the level of software updates, security settings, user settings or the like. Upon execution, the preparation program redirects the function calls of the preparation program to the software resource at the different volume (or even the same volume) while the software resource is not running. The preparation program thus can thus creates a template of the software resource in a safe manner without necessarily affecting the volume at which the preparation program runs.

Abstract: A data stream processing unit (DPU) and methods for its use and programming are disclosed. A DPU includes a number of processing elements (PEs) arranged in a physical sequence. Each datum in the data stream visits each PE in sequence. Each PE has a memory circuit, data and metadata input and output channels, and a computing circuit. The metadata input represents a partial computational state that is associated with each datum as it passes through the DPU. Each computing circuit implements a finite state machine that operates on the data and metadata inputs as a function of its position in the sequence and a data context, producing an altered partial computational state that accompanies the datum. When the data context changes, the current state of the finite state machine is stored, and a new state is loaded. The processing elements may be collectively programmed to perform any desired computation.

Abstract: In accordance with embodiments disclosed herein, there are provided mechanisms and methods for automating deployment of applications in a multi-tenant database environment. For example, in one embodiment, mechanisms include managing a plurality of machines operating as a machine farm within a datacenter by executing an agent provisioning script at a control hub, instructing the plurality of machines to download and instantiate a lightweight agent; pushing a plurality of URL (Uniform Resource Locator) references from the control hub to the instantiated lightweight agent on each of the plurality of machines specifying one or more applications to be provisioned and one or more dependencies for each of the applications; and loading, via the lightweight agent at each of the plurality of machines, the one or more applications and the one or more dependencies for each of the one or more applications into memory of each respective machine.

Abstract: A system provides determination of a first plurality of the plurality of data records assigned to a first processing unit, identification of a first record of the first plurality of data records, the first record associated with a first key value, determination of a first partition based on the first key value, allocation of a first memory block associated with the first partition, the first memory block comprising a first two or more memory locations, generation of a mapping between the first record and a first one of the first two or more memory locations, identification of a second record of the first plurality of data records, the second record associated with a second key value, determination of the first partition based on the second key value, and generation of a mapping between the second record and a second one of the first two or more memory locations.

Abstract: According to one exemplary embodiment, a method for dynamically timing out a first process within a plurality of suspended processes is provided. The method may include determining that a second process is attempting to suspend. The method may also include determining if a number of suspended processes plus one is less than a threshold value. The method may then include selecting the first process within the plurality of suspended processes to prematurely time out based on determining that the number of suspended processes plus one is not less than the threshold value. The method may further include timing out the selected first process. The method may also include suspending the second process.

Abstract: According to one exemplary embodiment, a method for dynamically timing out a first process within a plurality of suspended processes is provided. The method may include determining that a second process is attempting to suspend. The method may also include determining if a number of suspended processes plus one is less than a threshold value. The method may then include selecting the first process within the plurality of suspended processes to prematurely time out based on determining that the number of suspended processes plus one is not less than the threshold value. The method may further include timing out the selected first process. The method may also include suspending the second process.

Abstract: An information presentation device includes: a situation estimation unit configured to identify one or more tasks based on input information that has been input and task information indicating one or more tasks indicating a situation; a load estimation unit configured to identify one or more sub-tasks based on each of the identified tasks and sub-task information indicating, for each situation of a task, one or more sub-tasks, which are work elements, having a possibility of being executed by a worker, and to acquire a load demand amount based on the identified sub-tasks and sub-task demand amount information indicating a load demand amount, which is a mental load for each sub-task; a capacity level estimation unit configured to acquire a capacity level based on the acquired load demand amount; and a presentation information selection unit configured to select information to be presented based on the capacity level.

Abstract: In one implementation, a job dispatch engine can comprise a job engine to retrieve a job from a job store, a preference engine to receive a set of preference information, a validation engine to identify availability of an execution environment associated with the set of preference information, and a dispatch engine to dispatch the job to the execution environment based on the availability. In another implementation, a method for dispatching a job can comprise receiving a job from a job store, interrogating a source for an environment preference, identifying an execution environment based on the environment preference and a policy rule, and validating the execution environment for availability to execute the job.

Abstract: A method for estimating job start times on a system may include: performing a first simulation of the system by a first process to generate a first estimate of the start time based a first snapshot of the computing system; and performing a second simulation of the system to generate a second estimate of the start time. The first and second estimates may each be either a distinct time estimate or a range of time estimate, depending on whether the simulations dispatches the job before the respective first and second processes end. The method may then include generating a fifth estimate of the time that the computing job will start by a third process based on estimates respectively generated by the first and second processes.

Abstract: Systems, methods, and computer program products configured to perform an operation comprising determining that use of a system resource of a first host system exceeds a threshold, wherein the first host system executes a plurality of virtual machines in a cloud computing environment, identifying a first virtual machine, of the plurality of virtual machines, for migration based on a first migration policy, of a plurality of migration policies, wherein the plurality of migration policies specify a respective set of rules for identifying virtual machines for migration, and migrating the first virtual machine to a second host system in the cloud computing environment to reduce the use of the system resource on the first host system.

Abstract: An apparatus, computer-readable medium, and computer-implemented method for performing a data exchange, including receiving tasks for execution, generating an execution plan for executing the tasks on a plurality of nodes, the execution plan comprising one or more data exchanges, each data exchange comprising at least one stream, and each stream identifying a producer task and a consumer task and being configured to transmit output of the producer task as input to the consumer task, executing one or more producer tasks on one or more first nodes in the plurality of nodes based at least in part on the execution plan, and transmitting an output of the one or more producer tasks from the one or more first nodes to one or more streams of the data exchange via a stream application programming interface (API).

Abstract: Implementations for a user interface for MapReduce job are disclosed. A method of the disclosure includes receiving a request to submit a MapReduce job to a cluster and providing a first graphical user interface (GUI) to input a first set of arguments and first argument values for a first portion of the arguments. The method may include receiving, from the first GUI, the first argument values and a second portion of the arguments, associated with a configuration of the cluster and without a corresponding argument value. The method may provide a second GUI that is to display the arguments, first argument values, and allow for a selection of second argument values for the second portion of the arguments. In response to a selection, the method may execute the MapReduce job in view of the first argument values from the first GUI and the second argument values from the second GUI.

Abstract: A method of partitioning tasks on a multi-core ECU. A signal list of a link map file is extracted in a memory. Memory access traces relating to executed tasks are obtained from the ECU. A number of times each task accesses a memory location is identified. A correlation graph between the each task and each accessed memory location is generated. The correlation graph identifies a degree of linking relationship between each task and each memory location. The correlation graph is re-ordered so that the respective tasks and associated memory locations having greater degrees of linking relationships are adjacent to one another. The tasks are partitioned into a respective number of cores on the ECU. Allocating tasks and memory locations among the respective number of cores is performed as a function of substantially balancing workloads with minimum cross-core communication among the respective cores.

Abstract: A resource assignment capability is presented. A resource specification associated with a plurality of elements is received. The resource specification includes, for each of the elements, a resource request including an indication of a quantity of resources requested by the element and a resource offer including an indication of a quantity of resources offered by the element for use by one or more other elements. A resource assignment, including an indication of an association between the resources requests and the resource offers, is determined using a resource assignment process. The resource assignment process may be a greedy assignment process or a maximum flow resource assignment process. The maximum flow resource assignment process includes constructing a maximum flow resource graph based on the one or more resource specifications and applying a maximum flow process to the maximum flow resource graph to determine thereby the resource assignment.

Abstract: A method for estimating job start times on a system may include: performing a first simulation of the system by a first process to generate a first estimate of the start time based a first snapshot of the computing system; and performing a second simulation of the system to generate a second estimate of the start time. The first and second estimates may each be either a distinct time estimate or a range of time estimate, depending on whether the simulations dispatches the job before the respective first and second processes end. The method may then include generating a fifth estimate of the time that the computing job will start by a third process based on estimates respectively generated by the first and second processes.

Abstract: Optimized placement of virtual machines in a cloud environment is based on factors that include processor-memory affinity. A smart migration mechanism (SMM) predicts an optimization score for multiple permutations of placing virtual machines on a target system to create an optimal move list. The optimization score is a theoretical score calculated using dynamic platform optimization (DPO). The SMM may allow the user to set initial parameters and change the parameters to create potential changes lists. The move lists are ranked to allow the user to select the optimal change list to provide the best affinity, quickest fulfillment of requirements and least disruption for a given set of parameters.

Abstract: Optimized placement of virtual machines in a cloud environment is based on factors that include processor-memory affinity. A smart migration mechanism (SMM) predicts an optimization score for multiple permutations of placing virtual machines on a target system to create an optimal move list. The optimization score is a theoretical score calculated using dynamic platform optimization (DPO). The SMM may allow the user to set initial parameters and change the parameters to create potential changes lists. The move lists are ranked to allow the user to select the optimal change list to provide the best affinity, quickest fulfillment of requirements and least disruption for a given set of parameters.

Abstract: A method of predicting resource bottlenecks for an information technology system processing mixed workloads includes determining, through a processor, a probability that one or more of a plurality of requests will access one of a plurality of resources, determining, through the processor, a performance metric of the one of the plurality of requests, identifying, through the processor, a potential hot spot based on the performance metric, calculating, through the processor, a probability that each of the plurality of requests will concurrently execute on the one of the plurality of resources, and providing, through the processor, an alert predicting that a bottleneck could occur at the one of the plurality of resources.

Abstract: A common resource to be updated is logically divided among the respective threads, and update processing is performed in parallel among a plurality of cores. The common resource updating apparatus comprises a processor which controls an execution of a program configured from a plurality of threads, and updates a common resource including a plurality of areas associated with the plurality of threads, wherein the processor causes at least one thread among the plurality of threads to be an update thread which updates an area of the common resource associated with the thread, and causes a thread that is different from the update thread to be a reference thread which sends an update request to the update thread upon updating the common resource, and directly refers to the common resource upon referring to the common resource.

Abstract: Embodiments of the present invention provide systems and methods for resource allocation. The systems and methods for resource allocation include: configuring a plan to utilize computer resources; partitioning computer resources; and applying a set of two or more hypervisors, which use a single service processor, to execute the plan to utilize computer resources. The hypervisors facilitate the partitioning of the computer resources, group partitions of the computer resources, control access to nodes, and change node boundaries.

Abstract: A method, program product, and system is provided for dynamic virtual processor management in a computer having a plurality of concurrent multi-threaded physical processors. A workload is assigned to a first virtual processor manager pool based on a virtual processor manager mode of the first virtual processor manager pool. A current utilization ratio and a response time ratio for the workload are calculated. The workload is dynamically moved to a second virtual processor manager pool based on either the current utilization ratio or the response time ratio exceeding a configurable threshold. The workload is dynamically moved between virtual processor manager pools to realize target performance metric requirements.

Abstract: Provided is a processing apparatus, including: a plurality of processing unit; at least one or more data buffers that are connected between a first processing unit and a second processing unit and is able to store data output from the first processing unit and data input to the second processing unit; a command buffer that stores a task command specifying execution of a task to be executed in one or more specific processing units, the command buffer being able to output the task command to the processing unit; and a task control unit that is configured to control operational processing in the task, by controlling at least one of the data buffer and the command buffer, on the basis of the task command, task setting information representing the processing unit in which the task is executed, and information representing a state of operational processing in respective processing unit.

Abstract: Fine-grained parallelism within isolated object graphs is used to provide safe concurrent operations within the isolated object graphs. One example provides an abstraction labeled IsolatedObjectGraph that encapsulates at least one object graph, but often two or more object graphs, rooted by an instance of a type member. By encapsulating the object graph, no references from outside of the object graph are allowed to objects inside of the object graph. Also, the encapsulated object graph does not contain references to objects outside of the graphs. The isolated object graphs provide for safe data parallel operations, including safe data parallel mutations such as foreach loops. In an example, the ability to isolate the object graph is provided through type permissions.

Abstract: Computational tasks are mapped with computational locations in a distributed system such as a cloud computing environment. Mapping does not rely on workload estimates. Instead, tasks whose prerequisite tasks or other preconditions are determined to be mutually exclusive are co-located, while other tasks are mapped to different locations than one another. Locations are servers, processor cores, virtual machines, applications, or computational processes, for example. Mutual exclusivity may be determined by detecting that preconditions require different values of a shared variable in order to be satisfied, for example, or determining that preconditions correspond to different branches of a conditional programming statement. A satisfiability engine may also provide a satisfiability determination. Co-located tasks may also be batched, for improved execution performance.

Abstract: A native function bound to JavaScript is registered in API information 303, and by controlling to enable usage or disable usage of the native function in accordance with a display state of an application that uses WebView 302, it becomes possible to guarantee security of each application more simply.

Abstract: Various embodiments are generally directed to techniques to remotely access object events. An apparatus may comprise a processor and a memory communicatively coupled to the processor. The memory may be operative to store a remote event bridge having a surrogate object that when executed by the processor is operative to allow an observer object for a first process to subscribe to an event of a subject object for a second process using the surrogate object. In this manner, the remote event bridge and the surrogate object operates as an interface between subject objects and observer objects without any modifications to either class of objects.

Abstract: An electronic device includes a memory having memory locations being subject to transient faults and permanent faults, and a fault detection circuit coupled to the memory. The fault detection circuit is configured to read the memory locations at a first time, and determine a first fault count and fault map signature including the transient and permanent faults at the first time based upon reading the plurality of memory locations, and to store the first fault count and fault map signature. The fault detection circuit is configured to read the memory locations at a second time and determine a second fault count and fault map signature including the transient and permanent faults at the second time based upon reading the memory locations, and compare the stored first fault count and fault map signature with the second fault count and fault map signature to determine a permanent fault count.

Abstract: The technology disclosed relates to detecting anomalous behavior of network components in a complex network setting.

Abstract: The technology disclosed relates to building ensemble analytic rules for reusable operators and tuning an operations monitoring system. In particular, it relates to analyzing a metric stream by applying an ensemble analytical rule. After analysis of the metric stream by applying the ensemble analytical rule, quantized results are fed back for expert analysis. Then, one or more type I or type II errors are identified in the quantized results, and one or more of the parameters of the operators are automatically adjusted to correct the identified errors. The metric stream is further analyzed by applying the ensemble analytical rule with the automatically adjusted parameters.

Abstract: In a model check with respect to a distributed environment model, in order to reduce redundant search, wasteful search is avoided and efficient search is enabled.

Abstract: Apparatus, device, methods and system relating to a vehicular telemetry environment for the for identifying in real time unpredictable network communication faults based upon pre-processed raw telematics big data logs that may include GPS data and an indication of vehicle status data, and supplemental data that may further include location data and network data.

Abstract: A controller includes a link interface that is to couple to a first link to communicate bi-directional data and a second link to transmit unidirectional error-detection information. An encoder is to dynamically add first error-detection information to at least a portion of write data. A transmitter, coupled to the link interface, is to transmit the write data. A delay element is coupled to an output from the encoder. A receiver, coupled to the link interface, is to receive second error-detection information corresponding to at least the portion of the write data. Error-detection logic is coupled to an output from the delay element and an output from the receiver. The error-detection logic is to determine errors in at least the portion of the write data by comparing the first error-detection information and the second error-detection information, and, if an error is detected, is to assert an error condition.

Abstract: Various exemplary embodiments relate to a method performed by a first processor for managing a second processor, wherein both processors have access to a same external memory, the method comprising: monitoring performance of the second processor by the first processor running sanity polling, wherein sanity polling includes checking the same external memory for status information of the second processor; performing thread state detection by the first processor, for threads executing on the second processor; and performing a corrective action as a result of either the monitoring or the performing.

Abstract: An electronic circuit includes a microcontroller processor (410), a peripheral (420) coupled with the processor, an endian circuit (470) coupled with the processor and the peripheral to selectively provide different endianess modes of operation, and a detection circuit (140) to detect a failure to select a given endianess, whereby inadvertent switch of endianess due to faults is avoided. Other circuits, devices, systems, methods of operation and processes of manufacture are also disclosed.

Abstract: Various embodiments of systems and methods to display an additional message information relevant to a product are described herein. Initially a determination is made whether error message, corresponding to a data processing error related to a product, has a corresponding additional message information related to the product. Next, based on the determined additional message information, an additional message information property of the error message is updated to indicate that the error message has the corresponding additional information. Next, based on the updated additional message information property, the additional message information is converted to obtain a converted additional message information in a markup language. Finally the converted additional message information is forwarded to a user interface, where it is displayed.

Abstract: In an enterprise environment that includes multiple data centers each having a number of first servers, computer-implemented methods and systems are provided for detecting faulty storage device(s) that are implemented as redundant array of independent disks (RAID) in conjunction with each of the first servers. Each first server monitors lower-level health metrics (LHMs) for each of the storage devices that characterize read and write activity of each storage device over a period of time. The LHMs are used to generate high-level health metrics (HLMs) for each of the storage devices that are indicative of activity of each storage device over the period of time. Second server(s) of a monitoring system can use the HLMs to determine whether each of the storage devices have been inactive or active, and can generate a fault indication for any storage devices that were determined to be inactive while storage device(s) at the same first server were determined to be active.

Abstract: An electronic device includes functional modules, gates, monitor module, signal control module and record module. The functional modules are operated on clock signal for generating request instruction and response signal. The gate is coupled to the functional modules for transmitting request instruction and response signal to functional module on enable signals. The monitor module is coupled to the functional modules and the gates for generating hold signal. The monitor module generates enable signals on finish signal. The clock signal control module coupled to the functional modules and the monitor module for outputs main clock signal to generate clock signals. The clock signal control module generates record instruction and stop clock signals, and the clock signal control module re-outputs clock signals on finish signal. The record module coupled to the functional modules and the clock signal control module begins to record request instruction and response signal when receiving record instruction.

Abstract: A method includes transmitting an output file to a safety manager, where the output file is based on a configuration file associated with a plurality of inputs and outputs of the safety manager. The method also includes, for each input/output (I/O) channel of the safety manager to be tested, (i) displaying information associated with an expected state of the I/O channel, (ii) instructing the safety manager to simulate a particular operating condition in association with the I/O channel, (iii) receiving a response from the safety manager when the I/O channel is shorted, where the response indicates whether or not the I/O channel is operating correctly, and (iv) displaying the response.

Abstract: A method begins by a dispersed storage (DS) processing module transmitting a set of write commands for storing a set of encoded data slices in storage units of a dispersed storage network (DSN) and determining whether at least a first threshold number of write responses have been received within a response time period. When the at least the first threshold number of the write responses have been received within the response time period, the method continues with the DS processing module determining whether a total number of responses have been received within another response time period. When the total number of responses have not been received within the other response time period, the method continues with the DS processing module issuing a sub-set of write commit commands corresponding to a response number of encoded data slices for which a response was received.

Abstract: An apparatus is described that includes a semiconductor chip having memory controller logic circuitry. The memory controller logic circuitry has compression circuitry to compress a cache line data structure to be written into a system memory. The memory controller logic circuitry has adjustable length ECC information generation circuitry to generate an amount of ECC information for the cache line data structure based on an amount of compression applied to the cache line data structure by the compression circuitry. The memory controller logic having circuitry to implement a write process sequence for the cache line data structure that is specific for the cache line data structure's amount of compression and/or amount of ECC information and to implement a different write process sequence that is specific for another cache line data structure having a different amount of compression and/or ECC information as the cache line data structure.

Abstract: Methods and apparatus to measure detect and correct errors in destructive read non-volatile memory are disclosed. In some examples, the method and apparatus determine, in response to stabilizing a power supply, a status signature stored in non-volatile memory. In examples wherein the status signature is not normal, the methods and apparatus decode an error correction code that is encoded in a destructive read non-volatile memory.

Abstract: A memory sub-system may include a memory controller having error correction code (ECC) encoder/decoder logic. The memory controller may be configured to embed link ECC parity bits in unused data mask bits and/or in a mask write data during a mask write operation. The memory controller may also be configured to protect at least a location of the link ECC parity bits during the mask write operation.

Abstract: A memory device may include link error correction code (ECC) decoder and correction circuitry. The ECC decoder and correction circuitry may be arranged in a write path and configured for link error detection and correction of write data received over a data link. The memory device may also include memory ECC encoder circuitry. The memory ECC encoder circuitry may be arranged in the write path and configured for memory protection of the write data during storage in a memory array.

Abstract: A utilization efficiency of a memory is improved. A codeword generation unit generates a codeword in an error detection and correction code from data to be encoded. A write control unit writes one of data obtained by inverting the codeword and the codeword into the memory cell as write data. A read data error correction unit reads out the write data from the memory cell as read data, and corrects an error in the read data. An inversion data error correction unit corrects an error in inversion data obtained by inverting the read data. A correction data output unit, when the number of errors of either only one of the read data and the inversion data does not exceed an error correction capability of the error detection and correction code, selects and outputs the one where the error is corrected as correction data.

Abstract: A method of operating a semiconductor memory device including a memory cell array and an error correction circuit is provided as follows. A write command, main data and an address are received from a memory controller. An error correction data unit is provided to the error correction circuit. The error correction data unit includes the main data. At least one parity bit is generated based on the error correction data unit. A write operation is performed, in response to the write command, on a target page selected by the address so that the at least one parity bit and the main data are written to the target page and the at least one parity data is written later than the main data to the target page.

Abstract: Methods, systems and computer-readable storage media for programming, by a storage controller, particular data stored in an allocated buffer to a particular one of a plurality of non-volatile memories (NVMs). Redundancy information may be updated sufficient to recover from failures of the plurality of NVMs. The allocated buffer may be freed prior to and independent of the particular NVM completing the programming. The particular data may continue to be programmed independent of freeing the allocated buffer. The continuing of the programming of the particular data may include determining whether there are any failures of the programming the particular data.

Abstract: A method for preventing data loss in a RAID includes monitoring the age of storage drives making up a RAID. When a storage drive in the RAID reaches a specified age, the method individually tests the storage drive by subjecting the storage drive to a stress workload test. This stress workload test may be designed to place additional stress on the storage drive while refraining from adding stress to other storage drives in the RAID. In the event the storage drive fails the stress workload test (e.g., the storage drive cannot adequately handle the additional workload or generates errors in response to the additional workload), the method replaces the storage drive with a spare storage drive and rebuilds the RAID. In certain embodiments, the method tests the storage drive with greater frequency as the age of the storage drive increases. A corresponding system and computer program product are also disclosed.

Abstract: A method for intelligently rebuilding a RAID includes subjecting a storage drive in an existing RAID to a stress workload test by placing the storage drive in a RAID 1 configuration with a spare storage drive. In the event the storage drive fails the stress workload test but can still be read, the method uses the RAID 1 configuration to copy recoverable data from the failing storage drive to the spare storage drive. The method uses other storage drives in the existing RAID to reconstruct, on the spare storage drive, data that is not recoverable from the failing storage drive. Either before or after all non-recoverable data has been reconstructed on the spare storage drive, the method logically replaces, in the existing RAID, the failing storage drive with the spare storage drive. A corresponding system and computer program product are also disclosed.

Abstract: An apparatus for processing data includes a data detector configured to detect data values in data sectors to yield detected data, a data decoder configured to decode the detected data, wherein the data detector and the data decoder are configured to process the data sectors in a series of global iterations, a memory configured to store parity sector soft information, and a scheduler configured to control overlapping reprocessing of a failed sector in the data detector and the data decoder based on the parity sector soft information with processing of another data sector in the data detector and the data decoder.

Abstract: A method to resolve or prevent a computer system failure is provided. The method may include capturing a plurality of snapshots associated with a computer system installation environment during a plurality of key times. The method may also include measuring each snapshot within the captured plurality of snapshots according to a measure of system health. The method may further include using each measured snapshot to develop a plurality of learned patterns of good and bad software installations. The method may additionally include providing a probability associated with a proposed installation operation based on the developed plurality of learned patterns of good and bad software installations. The method may also include providing at least one installation recommendation in response to a recovery from a system failure, whereby the provided at least one installation recommendation is based on the developed plurality of learned patterns of good and bad software installations.