Abstract: The electronic device may invoke a host application. The device may display a first host user interface on the display, the first host user interface including a first host user interface component associated with a child application. In response, the device may invoke, using the host application, the child application executed at the electronic device. The device may transmit, using the host application, a request for data associated with a child user interface component to the child application. The device may transmit, using the child application, the request for data associated with the child user interface component to a child application server, wherein the data associated with the child user interface component is inaccessible by the host application. The device may receive, using the child application, the data associated with the child user interface component from the child application server. The device may display the child user interface component.

Abstract: A category is determined to which a portion of a code selected for review by a reviewer belongs. A subset is selected from a set of checklist items. A checklist item in the subset is configured for reviewing a set of categories of code portions including the category of the portion. A context including a characteristic of the reviewer is determined of the review of the portion. A checklist item in a sub-subset of the subset of checklist items is usable in reviewing the code portions under a set of contexts. The context of the review of the portion corresponds to a context in the set of contexts. Using a checklist item from the sub-subset, a checklist is dynamically configured to be specific to the review of the portion, specific to the reviewer, and specific to a given time of the review.

Abstract: A method controls the change in operating system in selected service nodes of a high- performance computer (CHP). The method includes: a step (i) of defining, for the selected service nodes, a reduced version of a new operating system to be installed, a boot kernel, a so-called “reference” tree node software image suitable for the new operating system and including a definition of an instantiation to be established in the service nodes, and an activation module capable of locally installing the reference image in each service node; a step (ii) wherein the defined reference image, boot kernel, activation module, and reduced operating system version are transferred into the service nodes; and a step (iii) wherein the transferred activation module is used in each service node in order to locally install the transferred reference image.

Abstract: Provided is an information processing apparatus including a decision unit configured to decide an operation mode defining an operation of a target apparatus on the basis of tag information acquired from a tag capable of communicating with an external device, the target apparatus being an apparatus corresponding to the tag information.

Abstract: An application programming interface (API) may include an initiator configured to initiate a guest safepoint via an action represented in a guest language executed on a virtual machine, provide a safepoint action to a group of guest threads, synchronize the guest threads such that each guest thread in the group executes the safepoint action once all guest threads in the group enter the guest safepoint, and synchronize the guest threads such that each guest thread in the group exits the guest safepoint once all guest threads in the group complete execution of the safepoint action. The API may also include a guest configured to determine whether a guest safepoint is initiated, enter the guest safepoint, execute the safepoint action while execution of a guest action is paused, and exit the guest safepoint and resume execution of the guest action once the safepoint action completes execution.

Abstract: Temporal dynamic policies may be used to effectively alter the management of a virtual machine in a virtualized computing environment based upon some temporal condition such as how long a virtual machine has been active or idle, how long it has been since the virtual machine was created or deployed, etc. The altered management may be used, for example, to activate various performance and/or reliability-related technologies such as high availability and failover functionality for longer-running virtual machines.

Abstract: One or more techniques and/or devices are provided for storage virtual machine relocation (e.g., ownership change) between storage clusters. For example, operational statistics of a first storage cluster and a second storage cluster may be evaluated to identify a set of load balancing metrics. Ownership of one or more storage aggregates and/or one or more storage virtual machines may be changed (e.g., permanently changed for load balancing purposes or temporarily changed for disaster recovery purposes) between the first storage cluster and the second storage cluster utilizing zero-copy ownership change operations based upon the set of load balancing metrics. For example, if the first storage cluster is experiencing a relatively heavier load of client I/O operations and the second storage cluster has available resources, ownership of a storage aggregate and a storage virtual machine may be switched from the first storage cluster to the second storage cluster for load balancing.

Abstract: In accordance with embodiments of the present disclosure, a system may include a chassis configured to receive a plurality of modular information handling systems, a switch configured to be communicatively coupled to modular information handling systems received in the chassis, and a physical service processor communicatively coupled to the switch.

Abstract: A method to perform server provisioning on a plurality of computer systems to generate a plurality of target virtual machines includes: obtaining configurations from a pool comprising at least one existing candidate virtual server or server image through a discovery process; performing a clustering analysis on the configurations to group the configurations into at least two groups; and for each group, selecting a configuration from among the configurations of the group as a candidate virtual machine image; determining a cost of actions required to be performed on the candidate virtual image to result in target virtual machines with a same configuration as the configurations of the group; and selecting the candidate virtual image with the lowest cost

Abstract: Temporal dynamic policies may be used to effectively alter the management of a virtual machine in a virtualized computing environment based upon some temporal condition such as how long a virtual machine has been active or idle, how long it has been since the virtual machine was created or deployed, etc. The altered management may be used, for example, to activate various performance and/or reliability-related technologies such as high availability and failover functionality for longer-running virtual machines.

Abstract: The present disclosure is related to systems, methods, and non-transitory machine readable media for virtual component revision. An example non-transitory machine readable medium can store instructions executable by a processing resource to cause a computing system store a change to a configuration setting among a plurality of configuration settings each associated with a configurable virtual component and store the plurality of configuration settings associated with the configurable virtual component.

Abstract: A security system and method efficiently monitors and secures a computer to defend against malicious intrusions, and includes an in-band software monitor disposed within a kernel in communication with an operating system (OS) of the computer. The monitor intercepts system calls made from an MSR (Model Specific Register), to execute monitoring operations, and subsequently returns execution to the OS. An out-of-band hypervisor communicably coupled to the OS, has read shadow means for trapping read requests to the MSR, and write mask means for trapping write requests to the MSR. The hypervisor includes means for responding to the trapped read and write requests so that presence of the monitor is obscured. Sysret monitoring means intercepts calls to a sysret instruction, executes sysret monitoring operations, and subsequently returns execution to an application running on the computer.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for providing and managing custom virtual computing systems. In one aspect, a computer-implemented method includes receiving a request for one or more computing services, determining, based on the request, a virtual system image configured to provide a virtual computing system that provides the requested computing services, and deploying the virtual system image. The virtual computing system can be locked down for security.

Abstract: The present subject matter relates to categorizing virtual machines of a virtual machine environment into predefined service level buckets. The predefined service level buckets are indicative of different levels of application based services that are to be applied to the virtual machines. In one implementation, specifications of information technology (IT) resources allocated to each of the virtual machines are obtained. A weighted average score for each virtual machine with respect to each of the specifications of IT resources is determined. The weighted average score is indicative of a relative level of importance of the corresponding virtual machine with respect to the corresponding specification of IT resource for providing at least one business service using the virtual machine environment. Each virtual machine is assigned to one of the predefined service level buckets based on a total weighted average score for the each virtual machine.

Abstract: Embodiments of an invention for virtualization exceptions are disclosed. In one embodiment, a processor includes instruction hardware, control logic, and execution hardware. The instruction hardware is to receive a plurality of instructions, including an instruction to enter a virtual machine. The control logic is to determine, in response to a privileged event occurring within the virtual machine, whether to generate a virtualization exception. The execution hardware is to generate a virtualization exception in response to the control logic determining to generate a virtualization exception.

Abstract: Systems and methods for managing Software-as-a-Service (SaaS) provided by a virtual machine are described. The system may include a management application, and may receive a feature package from the virtual machine. The feature package may be associated with a function supported by the virtual machine. The system may integrate the feature package into the management application, and transmit a first command to the virtual machine for executing the function at the virtual machine. The first command may be generated by the management application based on the feature package.

Abstract: An information processing system that includes at least one information processing apparatus and executes programs, each of which performs a predetermined process, the information processing system including a memory unit configured to store, for each of applications performing a sequence of processes using electronic data, program identification information identifying at least one program performing each process of the sequence of processes, flow information defining an execution order of the at least one program, and app identification information identifying each of the applications, while associating the program identification information, the flow information, and the app identification information, a registering unit, and a process executing unit, in receipt of a request including information related to the electronic data and the app identification information from a second apparatus, configured to cause the program identified by the program identification information in accordance with the execution

Abstract: Embodiments include computing devices, systems, and methods for task signaling on a computing device. Execution of a task by an initial thread on a critical path of execution may be interrupted to create at least one parallel task by the initial thread that can be executed in parallel with the task executed by the initial thread. An initial signal indicating the creation of the at least one parallel task to a relay thread may be sent by the initial thread. Execution of the task by the initial thread may resume before an acquisition of the at least one parallel task.

Abstract: A thread in a computing system is processed for execution of instructions to perform an action. The action is one of the following: accessing a shared resource or executing a critical section of code. A schedule of the thread is managed. The management prevents suspension of the thread during execution of the action.

Abstract: A method may comprise identifying a signal indicating real-time mode operation for a guest operating system (OS) and directly routing an interrupt for a first processor to the guest OS while the guest OS is running without causing a transition from execution by the guest OS to execution by a host system. Other embodiments are disclosed and claimed.

Abstract: Disclosed is a job processing device including: a queue in which jobs are stored; a memory configured to store a program; a network device configured to communicate with an external device via a network; and a processor configured to: sequentially execute the stored jobs by operating in accordance with the stored program, detect another job processing device which operates in accordance with a program having a newer version than the stored program on the network, detect a job in which a quality of a job processing is improved more by being executed by the detected job processing device than by being executed by the job processing device itself, from the stored jobs, and fetch the detected job and transmit the job to the detected job processing device to execute the job by the detected job processing device.

Abstract: A scheduler for scheduling multi-phase computing jobs is disclosed. A profile of a computing job is received. The profile includes a plurality of job phase definitions. Each job phase includes an estimated amount of a computing resource to be consumed by executing a respective job phase. An identifier of the computing job is appended to a job queue. A combination of one or more computing jobs to be scheduled is selected from the job queue. A total amount of a computing resource to be consumed at each of one or more consecutively executed phases of the computing jobs does not exceed a threshold resource amount.

Abstract: According to a method for scheduling a user request in a distributed resource system, an apparatus, and a system that are provided by embodiments of the present invention, in a Tn+1 period, an Sd acquires, from a coordinator Gk of a user z, a resource Cz(Tn) that is consumed by a user z request in a Tn period, and the Sd schedules, according to ?z, Cz(Tn), Cz,d(Tn), and Nz,d(Tn), a Piz,d by using a scheduling algorithm. The user z request can be scheduled without depending on a user agent. In addition, the Sd schedules, according to ?z, Cz(Tn), Cz,d(Tn), and Nz,d(Tn), the Piz,d by using the scheduling algorithm, thereby implementing global scheduling on the user z request and ensuring a performance requirement of the user z.

Abstract: The described technology is directed towards sharing asynchronous (async) tasks between task chains, including in a way that prevents cancellation of lower-level chain entity from cancelling a shared async task. A shared async task is wrapped in multiplexer code that maintains lower-level entity identities as a set of listeners of the shared async task, and when a listener cancels, only removes that listener from the set of listeners so that the shared async task does not cancel as long as one listener remains in the set. Also described is optimization to share an async task, and wrapping tasks in cancel-checking code that prevents the task from running its work if the task is intended to be cancelled but is queued to run before the cancel request is queued to run.

Abstract: The scheduler performs thread scheduling of repeating processings of specifying each hardware thread included in a first group among the multiple hardware threads for the number of times set up in advance for the hardware thread, and of specifying any one of the hardware threads in a second group for the number of times set up in advance for the second group that includes other hardware threads. A thread waste counter is provided for each hardware thread in the first group and counts up each time a nondispatchable state occurs when the hardware thread is specified by the thread scheduling. When the hardware thread in the first group specified by the thread scheduling is nondispatchable, the scheduler performs rescheduling of respecifying the hardware thread in the second group instead of the hardware thread in the first group.

Abstract: Embodiments of the present invention may schedule a task in a processing system. According to one embodiment of the present invention, a resource to be accessed by a task in a processing system is determined based on a type of a request for initiating the task. Then, a length of a task queue that records at least one task waiting for the resource is determined Next, the request is suspended in response to the length of the task queue being greater than a predefined threshold.

Abstract: Embodiments of the present invention relate to CPU resource management in a computer cluster. A master node selects a CPU core of at least one compute node for an application from a computer cluster, and allocates a portion of resource of the CPU core to the application. The master node re-allocates a new portion of the resource of the CPU core to the application, in response to a trigger event for re-allocation.

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: Embodiments of the present invention disclose a task scheduling method, apparatus, and device, where the method includes: acquiring information about an available computing resource used for task execution; when a configured task set is received, determining resource consumption information of each task in the task set; and comparing the resource consumption information of each task in the task set with the information about the available computing resource, and determining a task that is in the task set and whose corresponding comparison result meets a preset task scheduling condition as a target task. In addition, a generated task scheduling diagram includes information such as tasks, dependence between the tasks, resource consumption information, and execution progress of a target task. By using the present invention, task scheduling can be optimized, so that task scheduling optimization is more intuitive, thereby improving processing performance of a data warehouse.

Abstract: A data mining method and a node are provided. The method includes: obtaining predicted execution time of each computing subnode in a current round of iteration of a task, and allocating a corresponding volume of task data to the computing subnode; after the current round of iteration is executed, collecting execution status information of each computing subnode in the current round of iteration, and accordingly determining whether the task data volume of each computing subnode needs to be adjusted in a next round of iteration; and performing the next round of iteration according to the adjusted task data volume. Therefore, a corresponding volume of task data can be allocated according to a capability of each computing subnode. In this way, some unnecessary load balancing processes can be avoided, network consumption can be reduced, and data mining performance of a system can be improved.

Abstract: Systems and methods provide an extensible, multi-stage, realtime application program processing load adaptive, manycore data processing architecture shared dynamically among instances of parallelized and pipelined application software programs, according to processing load variations of said programs and their tasks and instances, as well as contractual policies. The invented techniques provide, at the same time, both application software development productivity, through presenting for software a simple, virtual static view of the actually dynamically allocated and assigned processing hardware resources, together with high program runtime performance, through scalable pipelined and parallelized program execution with minimized overhead, as well as high resource efficiency, through adaptively optimized processing resource allocation.

Abstract: A thread in a computing system is processed for execution of instructions to perform an action. The action is one of the following: accessing a shared resource or executing a critical section of code. A schedule of the thread is managed. The management prevents suspension of the thread during execution of the action.

Abstract: A computer-implemented method comprises obtaining an intermediate computer code object including a set of instructions corresponding to a task to be performed. The intermediate computer code object—being machine independent—further includes for each of the at least one set of instructions one or more metadata descriptors representative of at least a complexity measure of the task to be performed. The method also comprises executing the intermediate computer code object on a computing platform comprising at least two different execution units having a different memory with a different memory location. This executing comprises selecting for each of the at least one set of instructions a target execution unit from the plurality of execution units. This selecting takes the one or more metadata descriptors and a decision rule into account, wherein the decision rule relates the plurality of complexity measures to a performance characteristic of the plurality of execution units.

Abstract: Embodiments of the present invention provide a method, computer program product, and computer system for reclaiming resources during virtual machine decommission. The method includes determining a virtual machine (VM) resource utilization and a cluster utilization. If the VM resource utilization is less than a first predetermined threshold and the cluster utilization is greater than a second predetermined threshold, the method then determines whether an active timer exists. If the active timer exists and has expired, then dynamic decommission of the VM is triggered.

Abstract: Methods and systems to compute cost efficiency of virtual machines (“VMs”) running in a private cloud are described. Methods and systems compute a cost efficiency value for each VM in the private cloud based on cost of the VM in the private cloud, cost of similar VMs in the private cloud, price of similar VM running in the public cloud, and the cost of similar VMs running in one or more private clouds in the same geographical area. When the cost efficiency of a VM is greater than a cost efficiency threshold, the methods generate an alert and recommendations for moving the VM to a lower cost public cloud.

Abstract: A work stealer apparatus includes a determination module. The determination module is to determine to steal work from a first hardware computation unit of a first type for a second hardware computation unit of a second type that is different than the first type. The work is to be queued in a first work queue, which is to correspond to the first hardware computation unit, and which is to be stored in a shared memory that is to be shared by the first and second hardware computation units. A synchronized work stealer module is to steal the work through a synchronized memory access to the first work queue. The synchronized memory access is to be synchronized relative to memory accesses to the first work queue from the first hardware computation unit.

Abstract: Embodiments include computing devices, apparatus, and methods implemented by a computing device for accelerating execution of a plurality of tasks belonging to a common property task graph. The computing device may identify a first successor task dependent upon a bundled task such that an available synchronization mechanism is a common property for the bundled task and the first successor task, and such that the first successor task only depends upon predecessor tasks for which the available synchronization mechanism is a common property. The computing device may add the first successor task to a common property task graph and add the plurality of tasks belonging to the common property task graph to a ready queue. The computing device may recursively identify successor tasks. The synchronization mechanism may include a synchronization mechanism for control logic flow or a synchronization mechanism for data access.

Abstract: Described are techniques for synchronizing operations performed on objects. Locking tables may be received where each of the locking tables corresponds to different object class. First processing may be performed by a first thread to acquire a set of one or more locks. Each lock in the set may be a lock for one of the objects. The first processing may include traversing the locking tables in accordance with a predefined ordering and acquiring the set of one or more locks, wherein, for each lock in the set, a first entry is updated in a first of the locking tables to indicate that the first thread has acquired the lock on one of the objects included in an associated object class corresponding to the first locking table.

Abstract: A parallelization method for generating a parallel program for a multicore microcomputer from multiple processes in a single program for a single-core microcomputer is provided. In the single program, there are multiple types of the processes and a combination of the types of processes to be executed varies according to condition. The parallelization method includes extracting processing patterns respectively representing the combinations of types in the conditions from the single program and allocating the processes to the cores for each of the extracted processing patterns to generate the parallel program.

Abstract: Embodiments include computing devices, apparatus, and methods implemented by a computing device for task scheduling in the presence of task conflict edges on a computing device. The computing device may determine whether a first task and a second task are related by a task conflict edge. In response to determining that the first task and the second task are related by the task conflict edge, the computing device may determine whether the second task acquires a resource required for execution of the first task and the second task. In response to determining that the second task fails to acquire the resource, the computing device may assign a dynamic task dependency edge from the first task to the second task.

Abstract: A dynamic metadata persistence and correlation system and method are disclosed. The system and method provide a means of tracking and relating transactional metadata from application API calls to internal data models. This system pairs application level flexibility with dynamic correlation management for entity evolution, data retrieval, and analytics.

Abstract: A method for a reusable reliability centered maintenance of a technical system is provided, by executing the following steps: In a first step the meta data model is segmented in three sections to structure datasets of at least one database, wherein the first section comprises a collaborative dataset about components and at least one dominant failure mode associated with the components, the second section comprises a reusable dataset about at least one preventive maintenance task, the third section comprises a product dataset. In a second step at least one component instance is created for the third section by selecting at least one component of the components to describe said technical system. In a third step it is checked, if the preventive maintenance task is a valid task to prevent the dominant failure mode of the dominant failure mode instance for said technical system.

Abstract: An image forming apparatus includes an HDD, an HDD confirming unit, a system control unit, and a non-volatile semiconductor storage device. The HDD stores user data created by a user. The HDD confirming unit determines whether or not the HDD is in an inoperative state. The system control unit separates the HDD from the image forming apparatus to set the image forming apparatus to a restriction mode when the HDD is in the inoperative state. The non-volatile semiconductor storage device stores system data used for an operation of the system control unit.

Abstract: Embodiments include method, systems and computer program products for identifying unusual intervals in an information technology (IT) system. Aspects include training a log analysis system based on historical data for the IT system, the historical data including a plurality of intervals each having an interval anomaly score and receiving status messages from a plurality of pieces of IT equipment in the IT system. Aspects also include grouping the status messages into an interval and calculating an interval anomaly score for the interval and comparing the interval anomaly score with one or more priority level cutoffs created by the training and responsively generating an alert based on the comparison, wherein the alert indicates that the interval is unusual.

Abstract: Systems and methods for predictive reliability mining are provided that enable predicting of unexpected emerging failures in future without waiting for actual failures to start occurring in significant numbers. Sets of discriminative Diagnostic Trouble Codes (DTCs) from connected machines in a population are identified before failure of the associated parts. A temporal conditional dependence model based on the temporal dependence between the failure of the parts from past failure data and the identified sets of discriminative DTCs is generated. Future failures are predicted based on the generated temporal conditional dependence and root cause analysis of the predicted future failures is performed for predictive reliability mining. The probability of failure is computed based on both occurrence and non-occurrence of DTCs. The root cause analysis enables identifying a subset of the population when an early warning is generated and also when an early warning is not generated.

Abstract: A method for analyzing functional failures of a technical system using a processor to compute a meta data model, including the following steps is provided. A first step of gathering at least one failure mode for each component of a system dataset describing the technical system. A second step of associating at least one effect and at least one related maintenance task with each failure mode to mitigate and/or to dissolve the effect in the meta data model. A third step of computing failure probabilities of said technical system based on the meta data model, while the technical system is in the specific situation.

Abstract: The present disclosure provides methods and circuits for managing failing sectors in a non-volatile memory. A record address and a read control signal are received, where the record address identifies a location in the non-volatile memory. The record address is compared with a plurality of dead sector addresses, where the dead sector addresses correspond to a subset of sectors located in the non-volatile memory. Data located at the record address is determined to be invalid in response to a combination of a first detection that the record address matches one of the dead sector addresses and a second detection that the read control signal indicates a read operation is requested to be performed on the non-volatile memory.

Abstract: Embodiments are directed to predicting the health of a computer node using health report data and to proactively handling failures in computer network nodes. In an embodiment, a computer system monitors various health indicators for multiple nodes in a computer network. The computer system accesses stored health indicators that provide a health history for the computer network nodes. The computer system then generates a health status based on the monitored health indicators and the health history. The generated health status indicates the likelihood that the node will be healthy within a specified future time period. The computer system then leverages the generated health status to handle current or predicted failures. The computer system also presents the generated health status to a user or other entity.

Abstract: A storage system maintains a cache and a non-volatile storage. An error recovery component queries a cache component to determine whether modified customer data exists in a memory preserve cache. In response to determining that the modified customer data exists in the memory preserve cache, and in response to a failure beyond a threshold number of times of initial microcode load (IML) attempts to recover the modified customer data, an error notification is transmitted for manual intervention to avoid loss of the modified customer data.

Abstract: Embodiments include accelerating capture of a system dump at system failure in a computer system. A method includes capturing a system snapshot that includes data from real memory frames of the computer system and storing the system snapshot in a storage. The method also includes monitoring periodically a change between the data in the system snapshot and a current state of the real memory frames of the computer system and updating the system snapshot according to the changed real memory frames based on a rate of change of the real memory frames. Further, in response to encountering the system failure, the snapshot is updated based on a delta between the system snapshot and the current state of the real memory frames. The snapshot on the storage is used as the system dump. The present document further describes examples of other aspects such as systems, computer products.