The present disclosure relates to minimizing the execution time of compute workloads in a distributed computing system. An example method generally includes receiving, from each of a plurality of server clusters, an estimated completion time and cost information predicted to be consumed in processing the compute workload. A workload manager compares the received estimates to a completion time and threshold ...

A selection of a document that includes a command and a parameter is received, and a user is caused to be associated with a policy that grants permission to execute the document. A request is received, from a requestor, to execute the document, the request including a parameter value, and the requestor is determined to be the user associated with ...

A method may be practiced in a distributed computing environment that provides computing resources to a plurality tenants. The method includes acts for allocating a limited set of system resources to the tenants. The method includes identifying a resource slice. The method further includes identifying an executing tenant workload. Checkpoint characteristics are identified for the executing tenant workload. Based on ...

A cloud-based broker service may be provided for computing devices in a distributed computing environment. The broker service may aggregate user accounts and user account credentials utilized for accessing online services by the computing devices. The broker service may monitor a context of the computing devices associated with the user accounts. The broker service may then utilize the context, data ...

Proposed is a capability management system (cms) in a distributed computing environment that controls access to multiple objects by multiple subjects based upon a specified access order. A capability is dynamically constructed when the capability is needed. After the capability is used to access an object, a new capability is generated. In the alternative, multiple capabilities for enforcing an access ...

A time series of metric values indicative of a cost of executing a job may be acquired. The acquired time series may be normalized to form a skyline indicative of costs incurred, over time, during an instance of executing the job. A modelled skyline may be formed by a best-fit analysis of a plurality of metric-based skylines, constrained by penalties ...

The current document is directed to methods and systems that efficiently distribute virtual-machine images (“vm images”) among servers within large, distributed-computer-system-implemented iaas platforms to facilitate temporally and computationally efficient instantiation of virtual machines within the servers. In implementations discussed below, vm images are stored in a distributed fashion throughout one or more distributed computing systems, using ...

Mechanisms for identifying a component cluster among a plurality of components in a distributed computing environment are disclosed. Configuration information that corresponds to the plurality of components is accessed. The configuration information includes inter-component communication information. The inter-component communication information between the plurality of components is matched to determine a plurality of pairs of components that communicate with one another. ...

The present disclosure provides methods, systems, and media for quantum computing, including allowing access to quantum ready and/or quantum enabled computers in a distributed computing environment (e. G., the cloud). Such methods and systems may provide optimization and computational services. Methods and systems of the present disclosure may enable quantum computing to be relatively and readily scaled across various ...

A recovery site is configured to process a task using a copy of an original file associated with the task. The original file is stored on a production site, and a copy of the original file is stored on a recovery site. The task is determined to be suitable for processing on the recovery site. The original file is determined ...

One embodiment of the present invention sets forth a technique for testing microservices in distributed computing systems. The technique includes routing a first traffic sample associated with request traffic from one or more client devices to a first instance of a first service implemented in a distributed computing system, wherein the first instance generates a first plurality of request responses ...

Described is a framework (or technique or method) and system for providing a distributed computing network including different types of devices. The framework allows peer devices to transmit “packages” of information (e. G. Messages) throughout the network as conceptual units of a job or data. The framework allows portable code, which is used to perform one ...

A distributed computing system comprising a plurality of nodes may be configured to receive a client request from at least one client device connected to the distributed computing system over a communication network. Each node of the plurality of nodes may be interlinked and configured to execute an action commit routine independently by broadcasting messages to each other and without ...

A machine implemented method and system, including: receiving at a near real-time processor module, one or more tenant-specific business objects from a message handler module; receiving at the near real-time processor module, contextual data related to the received one or more tenant-specific business objects from a platform analytics module; forming at the near real-time processor module, one or more events ...

A system and method of providing enhanced data processing and analysis in an infrastructure for distributed computing and large-scale data processing. This infrastructure uses the apache spark framework to divide an application into a large number of small fragments of work, each of which may be performed on one of a large number of compute nodes. The work may involve ...

Embodiments of the inventive subject matter include receiving, in a distributed computing environment, a plurality of files for execution. Embodiments further include identifying, by parsing the plurality of files, code segments contained in each of the plurality of files. Embodiments further include determining, based on a comparison of the code segments and definitions contained in a distributed computing basic function ...

Techniques for scheduling processing tasks in a device having multiple computing elements are disclosed. A network interface controller of the device receives processing tasks, for execution on the computing elements, from a network that is external to the device. The network interface controller schedules the tasks for execution on the computing devices based on policy data available to the network ...

A set of source files is stored in a shared storage repository for nodes of a distributed computing environment for software compilation. An object file is created based on at least a portion of the set of source files. A directed acyclic graph (dag) is generated corresponding to a group of software build tasks and the relationship between the software ...

A set of source files is stored in a shared storage repository for nodes of a distributed computing environment for software compilation. An object file is created based on at least a portion of the set of source files. A directed acyclic graph (dag) is generated corresponding to a group of software build tasks and the relationship between the software ...

A recovery site is configured to process a task using a copy of an original file associated with the task. The original file is stored on a production site, and a copy of the original file is stored on a recovery site. The task is determined to be suitable for processing on the recovery site. The original file is determined ...

Aspects extend to methods, systems, and computer program products for optimally pipelining result sets with fault tolerance in distributed query execution. Distributed computing jobs are optimized by dividing the distributed computing jobs into one or more bubbles for execution. Each bubble can be independently executed, potentially in parallel with other bubbles, when resources to handle the bubble are available. Intra-bubble ...