Abstract: A system and method for a virtual desktop system is disclosed. The system includes a master fabric region including resources for provisioning a desktop. The system includes a plurality of expansion fabric regions. Each of the expansion fabric regions including replicated resources for provisioning the desktop from the master fabric region. The system includes a control plane having a global pool. A client device application operated by a user associated with the global pool accesses a desktop from either the master fabric region or one of the expansion fabric regions. The control plane is operable to add a new expansion fabric region to the plurality of expansion fabric regions or eliminate one of the plurality of expansion fabric regions.

Abstract: A method for minimizing allocation failures in a cloud computing system without overprovisioning may include determining a predicted supply for a virtual machine series in a system unit of the cloud computing system during an upcoming time period. The predicted supply may be based on a shared available current capacity and a shared available future added capacity for the virtual machine series in the system unit. The method may also include predicting an available capacity for the virtual machine series in the system unit during the upcoming time period. The predicted available capacity may be based at least in part on a predicted demand for the virtual machine series in the system unit during the upcoming time period and the predicted supply. The method may also include taking at least one mitigation action in response to determining that the predicted demand exceeds the predicted supply during the upcoming time period.

Abstract: An example method of interfacing with a hypervisor in a computing system is described, which includes a processor having at least three hierarchical privilege levels including a third privilege level more privileged than a second privilege level, the second privilege level more privileged than a first privilege level.

Abstract: Examples herein relate to checkpoint replication and copying of updated checkpoint data. For example, a memory controller coupled to a memory can receive a write request with an associated address to write or update checkpoint data and track updates to checkpoint data based on at least two levels of memory region sizes. A first level is associated with a larger memory region size than a memory region size associated with the second level. In some examples, the first level is a cache-line memory region size and the second level is a page memory region size. Updates to the checkpoint data can be tracked at the second level unless an update was previously tracked at the first level. Reduced amounts of updated checkpoint data can be transmitted during a checkpoint replication by using multiple region size trackers.

Abstract: Techniques are disclosed for dynamic access and instrumentation of model specific registers (MSRs). A virtual machine monitor (VMM) can provide a kernel application program interface (API) that can be utilized to access and instrument an MSR. A method may include receiving, by the VMM, an MSR instrumentation command that identifies an MSR to instrument and causing instrumentation of the MSR identified in the MSR instrumentation command. Instrumentation of the identified MSR can be caused by configuring or manipulating a virtual machine control structure (VMCS) of a guest virtual machine (VM). The MSR instrumentation command may be an MSR instrumentation request command, an MSR remove request command, an MSR value set request command, or an MSR value fetch request command. In some cases, the VMM may be a Type-I hypervisor.

Abstract: A system implements task contention reduction via policy-based selection. Tasks waiting to be performed are indexed in a task data structure that groups the tasks based on the resources to which the tasks pertain. Workers request batches of tasks for the workers to perform. A scan cycle includes building multiple batches of tasks by scanning the task data structure for a requesting worker. A policy (e.g., random or some other form of optimization) determines where the scan cycle starts in the data structure. Each batch of tasks is delivered to a worker along with a token that keeps the state of the scan cycle (e.g., where the scan cycle started, and where the next scan to build the next batch within the scan cycle begins). The worker returns the token with the next request for the next batch and the next batch is built based on the token's state information.

Abstract: Methods are provided. A method includes announcing to a network meta information describing each of a plurality of distributed data sources. The method further includes propagating the meta information amongst routing elements in the network. The method also includes inserting into the network a description of distributed datasets that match a set of requirements of the analytics task. The method additionally includes delivering, by the routing elements, a copy of the analytics task to locations of respective ones of the plurality of distributed data sources that include the distributed datasets that match the set of requirements of the analytics task.

Abstract: A method for updating software in one or more servers in a managed system includes bootstrapping of shared secrets to secure communication, using an object store with publicly accessible URLs as a mailbox system between a patch agent locally at the managed system and a patch management server located remotely. The object store provides for indirect and asynchronous communication, allowing the patch management server to manage the updates, whereas the patch agent executes the updates. The patch management server keeps track of update results, and when an update is unsuccessful it performs and supports a remediation process. Both the patch agent and the patch management server keep full logs of the update results to allow for auditing.

Abstract: A method for recovering data includes obtaining a recovery request for application data, identifying a backup associated with the recovery request, generating a placeholder disk associated with the backup, generating a template virtual machine associated with the placeholder disk, generating an application-based virtual disk based on the placeholder disk, generating a file extent map based on the recovery request, populating the application-based virtual disk using the backup, the placeholder disk, and the file extent map to obtain a populated application-based virtual disk, replacing the placeholder disk with the populated application-based virtual disk, and after replacing the placeholder disk with the populated application-based virtual disk, initiating a migration of the template virtual machine.

Abstract: In general, embodiments of the invention relate to a method and computing system for scheduling tasks (functions or routines) dynamically from Input/Output (I/O) operations that may be received from a client. The scheduling or ordering of the tasks play an important role in the overall latency of the execution of IO operations, as each task may consume significant amount of computing resources.

Abstract: System and method for providing fault tolerance in virtualized computer systems use a first guest and a second guest running on virtualization software to produce outputs, which are produced when a workload is executed on the first and second guests. An output of the second guest is compared with an output of the first guest to determine if there is an output match. If there is no output match, the first guest is paused and a resynchronization of the second guest is executed to restore a checkpointed state of the first guest on the second guest. After the resynchronization of the second guest, the paused first guest is caused to resume operation.

Abstract: The disclosure provides an approach for processing frames of a virtualized desktop to improve accessibility for users, such as users with disabilities. The approach involves processing frames by an accessibility engine that is located on a client device of the user. The virtualized desktop runs on a virtual machine that is remote to the client device. The location of the accessibility engine on the client device allows advantages such as the ability to process frames that indicate a non-operational virtual machine.

Abstract: Training and/or utilization of a neural decompiler that can be used to generate, from a lower-level compiled representation, a target source code snippet in a target programming language. In some implementations, the lower-level compiled representation is generated by compiling a base source code snippet that is in a base programming language, thereby enabling translation of the base programming language (e.g., C++) to a target programming language (e.g., Python). In some of those implementations, output(s) from the neural decompiler indicate canonical representation(s) of variables. Technique(s) can be used to match those canonical representation(s) to variable(s) of the base source code snippet. In some implementations, multiple candidate target source code snippets are generated using the neural decompiler, and a subset (e.g., one) is selected based on evaluation(s).

Abstract: Technologies are described herein for generating a service application. A service application generator can be used to generate a service application upon receiving a prompt to generate the service application. The service application generator can interface with a user or other entity to determine information used to build a service application.

Abstract: A network-based virtual computing resource provider may offer virtual compute instances that implement rolling resource credits for scheduling virtual computing resources. Work requests for a virtual compute instance may be received at a virtualization manager. A resource credit balance may be determined for the virtual compute instance. The resource credit balance may accumulate resource credits in rolling fashion, carrying over unused credits from previous time periods. Resource credits may then be applied when generating scheduling instructions to provide to a physical resource to perform the work requests, such as a physical CPU in order to increase the utilization of the resource according to the number of credits applied. Applied resource credits may then be deducted from the credit balance.

Abstract: Systems, methods, and storage media for optimizing automated modelling of resource allocation are disclosed. Exemplary implementations include operations for: receive or retrieve by a computer system, operational information associated with a plurality of users; allocate, by the computer system, at least a first time portion to at least a first task associated with a first user of the plurality of users based on analysis of the operational information; and dynamically modify, by the computer system, the first time portion responsive to receiving or retrieving additional operational information over time.

Abstract: Concurrent threads may be synchronized at the level of the memory words they access rather than at the level of the lock that protects the execution of critical sections. Each lock may be associated with an array of flags and each flag may indicate ownership of certain memory words. A pessimistic thread may set flags corresponding to memory words it is accessing in the critical section, while an optimistic thread may read the corresponding flag before any memory access to ensure that the flag is not set and that therefore the associated memory word is not being accessed by the other thread. Thus, optimistic threads that do not have conflicts with the pessimistic thread may not have to wait for the pessimistic thread to release the lock before proceeding.

Abstract: Methods and systems are described for cross-cloud call detection. The system may include detecting an instruction configured to call a resource. The instruction may include a name indicative of the resource and one or more values. The resource is configured to construct code using the one or more values. The system may determine the resource is incompatible with a service based on at least the name and the one or more values of the instruction. A conversion of source code is halted when the resource is incompatible with the service.

Abstract: Systems, apparatuses, and methods related to a virtual machine register in a computer processor are described. For example, a memory coupled to the computer processor can store instructions of routines of predefined, non-hierarchical domains. The computer processor can store, in the virtual machine register, an identifier of a virtual machine for which the processor is currently executing instructions in a current domain in the set of domains. For example, the processor can implement resource restriction/mapping and/or perform address translation for the virtual machine based on the identifier stored in the virtual machine register.

Abstract: A computer system includes memory and at least one processor. The memory stores a codebase, multiple reusable software modules, and computer-executable instructions. The codebase includes an application class extension, an activity class extension, a module base definition class, and a theme. The instructions include creating a software application using the application class extension and the theme from the codebase, registering at least one of the multiple reusable software modules to the software application, and configuring the software application to arrange navigation for each activity of each reusable software module registered to the software application, to present a same user experience throughout the software application. The instructions also include configuring the software application to automatically apply a same layout theme for each activity of each reusable software module registered to the software application, to present a same user experience throughout the software application.