Abstract: Systems and methods are provided for allowing end users to intuitively databind functional components to backend services through visual affordances. Each UI component can advertise which sections of the UI can be independently databound to individual properties coming from data of backend services. When the user wishes to databind a UI component, the sections of the UI that can be databound now transforms to show relevant text describing the function of that particular section. The user can be presented with a databinding interface that consistent of all the possible pieces of data that the user can bind to as well as visual slots that map to the slots in the visual preview. To databind a component, a user can drag and drop the particular piece of data from the available list, and drop that into the slot they want that data to apply to.

Abstract: An information processing system includes circuitry configured to identify a plurality of systems that each access at least one of a plurality of virtual machines executed by a server, generate, for each system, a value indicating whether performance of the system satisfies an agreement for the system if a virtual machine accessed by the system is stopped, determine a virtual machine to be stopped among the plurality of virtual machines based on the values.

Abstract: In an embodiment, a method is provided. The method includes managing user-level threads on a first instruction sequencer in response to executing user-level instructions on a second instruction sequencer that is under control of an application level program. A first user-level thread is run on the second instruction sequencer and contains one or more user level instructions. A first user level instruction has at least 1) a field that makes reference to one or more instruction sequencers or 2) implicitly references with a pointer to code that specifically addresses one or more instruction sequencers when the code is executed.

Abstract: Automatic programming, scheduling, and control of planned activities at “worker nodes” in a distributed environment are provided by a “real-time self tuner”(RTST). The RTST provides self-tuning of controlled interoperation among an interconnected set of distributed components (i.e., worker nodes) including, for example, home appliances, security systems, lighting, sensor networks, medical electronic devices, wearable computers, robotics, industrial controls, wireless communication systems, audio nets, distributed computers, toys, games, etc. The RTST acts as a centralized “planner” that is either one of the nodes or a dedicated computing device. A set of protocols allow applications to communicate with the nodes, and allow one or more nodes to communicate with each other.

Abstract: Some embodiments provide a method for an application operating on a host machine. The method receives a configuration of a Dynamic Host Configuration Protocol (DHCP) service for implementation within a virtualized container on the host machine. The configuration includes several database table entries. The method converts the several database table entries into a configuration file for use by a process that operates in the virtualized container. the method initializes the process in the virtualized container. The process in the virtualized container reads the configuration file in order to perform DHCP services for machines connected to at least one logical forwarding element of a logical network.

Abstract: Described herein are technologies related to enforcing thread dependency using a hybrid scoreboard. An encoded video information that includes a plurality of threads is received, a first set and a second set of threads from the plurality of thread is determined, the first and second sets of threads are assigned to a hardware and a software, respectively, and dependency threads in the first and second sets of threads is enforced.

Abstract: To provide a virtual resource control system capable of appropriately defining the amounts of allocated virtual resources to individual service systems under an environment in which service systems are added or deleted. A resource excessive/lacking amount calculation means 54 simulates a resource consumption situation of each node in the service system by use of a hybrid model, and calculates the amount of excessive/lacking resource indicating the lacking amount or the excessive amount of the amount of allocated virtual resource corresponding to one entire service system corresponding to a service management device. The resource excessive/lacking amount calculation means 54 notifies the amount of excessive/lacking resource to a hub device 60, and receives a notification of the new amount of allocated virtual resource corresponding to the entire service system. A notification by the resource excessive/lacking amount calculation means 54 and a response from the hub device 60 are made asynchronously.

Abstract: A novel approach to coordinate processes in a process environment includes establishing a coherent temporal and resource framework for operation of selected processes in order to formulate a basis for coordination. A key aspect of the present innovation includes the novel techniques for coordinating processes including transmission of electromagnetism and transmission of electromagnetic radiation in a process environment by effecting periodic interruptions, based upon the abovementioned coherent temporal and resource framework, while maintaining the required operational and safety procedures.

Abstract: Systems and methods for prioritizing cloud-based computing tasks are provided. An example method includes, identifying a first plurality of service requests submitted by a plurality of users including a first user; selecting a first service request, in the plurality of service requests, in accordance with a first priority, where the first service request is submitted by the first user; selecting a second service request submitted by the first user, in a second plurality of service requests submitted by the first user, in accordance with a second priority, where the second service request is associated with a first job type; and selecting a third service request submitted by the first user, in a third plurality of service requests submitted the first user, in accordance with a third priority, where the third plurality of service requests submitted the first user are associate with a same job type.

Abstract: The deterministic algorithm may analyze data by defining a plurality of blocks, identify a task for each of the blocks, and identify any operations on which the task is dependent. The algorithm may store in a first data structure an entry for each of the blocks identifying whether a precondition must be satisfied before tasks associated with the blocks can be initiated, store in a second data structure a status value for each of the blocks and make the stored status values changeable by multiple threads, and assign a plurality of the tasks to a plurality of threads, wherein each thread is assigned a unique task, wherein each of the plurality of threads executes its assigned task when the status of the block corresponding to its assigned task indicates that the assigned task is ready to be performed and the precondition associated with the block has been satisfied if the precondition exists.

Abstract: In one embodiment, a computing device identifies a portion of a display object to pre-generate. The device may monitor a thread to identify the next upcoming window of idle time (i.e., the next opportunity when the thread will be idle for a minimum period of time). The device may add one or more selected pre-generation tasks to a message queue for execution by the thread during the window. The device may execute the one or more selected pre-generation tasks in the message queue by pre-generating at least one selected element of a display object with content for a portion of the content layout, and then return the display object.

Abstract: Systems, methods, and apparatuses for resource monitoring identification reuse are described. In an embodiment, a system comprising a hardware processor core to execute instructions storage for a resource monitoring identification (RMID) recycling instructions to be executed by a hardware processor core, a logical processor to execute on the hardware processor core, the logical processor including associated storage for a RMID and state, are described.

Abstract: Techniques to facilitate virtual machine (VM) host maintenance are disclosed. A host requiring maintenance is converted to a VM running on another host which satisfies certain requirements, such as having sufficient resources and the same network connectivity as the host requiring maintenance. As part of this physical-to-virtual conversion, or after said conversion, the VM may be synchronized to the host requiring maintenance, such that the CPU state and memory contents of the VM and host are identical. Active control may then be passed to the VM, and the host powered down for the maintenance. After maintenance is completed and the host powered back on, virtual-to-physical conversion may be applied to convert the VM back to the host. The host may then be synchronized to the VM, and active control passed back to the host.

Abstract: A method of monitoring thread execution within a multicore processor architecture which comprises a plurality of interconnected processor elements for processing the threads, the method comprising receiving a plurality of thread parameter indicators of one or more parameters relating to the function and/or identity and/or execution location of a thread or threads, comparing at least one of the thread parameter indicators with a first plurality of predefined criteria each representative of an indicator of interest, and generating an output consequential upon thread parameter indicators which have been identified to be of interest as a result of the said comparison.

Abstract: A software component for automated processing of multi-usage data, implementing functions requiring various levels of security or limits of responsibility. The software component includes a plurality of virtual machines, each virtual machine being adapted for executing at least one function requiring a level of security or a limit of responsibility which is predetermined and a hypervisor adapted for controlling execution of the plurality of virtual machines.

Abstract: A processing core comprising instruction execution logic circuitry and register space. The register space to be loaded from a VMCS, commensurate with a VM entry, with information indicating whether a service provided by the processing core on behalf of the VMM is enabled. The instruction execution logic to, in response to guest software invoking an instruction: refer to the register space to confirm that the service has been enabled, and, refer to second register space or memory space to fetch input parameters for said service written by said guest software.

Abstract: A processing core comprising instruction execution logic circuitry and register space. The register space to be loaded from a VMCS, commensurate with a VM entry, with information indicating whether a service provided by the processing core on behalf of the VMM is enabled. The instruction execution logic to, in response to guest software invoking an instruction: refer to the register space to confirm that the service has been enabled, and, refer to second register space or memory space to fetch input parameters for said service written by said guest software.

Abstract: A job scheduler system includes one or more hardware processors, a memory including a job group queue stored in the memory, and a job scheduler engine configured to create a first job group in the job group queue, the first job group includes a generation counter having an initial value, receive a first request to steal the first job group, determine a state of the first job group based at least in part on the generation counter, the state indicating that the first job group is available to steal, based on the determining the state of the first job group, atomically increment the generation counter, thereby making the first job group unavailable for stealing, and alter an execution order of the first job group ahead of at least one other job group in the job group queue.

Abstract: A load balancer allocates requests to a pool of web servers configured to have low queue capacities. If the queue capacity of a web server is reached, the web server responds to an additional request with a rejection notification to the load balancer, which enables the load balancer to quickly send the rejected request to another web server. Each web server self-monitors its rejection rate. If the rejection rate exceeds a threshold, the number of processes concurrently running on the web server is increased. If the rejection rate falls below a threshold, the number of processes concurrently running on the web server is decreased.

Abstract: A client supported by remote maintenance in an electronic network configured to serve a plurality of clients may comprise a plurality of nodes, a first virtual machine (VM), a second virtual machine, and a virtual machine manager (VMM). The first VM may handle data associated with an external data center. The second VM may be associated with one of the plurality of nodes. The VMM may be configured to manage data transfer between the first VM and the second VM. The first VM may be configured to assess a state of the client system and identify a software update for installation on the one of the plurality of nodes. The software update may be configured to maintain identity between the data in the one of the plurality of nodes and the data center. The VMM may manage an attestation process prior to delivering or installing the software update on the client system using the first VM.