Abstract: Systems and methods for exporting failure and diagnostic data and securing privileges in a service Operating System (OS). In some embodiments, an Information Handling System (IHS) includes a processor; and a memory coupled to the processor, the memory having program instructions stored thereon that, upon execution by the processor, cause the IHS to: identify a malfunction; store malfunction data in a predefined location; detect the coupling of an external device to the IHS; and export the malfunction data from the predefined location to the external device.

Abstract: A system may include a digital sensor system including a sensor element and a digital interface. The digital interface may provide a wake-up signal based on a sensing action being performed by the sensor element after a predefined event is detected by the digital sensor system. The system may include a microcontroller to receive the wake-up signal provided by the digital interface, and wake from a sleep mode based on receiving the wake-up signal provided by the digital interface.

Abstract: Techniques are described for headlessly completing a task of an application in the background of a digital personal assistant. For example, a method can include receiving a voice input via a microphone. Natural language processing can be performed using the voice input to determine a user voice command. The user voice command can include a request to perform a task of the application. The application can be caused to execute the task as a background process without a user interface of the application appearing. A user interface of the digital personal assistant can provide a response to the user, based on a received state associated with the task, so that the response comes from within a context of the user interface of the digital personal assistant without surfacing the user interface of the application.

Abstract: Disclosed is an information processing system having one or more computers. The information processing system includes a request receiver configured to receive a request from a program causing an apparatus to execute a predetermined process, a simulator configured to simulate the process executed by the apparatus in accordance with the request, an instruction receiver configured to receive a status change instruction for changing a status of the simulator from a user, and a status changer configured to cause the simulator to change a status of the simulator in accordance with the status change instruction. In the information processing system, the simulator simulates the process executed by the apparatus in the status changed by the status changer.

Abstract: A data identification system and method for operating the data identification system are provided. The method comprises identifying processing elements contained within the storage environment, identifying virtual processing elements contained within the processing elements, identifying virtual storage elements contained within the virtual processing elements, identifying contents of the virtual storage elements, generating the file system view of the storage environment, wherein the file system view comprises the processing elements, the virtual processing elements, the virtual storage elements, and the contents of the virtual storage elements arranged in a hierarchical order. The file system view of the storage environment is then provided.

Abstract: Systems and method for the management of virtual machine instances are provided. A network data transmission analysis system can use contextual information in the execution of virtual machine instances to isolate and migrate virtual machine instances onto physical computing devices. The contextual information may include information obtained in observing the execution of virtual machines instances, information obtained from requests submitted by users, such as system administrators. Still further, the network data transmission analysis system can also include information collection and retention for identified virtual machine instances.

Abstract: A method and a computer program product for causing a processor to perform the method are provided. The method includes creating a virtual machine having a virtual machine identifier, and storing an entry in a temporary virtual machine registry, wherein the entry includes the virtual machine identifier, inactivity criteria for the virtual machine, and a responsive action for the virtual machine. The method further includes monitoring the activity of the virtual machine, and initiating the responsive action associated with the virtual machine in response to the virtual machine satisfying the inactivity criteria.

Abstract: A hypervisor receives a notification from a source virtual machine that provides network function virtualization (NFV) support to execute a VM function component to send a request to a virtual processor. The VM function component identifies a physical processor associated with the virtual processor, and adds the request to a memory space associated with the physical processor.

Abstract: A method is provided for designing and optimizing a pattern by considering heterogeneous cloud environments. Building blocks within the pattern can be deployed into different cloud environments and different cloud providers, depending on where the pattern fits users need best. Further, building block configuration within the pattern can be optimized by target environments, along with runtime bursting among multiple environments.

Abstract: Methods, systems, and computer-readable media for optimizing and enhancing delivery of application virtualization layers to client computing devices are described herein. In various embodiments, an application virtualization layer optimization service may identify a first and a second application virtualization layer to be delivered to one or more client computing devices. Each application virtualization layer may represent a package of one or more applications. A layer analysis service may analyze the first and second application virtualization layers to determine conflicts between the layers, using predetermined conflict analysis rules, and generate an actionable conflict resolution report based on the analysis.

Abstract: The use of a skip element when redoing transactions, so as to avoid tracking dependencies between transactions assigned to different threads for parallel processing. When the second thread comes to a second task in the course of redoing a second transaction, if a first task that is mooted by the second task is not already performed, the second thread inserts a skip element associated with the object to be operated upon by the particular task, instead of actually performing the particular task upon the object. When the first thread later comes to the first task in the course of redoing a first transaction, the first thread encounters the skip element associated with the object. Accordingly, instead of performing the dependee task, the first thread skips the dependee task and perhaps removes the skip element. The result is the same regardless of whether the first or second task is redone first.

Abstract: Embodiments presented herein disclose adaptive techniques for scheduling self-maintenance processes. A load predictor estimates, based on a current state of a distributed storage system, an amount of resources of the system required to perform each of a plurality of self-maintenance processes. A maintenance process scheduler estimates, based on one or more inputs, an amount of resources of the distributed system available to perform one or more of the self-maintenance processes during at least a first time period. The maintenance process scheduler determines a schedule for the one or more of the self-maintenance processes to perform during the first time period, based on the estimated amount of resources required and available.

Abstract: A system and method for virtualization and cloud security are disclosed. According to one embodiment, a system comprises a first multi-core processing cluster and a second multi-core processing cluster in communication with a network interface card and software instructions. When the software instructions are executed by the second multi-core processing cluster they cause the second multi-core processing cluster to receive a request for a service, create a new or invoke an existing virtual machine to service the request, and return a desired result indicative of successful completion of the service to the first multi-core processing cluster.

Abstract: Co-allocating resources within a compute environment includes. Receiving a request for a reservation for a first type of resource, analyzing constraints and guarantees associated with the first type of resource, identifying a first group of resources that meet the request for the first type of resource and storing in a first list, receiving a request for a reservation for a second type of resource, analyzing constraints and guarantees associated with the second type of resource, identifying a second group of resources that meet the request for the second type of resource and storing in a second list, calculating a co-allocation parameter between the first group of resources and the second group of resources and reserving resources according to the calculated co-allocation parameter of the first group of resources and the second group of resources. The request may also request exclusivity of the reservation.

Abstract: A system and method of dynamically controlling a reservation of compute resources within a compute environment is disclosed. The method aspect of the invention comprises receiving a request from a requestor for a reservation of resources within the compute environment, reserving a first group of resources, evaluating resources within the compute environment to determine if a more efficient use of the compute environment is available and if a more efficient use of the compute environment is available, then canceling the reservation for the first group of resources and reserving a second group of resources of the compute environment according to the evaluation.

Abstract: One dynamic task scheduling method includes: receiving a task, wherein the task comprises a kernel and a plurality of data items to be processed by the kernel; dynamically partitioning the task into a plurality of sub-tasks, each having the kernel and a variable-sized portion of the data items; and dispatching the sub-tasks to a plurality of computing devices of a heterogeneous computing system. Another dynamic task scheduling method includes: receiving a task, wherein the task comprises a kernel and a plurality of data items to be processed by the kernel; partitioning the task into a plurality of sub-tasks, each having the kernel and a same fixed-sized portion of the data items; and dynamically dispatching the sub-tasks to a plurality of computing devices of a heterogeneous computing system.

Abstract: Techniques for actor and thread message dispatching are described herein. In some examples, a computing system may include multiple actors and multiple processing threads. Upon receiving an incoming message associated with one of the actors, a dispatching component may select one of the multiple processing threads within the computing system to which to dispatch the message for processing. If the associated actor is already assigned to one of the processing threads, then that processing thread may be selected for processing of the message. By contrast, if the associated actor is not already assigned to one of the processing threads, then a processing thread may be selected based on various factors, such as a set of priorities associated with the processing threads.

Abstract: Systems and methods for optimizing hardware resource utilization when processing variable-precision data are provided. Application data objects are processed using either a central processing unit (CPU) or the relatively lower precision data processing requirements of a dedicated math processing unit, e.g., a graphics processing unit (GPU), based on a level of precision determined for each application data object. The level of precision is used to calculate at least one bounding value for each application data object. The bounding value is compared to a selected precision threshold in order to determine whether the application data object can be processed by the GPU at a relatively lower level of precision without an undesirable loss of computational precision.

Abstract: Users are allowed to communicate with a server via a local client even when the server experiences an abnormal peak of traffic. The local client is configured to send a new connection request only after a specified time interval passes from a previous connection. The local client presents content, such as a game, that makes it appear to the user as if the user is interacting with the server while the local client is waiting for reconnection to the server. The user interactions during the time interval are locally stored and later provided to the server for further process.

Abstract: Examples may include techniques to a schedule a workload to one or more computing resources of a data center. A class is determined for the workload based on a workload type or profile for the workload. Predicted operating values for at least one of the one or more computing resources is determined based on the class and the predicted operating values are used as inputs in at least one scoring model to evaluate the workload being supported by the at least one of the one or more computing resources. The workload is then scheduled to the at least one or more computing resources based on the evaluation.

Abstract: Computer implemented methods, system and apparatus for configuring a cluster using a plurality of hosts include identifying a plurality of features for forming the cluster. The plurality of features define requirements needed in a host for forming the cluster. A plurality of hosts are identified to be part of the cluster. A compatibility analysis is executed for each of the identified hosts wherein a ranking is provided for each of the identified hosts. A plurality of suggested adjustments to particular hosts are presented to enable the particular hosts to be compatible with the features requirements. A configuration template is constructed for the hosts in the cluster that are compatible with the requirements. The hosts are configured for the cluster using the configuration settings in the configuration template. The configured hosts enable the features in the cluster.

Abstract: Embodiments of the present disclosure disclose a method and a device for estimating optimal resources for server virtualization. The method comprises receiving input data relating to requirements of server virtualization from a user device. The method further comprises filtering the input data by applying filtering rules. The method further comprises generating current landscape information of a plurality of servers using the filtered input data. The method further comprises determining values of virtualization parameters for a plurality of target servers using the current landscape information and predefined rules. The method further comprises determining landscape information of the plurality of target servers using the current landscape information and the values of virtualization parameters for estimating optimal resources for server virtualization.

Abstract: A method for operating a server farm with a plurality of servers operably connected with each other includes: receiving a job request of a computational task to be handled by the server farm; determining, from the plurality of servers, one or more servers operable to accept the job request; determining a respective effective energy efficiency value associated with at least the one or more servers; and assigning the computational task to a server with the highest effective energy efficiency value. The effective energy efficiency value is defined by a service rate of the respective server divided by a difference between an energy consumption rate value when the respective server is busy and an energy consumption rate value when the respective server is idle. The present invention also relates to a server farm operated by the method.

Abstract: A method, article of manufacture, and apparatus for automating application activity is disclosed. In some embodiment, this comprises monitoring an active folder in a computer system for file events, triggering an intermediary application based on the monitoring, and activating an application based on the triggered intermediary application. In some embodiments, an application remote to the computer system is activated. In some embodiments, an application local to the computer system is activated.

Abstract: A system and method for providing delegated metric tools within a partially closed communication platform that includes receiving a tag identifier linked to at least a first identified platform interaction in the communication platform; associating the tag identifier with at least one logged event of an account associated with the first identified platform interaction; defining a tracking resource with at least one tag identifier; measuring platform interactions tracked by a tracking resource; and providing access to measured platform interactions through an application.

Abstract: A system for determining a quota comprises an input interface, a candidate quota determiner, one or more quota modification determiners, and an output interface. The input interface is for receiving a quota request for an activity and receiving an estimation or an actual measurement of one or more operating parameters. A candidate quota determiner is for determining a candidate quota amount based at least in part on candidate quota parameters. The one or more quota modification determiners are for determining one or more quota modifications based on the estimation or the actual measurement of the one or more operating parameters. The output interface for providing a final quota amount based at least in part on the candidate quota amount and the one or more quota modifications.

Abstract: A method of assisting failure diagnosis in a system includes obtaining data including a probabilistic Bayesian Network describing a set of failures, a set of symptoms and probabilities of at least some of the symptoms being associated with at least some of the failures in a system. A cost value representing a cost associated with learning of a presence or absence of the symptom is obtained for at least some of the symptoms, as well as a plurality of information values, e.g. values representing measures of information gained by learning of the presence or absence of the symptom in relation to a respective plurality of the failures, associated with the symptom. The method then computes an information-for-cost value for the symptom based on the cost value and the plurality of information values.

Abstract: A computer system may generate a lineage graph for a data processing system. The lineage graph may contain one or more nodes, and it may identify the flow of data through the data processing system. The computer system may determine that a first node in the lineage graph defunct. The computer system may then generate a report for the data processing system and provide the report to a user. The report may include an explanation of why the first node is defunct. The computer system may insert an indication that the first node is defunct into metadata for the first node. The indication may also include the explanation of why the first node is defunct.

Abstract: Testing a data coherency algorithm of a multi-processor environment. The testing includes implementing a global time incremented every processor cycle and used for timestamping; implementing a transactional execution flag representing a processor core guaranteeing the atomicity and coherency of the currently executed instructions; implementing a transactional footprint, which keeps the address of each cache line that was used by the processor core; implementing a reference model, which operates on every cache line and keeps a set of timestamps for every cache line; implementing a core observed timestamp representing a global timestamp, which is the oldest construction date of data used before; implementing interface events; and reporting an error whenever a transaction end event is detected and any cache line is found in the transactional footprint with an expiration date that is older than or equal to the core observed time.

Abstract: One embodiment provides a system that facilitates processing of error-condition information associated with a content-centric network (CCN) message transmitted over a network. During operation, the system receives, by a first node, a packet that corresponds to a CCN message, where a name for the CCN message is a hierarchically structured variable length identifier (HSVLI) which comprises contiguous name components ordered from a most general level to a most specific level. Responsive to determining that the CCN message triggers an error condition, the system generates an interest return message by pre-pending a data structure to the CCN message, where the data structure indicates the error condition. The system transmits the interest return message to a second node.

Abstract: A technology is described for identifying a destination physical host used to host a computing instance modeled on a source computing instance. An example method may include obtaining specifications for a source computing instance in preparation to migrate the source computing instance to a destination physical host. A destination physical host may then be identified for hosting a destination computing instance modeled on the source computing instance, where the destination physical host may have specifications determined to support the destination computing instance. A model of the source computing instance as hosted on the source physical host may be compared with a model of the source computing instance as hosted on the destination physical host to identify any conflicts that may prevent the destination physical host from hosting the destination computing instance.

Abstract: A method for creating and using a fault model representative of a system, the fault model comprising one or more fault model components is provided. The method creates a reusable fault model component; associates one or more algorithms to the reusable fault model component, the one or more algorithms describing behavior of the reusable fault model component; incorporates the reusable fault model component and the one or more algorithms into the fault model; tunes the reusable fault model component, using available data associated with the fault model; and predicts occurrence of degradation of the system, based on the tuning.

Abstract: A method, computer program product, and system for dynamic relational integrated intelligent monitoring and problem resolution of systems is provided. An IT environment is monitored for a first symptom. The first symptom is a malfunction of at least one component of a plurality of components. In response to determining a first measurement deviates from a reference value, a first component is determined to be the cause component. In response to determining a monitoring tier of the cause component is activated, a plurality of measurements is determined for the plurality of components. A component with the greatest number of activated monitoring tiers is identified and compared to the cause component. Probe data for the plurality of components is collected. A probe ripple is determined, based on one or more components affected by the malfunction. A root cause of the first symptom is reported.

Abstract: An improved method provides fault handling in a distributed IT environment. The distributed IT environment executes a workflow application interacting with at least one application by using interface information about the at least one application. In response to receiving a first instance of a fault response, a fault handler performing a first lookup of a fault handling policy corresponding to the fault response within a fault handling descriptions catalog. The fault handler loads a first one or more fault handling descriptions that are pointed to by the fault handling policy in order to continue execution of the workflow application. After a second instance of the fault response, the fault handler performs a second lookup of the fault handling policy which now points to a second one or more fault handling descriptions which are loaded in order to continue execution of the workflow application.

Abstract: A computer-implemented method, system, and/or computer program product utilizes Automated Ticketing (AT) Analytics to create a recommendation file of routines and to automatically create a work ticket in response to a message. One or more processors identify messages related to a Logical Partition (LPAR) for automated ticketing. The messages identify an operational anomaly in the LPAR used by a computer system, and are based on sensor readings from hardware sensors and software programs within the computer system. The identified messages identify which messages are to be auto ticketed as a work ticket for the computer system. In response to updates to rules for automated ticketing being initiated, the processor(s) identify trends using an automated message analysis and an automation routine identification to automatically trigger a generation of the work ticket. The processors(s) automatically create and execute the work ticket to correct a new operational anomaly in the LPAR.

Abstract: A management computing device receives, from a target computing device located within a remote network, an event generated at the target computing device resulting from an issue at the target computing device. The management computing device determines a remediation process to resolve the issue at the target computing device in an automated manner. The management computing devices executes the remediation process in conjunction with a software agent running on the target computing device to resolve the issue in the automated manner.

Abstract: Provided are a computer program product, system, and method for processing main cause errors and sympathetic errors in devices in a system. Error data for the devices in the system are analyzed to determine a main cause error for one of the devices that cause at least one sympathetic error in the system. A main cause event object for the determined main cause error and at least one sympathetic event object for the determined at least one sympathetic error resulting from the main cause error are generated. A determination is made from the at least one sympathetic event object of at least one sympathetic event action to perform. The determined at least one sympathetic event action is performed to recover from the at least one sympathetic error represented by the at least one sympathetic event object providing the at least one sympathetic event action.

Abstract: A driving method of a semiconductor device and semiconductor device may be provided. The semiconductor device may include a cell array including a plurality of data areas. The semiconductor device may include an ECC (Error correction Code) area configured to be assigned to only less than all of the data areas at any one time to store parity data corresponding to the data areas.

Abstract: An exemplary method for reading data stored in a flash memory includes: selecting an initial gate voltage combination from a plurality of predetermined gate voltage combination options; controlling a plurality of memory units in the flash memory according to the initial gate voltage combination, and reading a plurality of bit sequences; performing a codeword error correction upon the plurality of bit sequences, and determining if the codeword error correction successful; if the codeword error correction is not successful, determining an electric charge distribution parameter; determining a target gate voltage combination corresponding to the electric charge distribution parameter by using a look-up table; and controlling the plurality of memory units to read a plurality of updated bit sequences according to the target gate voltage combination.

Abstract: Techniques for encoding data for non-volatile memory storage systems are disclosed. In one particular embodiment, the techniques may be realized as a method including determining whether the memory includes a defective memory cell, receiving a message to be written to the memory, sub-dividing the message into a plurality of sub-messages, generating a first error correction code for the sub-messages, the first error correction code being a first type, generating a plurality of second error correction codes for the sub-messages, the second error correction codes being a second type different from the first type, generating a combined message comprising the sub-messages, the first error correction code, and the plurality of second error correction codes, and writing the combined message to the memory, at least a portion of the combined message being written to the defective memory cell.

Abstract: Techniques for rebundling grid encoded data storage systems are described herein. A new grid of shards is created based in part on shards from a first grid of shards. The second grid of shards contains data shards, including one or more data shards from the first grid of shards, and derived shards that are indexed by row and column and is configured so that shards in the second grid are reproducible from shards in the same row using a first redundancy code and are also reproducible from shards in the same column using a second redundancy code. The derived shards of the second grid of shards are then derived from other shards in the second grid of shards using the first redundancy code and the second redundancy code.

Abstract: A device includes a memory and a controller. The controller is configured to read codewords of a data structure from the memory. The codewords include a number of undecodable codewords that are undecodable at an error correction coding (ECC) decoder according to a first correction scheme. The controller includes a stripe generator and a stripe decoder. The stripe generator is configured, in response to the number of undecodable codewords exceeding an erasure correction capacity of a stripe correction scheme, to generate trial data for a stripe of the data structure, the trial data including at least one element that corresponds to erased data and at least another element that is associated with an undecodable codeword and that corresponds to valid data of the stripe. The stripe decoder is configured to initiate a stripe decode operation of the trial data.

Abstract: A computing device includes an interface configured to interface and communicate with a dispersed storage network (DSN), a memory that stores operational instructions, and a processing module operably coupled to the interface and memory such that the processing module, when operable within the computing device based on the operational instructions, is configured to perform various operations. A computing device identifies data slices (EDSs) of pillar width (associated with data object) to be stored within a pillar width number of a plurality of storage units (SUs). The computing device the identifies head SUs among the pillar width number of the SUs such that, based on a ring arrangement, each set of EDSs is distributedly stored among the ring arrangement of the pillar width number of the SUs starting with its respective head EDS at a respective head SU and ending with a last tail EDS at a respective last tail SU.

Abstract: A storage cluster is provided. The storage cluster includes a plurality of storage nodes within a single chassis. Each of the plurality of storage nodes has nonvolatile solid-state memory for storage of user data. The plurality of storage nodes are configured to distribute the user data and metadata throughout the plurality of storage nodes with erasure coding of the user data such that the plurality of storage nodes can access the user data, via the erasure coding, with a failure of two of the plurality of storage nodes. The plurality of storage nodes are configured to employ the erasure coding to reconfigure redundancy of the user data responsive to one of adding or removing a storage node.

Abstract: Apparatus and computer program products implement embodiments of the present invention that enable a computer system comprising networked computers to self-heal from a boot failure of one of the computers. In some embodiments, upon detecting a first computer having a memory and a physical boot device failing to successfully load a boot image, a second computer defines a virtual boot device in communication with the first computer and the second computer and having a boot image for the first computer. Subsequent to defining the virtual boot device, the second computer can configure the first computer to boot from the virtual boot device.

Abstract: A data processing device, comprising a processing unit and a test control unit connected to the processing unit, is described. The processing unit and the test control unit are arranged to: start a logic test of the processing unit; detect a test abort event; and, in response to the test abort event, perform an event response action which comprises aborting the logic test and booting the processing unit, said booting including executing an event handling routine. The event response action may comprise setting a reset vector to an address of the event handling routine. System availability may thus be improved. In particular, the delay between capturing an asynchronous signal and responding to it may be reduced. The test abort event may, for example, be an asynchronous event having certain pre-defined characteristics. A method of operating a data processing device is also described.

Abstract: A node includes: an arithmetic processing device; and a first memory, wherein the arithmetic processing device includes: a processor core; a storing circuit to store a first failure node list in which first information indicating that a failure has occurred or second information indicating that no failure has occurred is set for each of nodes; a request issuing circuit to issue a first request to a second memory provided at a first node among the nodes; a setting circuit to set the first information for the first node in the first failure node list when the first request has timed out; and an issuance inhibition circuit to inhibit, based on a second request to the second memory from the processor core, the second request from being issued by the request issuing circuit when the first information is set for the first node in the first failure node list.

Abstract: A method and system are provided for storage checkpointing in a mirrored virtual machine system. The method includes a storage controller receiving a modifying operation to storage from a virtual machine and carrying out the modifying operation in a non-destructive manner by saving the modifying operation data to a checkpointing region of storage and preserving the stored previous data state. The method also includes receiving a checkpoint notification and committing modifying operation data from the checkpointing region and releasing the stored previous data state. If a failover notification is received, the storage controller rolls back the physical storage to match a checkpoint state.

Abstract: Systems and methods for a backing up and/or restoring data in a cloud based application are provided. Objects that are deleted in bulk are restored in bulk. The relationships between the objects that were deleted are determined at the time of backup and used during the restore process. The restored objects have the same relationships as the original objects even when the objects are not identical. The restore process accounts for data or information in the objects that cannot be restored or that is assigned by the web application to which the objects are restored.

Abstract: Systems and methods for failure recovery in shared storage operations. An example method comprises: acquiring a lock with respect to a storage domain comprising a specified disk image; creating a transaction marker associated with the disk image; creating a component of a new volume associated with the disk image; destroying the transaction marker; and releasing the lock with respect to the storage domain.