Abstract: A method includes, with a Virtual Network Function (VNF) manager that manages a VNF that includes plurality of VNF components running on a plurality of virtual machines, determining that an additional VNF component should be provisioned on an additional virtual machine. The method further includes, in response to the determining that the additional VNF component should be provisioned, instructing a compute controller to provision the additional virtual machine. The method further includes instructing a Software-Defined Networking (SDN) controller to connect the additional virtual machine to a network that interconnects the VNF components, and provisioning the additional VNF component on the additional virtual machine.

Abstract: Allocating threads to processors based, at least in part, on identifiers for thread sets and applications. A thread is paired with an application and, using the identifier for the application, an ID pairing is allocated to a processor.

Abstract: A system and method for data stream processing. Two or more instances are connected as a topology, wherein at least one of the instances is a spout and at least one of the instances is a bolt. The topology is submitted to a scheduler, wherein the service scheduler receives resource offers from a cluster manager representing computing resources available on one or more of cluster nodes and determines resources to accept and computations to run on the accepted computing resources. The topology is scheduled as one or more jobs, wherein each job includes two or more containers, including a first container and a second container, the first container including a topology master and the second container including a stream manager and one or more stream processing system (SPS) instances, wherein each SPS instance represents one of the instances in the topology.

Abstract: In one embodiment, a system for managing a virtualization environment includes a set of host machines, each of which includes a hypervisor, virtual machines, and a virtual machine controller, and a first virtualized file server configured to receive a request to access a storage item located at a second virtualized file server, determine that the storage item is designated as being accessible by other virtualized file servers, identify an FSVM of the second virtualized file server at which the storage item is located, and forward the request to the FSVM of the second virtualized file server. The storage item may be designated as being accessible by other virtualized file servers when the storage item is associated with a predetermined tag value indicating that the storage item is shared among virtualized file servers. The predetermined tag value may be stored in a sharding map in association with the storage item.

Abstract: A multiprocessor computer system facility is provided for selectively reallocating a logical processing unit within the computer system. The logical processing unit is one logical processing unit of multiple logical processing units backed by a socket of a plurality of sockets of the multiprocessor computer system. The selectively reallocating includes: monitoring, during execution of program code of the multiple logical processing units, a performance metric of a hardware resource of the socket, the hardware resource being shared by the multiple logical processing units; and reassigning the logical processing unit, based on the monitoring, to a different socket of the plurality of sockets of the multiprocessor computer system to, in part, improve the performance metric of the hardware resource of the socket.

Abstract: A method of central processor unit (CPU) resource allocation for a multi-processor device includes the step of obtaining the amounts of demanded CPU resources for the process groups executing on the multi-processor device during a pre-configured time period. The method also includes the step of obtaining the amounts of idle CPU resources for the CPUs of the multi-processor device during the pre-configured time period. The method further includes the step of allocating the CPUs to the process groups based upon the obtained amounts of demanded CPU resources for the process groups and the obtained amounts of idle CPU resources for the CPUs.

Abstract: Techniques and systems for prescheduling an alternative CPU as soon as a need for a task is detected by a primary CPU are disclosed. A process includes detecting, by a producer thread running on a first CPU, an external interrupt, acquiring, by the producer thread, a spinlock, and in response to acquiring the spinlock, sending, by the producer thread, an event to a consumer thread that is to run on a second CPU. Upon receiving the event by the consumer thread, the consumer thread acquires the spinlock, which “stalls” the consumer thread in a loop until the spinlock is released by the producer thread. While the consumer thread is “waking up” in response to receiving the event from the producer thread, the producer thread creates a task, publishes the task, and releases the spinlock, thereby causing the consumer thread to exit the loop, retrieve the task, and execute the task.

Abstract: Systems and methods are described for handling requests to execute idempotent code in an on-demand code execution system or other distributed code execution environment. Idempotent code can generally include code that produces the same outcome even when executed multiple times, so long as dependencies for the code are in the same state as during a prior execution. Due to this feature, multiple executions of idempotent code may inefficiently use computing resources, particularly in on-demand code execution system (which may require, for example, generation and provisioning of an appropriate execution environment for the code). Aspects of the present disclosure enable the on-demand code execution system to process requests to execute code by verifying whether dependency states associated with the code have changed since a prior execution. If dependency states have not changed, no execution need occur, and the overall computing resource us of the on-demand code execution system is decreased.

Abstract: A method for performing processor resource allocation in an electronic device is provided, where the method may include the steps of: obtaining task-related information to determine whether a task of a plurality of tasks is a heavy task (e.g. the heavy task may correspond to heavier loading than others of the plurality of tasks), to selectively utilize a specific processor core within a plurality of processor cores to perform the task, and determining whether at least one scenario task exists within others of the plurality of tasks, to selectively determine according to application requirements a minimum processor core count and a minimum operating frequency for performing the at least one scenario task; and performing processor resource allocation according to a power table and system loading, to perform any remaining portion of the plurality of tasks. An apparatus for performing processor resource allocation according to the above method is provided.

Abstract: Components associated with the management, instantiation, and control of instances, such as virtual machine instances, are configurable for immutability. In some embodiments, immutability is requested for one or more functionalities affecting or otherwise associated with an instance. Information regarding the request, as well as the requested immutability, may be propagated to one or more components, such as management components, for enforcement. Instances configured to have some or part of their functionality designated as immutable may be used to implement some or all of the management components themselves, and thus be used as a part (or entirety) of a management subsystem for other instantiations.

Abstract: A method for application switching in an operating system may be provided. The method may comprise providing at least two active applications on the operating system, and providing a first list of actions related to the first active application, via a first interface, to an application switching manager, and providing a second list of actions related to the second active application, via a second interface, to the application switching manager. Additionally, the method may further comprise selecting an active application out of the at least two active applications together with selecting an action selected from the first list of actions for a first application or a second action for the second list for a second application using a graphical user interface.

Abstract: A system includes one or more computer systems that include one or more processors and memory. The memory includes instructions, that, upon being executed by the one or more processors, cause the system to generate forecast demand data for a first pool of servers configured to host virtual machine instances, generate forecast capacity data that forecasts a number of slots available to run virtual machine instances for the first pool of servers, and generate a first pool health index value based on a comparison of the forecast demand data with the forecast capacity data.

Abstract: Methods, systems, and computer-readable media for management of virtual desktop instance pools are disclosed. A plurality of virtual desktop instances are provisioned in a pool for a client organization. The number of virtual desktop instances does not exceed a number of virtual desktop slots for the client organization. To a first client device associated with a first user, access is provided to a particular virtual desktop instance based (at least in part) on a determination that a current number of connected virtual desktop instances is less than the number. To a second client device associated with a second user, access is denied to the plurality of virtual desktop instances based (at least in part) on a determination that a current number of connected virtual desktop instances meets the number.

Abstract: An electronic device includes a plurality of processes, an interrupt waiting unit for each of the processes, and an interrupt handler. The interrupt handler processes the interrupt. The interrupt waiting unit sets an interrupt waiting flag to wait for an occurrence of the interrupt. The interrupt handler, when the interrupt occurred, sets an interrupt style of the occurred interrupt and releases the interrupt waiting flag from the set state. The interrupt waiting unit, when the interrupt waiting flag was released from the set state, sets the interrupt waiting flag if the interrupt style set by the interrupt handler is not an interrupt style matched with the process, and operates the process if the interrupt style set by the interrupt hander is the interrupt style matched with the one of the processes. The interrupt waiting flag is located to each of the processes.

Abstract: Reducing computational load for systems tracking tasks performed in a shared electronic environment allows for users to receive more nuanced notifications about the use of the shared of the electronic environment, more frequent notifications, or let the systems use those resources for other purposes. The systems and methods discussed herein provide for batching and queueing of tasks to reduce the computational load of systems and thereby improve the systems themselves and the user experience.

Abstract: A method and system for scheduling a time critical task. The system may include a processing unit, a hardware assist scheduler, and a memory coupled to both the processing unit and the hardware assist scheduler. The method may include receiving timing information for executing the time critical task, the time critical task executing program instructions via a thread on a core of a processing unit and scheduling the time critical task based on the received timing information. The method may further include programming a lateness timer, waiting for a wakeup time to obtain and notifying the processing unit of the scheduling. Additionally, the method may include executing, on the core of the processing unit, the time critical task in accordance with the scheduling, monitoring the lateness timer, and asserting a thread execution interrupt in response to the lateness timer expiring, thereby suspending execution of the time critical task.

Abstract: Presenting information to operators of a cluster of physical devices, regarding resources being used by physical machines assigned to physical devices in those clusters. An operator console, coupled to the cluster of physical devices, receives information from those physical devices with respect to use of resources by virtual machines assigned to those physical devices. Each physical device reports virtual machines assigned thereto, and an physical memory assigned to each one. The operator console presents information to the operator regarding use of resources by virtual machines, in a natural and visible way. Physical devices are disposed horizontally to indicate a selected device, and vertically to indicate allocated resources. Virtual machines are disposed with each virtual machine occupying a vertical amount proportional to allocated resources. The graphical interface allows the operator to reallocate virtual machines to physical devices, or reallocate resources to virtual machines.

Abstract: Determining optimum values for Map Reduce parameters by identifying parameters that affect performance of a Map Reduce job, determining a relationship between each of the identified parameters and a maximization of resource utilization for a plurality of computing resources configured for executing the Map Reduce job, representing a workflow based upon supply-demand relationships among the plurality of computing resources, modeling an execution cost as a function of the plurality of identified parameters, formulating a non-linear programming problem to minimize the execution cost, reformulating the non-linear programming problem as a linear programming problem, and solving the linear programming problem to determine a combination of parameter values for the plurality of identified parameters that minimizes the execution cost for the Map Reduce job.

Abstract: Systems and methods are described for managing initialization of virtual machine instances within an on-demand code execution environment or other distributed code execution environment. Such environments utilize pre-initialized virtual machine instances to enable execution of user-specified code in a rapid manner, without delays typically caused by initialization of the virtual machine instances. However, because the number of pre-initialized virtual machine instances maintained at an on-demand code execution environment is typically limited, insufficient number of pre-initialized virtual machine instances may be available at the on-demand code execution environment during times of heavy use. Embodiments described herein utilize pre-trigger notifications to indicate to the on-demand code execution environment that subsequent requests to execute user-specified code are likely to occur.

Abstract: In an asymmetric multi-CPU system on which a plurality of type of CPUs with different data processing performance and power consumption are mounted in groups for each type, a plurality of forms of combination of the types and numbers of CPUs are defined in such a way that the maximum numbers of the overall data processing and power consumption very by stages. Then, the system performs a control of allocation of the data processing to the CPU identified by the form selected from the definition information according to the data processing environment, in order to reduce unnecessary power consumption according to the data processing environment, such as data processing load, and to easily achieve the required data processing performance.