Abstract: Various examples for application management detection are described. In one example, depending upon whether an installation token includes a unique token value, a client device can determine whether an application is managed or unmanaged. Additionally, the client device can determine whether the application is managed or unmanaged based on whether a keychain installation token includes a unique token value, a value of a keychain installation token, and a value of a launched flag for the application. Using the concepts described herein, an unmanaged application can proceed to execute with limited functionality, present a notification that it should be reinstalled by the management service, stop executing, or take other measures.

Abstract: Presenting historical state associated with prior execution of an entity. Based on replaying segment(s) of execution of an entity based on a trace, embodiments could present an indication of whether a value of a code element is, at a first execution time point, unknown, known, previously known, and/or known in the future. Additionally, or alternatively, embodiments could present an indication of a value relied upon by simulated execution of a function at a second execution time point, along with an indication of a timing of knowledge of the value in relation to the second execution time point. Additionally, or alternatively, embodiments could present an indication that a return value of a function would be known if the function had executed at a third execution time point, or an indication that the return value would be unknown if the function had executed at the third execution time point.

Abstract: Some computing devices have limited resources such as, for example, battery power. When a user ceases to interact with an application, execution of the application can be moved to background and the application can be paused. During the time period in which the application is paused, the application consumes no CPU cycles because executing managed threads of the paused application are stopped, and native threads are prevented from running using asynchronous procedure calls.

Abstract: The technology disclosed relates to providing strong ordering in multi-stage processing of near real-time (NRT) data streams. In particular, it relates to maintaining current batch-stage information for a batch at a grid-scheduler in communication with a grid-coordinator that controls dispatch of batch-units to the physical threads for a batch-stage. This includes operating a computing grid, and queuing data from the NRT data streams as batches in pipelines for processing over multiple stages in the computing grid.

Abstract: Implementations for a user interface for MapReduce job are disclosed. A method of the disclosure includes receiving a request to submit a MapReduce job to a cluster and providing a first graphical user interface (GUI) to input a first set of arguments and first argument values for a first portion of the arguments. The method may include receiving, from the first GUI, the first argument values and a second portion of the arguments, associated with a configuration of the cluster and without a corresponding argument value. The method may provide a second GUI that is to display the arguments, first argument values, and allow for a selection of second argument values for the second portion of the arguments. In response to a selection, the method may execute the MapReduce job in view of the first argument values from the first GUI and the second argument values from the second GUI.

Abstract: Techniques for placing containers in a cloud (e.g., into virtual machines (“VMs”)) based on container policies. The container policies may specify compute-related qualities, storage-related quality, and/or network-related qualities that are to be met by the underlying software and hardware that supports execution of the virtual machines. A cloud director or other entity receives requests to place containers in a particular virtual machine based on the container policies and directs placement of the virtual machine based on the policies. The cloud director may migrate and/or reconfigure VMs, virtual machine disk files, and/or virtual network interface controllers to satisfy the container placement policy. After placement, the cloud director may disable migration to maintain the VM in a desired state.

Abstract: Aspects of the disclosure relate to cloud service automation of common image management. An image update orchestrator may receive a request to upgrade a virtual machine image. The image update orchestrator may spin up an instance of a virtual machine and provision the instance of the virtual machine with a virtual machine image and cause to install a plurality of software updates to the instance of the virtual machine. The image update orchestrator may take a snapshot of the instance of the virtual machine and generate a sealed master image. Finally, the image update orchestrator may cause to deploy, to one or more policy managed devices, the sealed master image.

Abstract: A prototype management system to provide cross team tools, frameworks, prototype management, and prototype tracking capabilities to improve the overall timeliness and quality of application and web-based product development. In an example, the prototype management system may be configured to cause the prototype to act as a live website that may be accessed by each of the teams and causes each team member to develop operable objects opposed to simulated objects.

Abstract: Efficient instantiation of encrypted guests is disclosed. In an example, a first host with a first hypervisor is separated from a second host with a second hypervisor by a network. The first hypervisor executes to allocate a requested amount of memory associated with a first guest on the first host. Pages of the requested amount of memory written to by a boot process of the first guest are tracked. The second hypervisor is requested to allocate the requested amount of memory on the second host. All tracked pages written to by the boot process are transferred to the second host. In response to transferring all of the tracked pages, a transfer completion confirmation is sent to the second hypervisor and a second guest that is a migrated copy of the first guest is instantiated on the second host with the transferred pages from the first guest.

Abstract: A method begins by a processing module of a dispersed storage and task (DST) execution unit receiving a data request for execution by the DST execution unit, the data request including an execution deadline. The method continues with the processing module comparing the execution deadline to a current time. When the execution deadline compares unfavorably to the current time the method continues with the processing module generating an error response. When the execution deadline compares favorably to the current time the method continues with the processing module determining a priority level based on the deadline and executing the data request in accordance with the priority level.

Abstract: Systems and methods are provided for parallel processing of datasets with dynamic skew compensation. The disclosed systems and methods may increase the efficiency of dataset processing by imposing maximum size limits on parallel processing environment tasks. The disclosed systems and methods may generate a target partition of a variable, a database storing data elements, a cluster that generates one or more output files based on the target partition and the data elements, and a display device that displays analysis results for the target partition using the one or more output files. Generation may comprise creating a calculation partition, mapping data elements according to the calculation partition, and generating the one or more output files based on the mapped data elements. The calculation partition may depend on a target partition and a uniform partition that partitions values based on one or more of statistical measures and pseudorandom functions.

Abstract: A graph-based program specification specifies at least a partial ordering among a plurality of tasks represented by its nodes. Executing a specified program includes: executing a first subroutine corresponding to a first task, including a first task section for performing the first task; storing state information indicating a state of the first task selected from a set of possible states that includes: a pending state in which the first task section is waiting to perform the first task, and a suppressed state in which the first task section has been prevented from performing the first task; and executing a second subroutine corresponding to a second task, including a second task section for performing the second task, and a control section that controls execution of the second task section based at least in part on the state of the first task indicated by the stored state information.

Abstract: In a system for automatic generation of event-driven, tuple-space based programs from a sequential specification, a hierarchical mapping solution can target different runtimes relying on event-driven tasks (EDTs). The solution uses loop types to encode short, transitive relations among EDTs that can be evaluated efficiently at runtime. Specifically, permutable loops translate immediately into conservative point-to-point synchronizations of distance one. A runtime-agnostic which can be used to target the transformed code to different runtimes.

Abstract: Embodiments of the present invention include systems and methods for dynamically adjusting instrumentation scope of a profiler gent. The method for dynamically adjusting an instrumentation scope of a profiler agent includes: supplying an initial instrumentation scope profile (ISP) that defines an instrumentation scope of a profiler agent to the profiler agent; receiving performance data of a call tree from the profiler agent based on the initial ISP; adjusting the instrumentation scope; updating the initial ISP based on the adjusted instrumentation scope; and supplying the updated ISP to the profiler agent. Adjusting the instrumentation scope includes at least one of expanding a child node of the call tree and excluding a child node of the call tree from the instrumentation scope.

Abstract: Systems, apparatuses, and methods for suspending and restoring operations on a processor are disclosed. In one embodiment, a processor includes at least a control unit, multiple execution units, and multiple work creation units. In response to detecting a request to suspend a software application executing on the processor, the control unit sends requests to the plurality of work creation units to stop creating new work. The control unit waits until receiving acknowledgements from the work creation units prior to initiating a suspend operation. Once all work creation units have acknowledged that they have stopped creating new work, the control unit initiates the suspend operation. Also, when a restore operation is initiated, the control unit prevents any work creation units from launching new work-items until all previously in-flight work-items have been restored to the same work creation units and execution units to which they were previously allocated.

Abstract: Aspects of the present invention provide systems and methods that ascertain appropriate time windows for when a task or tasks are best suited to be performed and also for appropriately sizing the number of tasks so that they can be completed within a window or windows. In embodiments, a system for estimating a system resource comprises a component selection system configured to receive a selection of one or more components and/or one or more metrics to be monitored. In embodiments, an analyzer uses at least some of the gathered data to determine one or more resource capacity windows for performing a task or tasks and determines an appropriate job size or sizes for scheduling the tasks to be performed within the one or more resource capacity windows.

Abstract: A method and system performs instruction scheduling in an out-of-order microprocessor pipeline. The method and system selects a first set of instructions to dispatch from a scheduler to an execution module, wherein the execution module comprises two types of execution units. The first type of execution unit executes both a first and a second type of instruction and the second type of execution unit executes only the second type. Next, the method selects a second set of instructions to dispatch, which is a subset of the first set and comprises only instructions of the second type. The method determines a third set of instructions, which comprises instructions not selected as part of the second set. Further, the method dispatches the second set for execution using the second type of execution unit and dispatching the third set for execution using the first type of execution unit.

Abstract: Embodiments relate to optimizing an indirect call function. More specifically, an indirect call function configuration comprises a first application module having a target function of the indirect function call, a second application module with a symbolic reference to the target function of the indirect function call, and a third application module to originate an indirect function call. A compiler is provided to identify potential target functions and indicate the potential target functions in the program code. Additionally, the compiler determines and indicates in the program code that the function pointer value resulting from a non-call reference of a function symbol is solely used to perform indirect calls in the same module. A linker can read the indication the compiler made in the program code and optimize the indirect call function.

Abstract: Embodiments relate to optimizing an indirect call function. More specifically, an indirect call function configuration comprises a first application module having a target function of the indirect function call, a second application module with a symbolic reference to the target function of the indirect function call, and a third application module to originate an indirect function call. A compiler identifies potential target functions and indicates the potential target functions in the program code. Additionally, the compiler determines and indicates in the program code that the function pointer value resulting from a non-call reference of a function symbol is solely used to perform indirect calls in the same module. A linker can read the indication the compiler made in the program code and optimize the indirect call function.

Abstract: A method finding the root cause of errors and/or unexpected behavior of a monitored software application, the method comprising: providing a decision tree corresponding to an error and/or unexpected behavior of a software application, wherein the decision tree comprising multiple nodes, wherein the decision tree further comprising one or more leaf nodes, wherein the leaf nodes indicates at least one reason and one or more possible solutions for the error and/or unexpected behavior; scanning one or more log-files of a software application; determining, based on the decision tree and the scanned log files which step has been not performed by the software application, wherein the non-performed step being indicative for an error and/or unexpected behavior of the software application; determining a leaf node based on the determined non-performed step; extracting information from the leaf node; and providing a reason and/or a solution of the error and/or unexpected behavior.