Abstract: A computer implemented method for deprovisioning a virtual machine is provided. A number of processor units initializes a deprovisioning agent within the virtual machine. The number of processor units monitors a set of metrics in the virtual machine using the deprovisioning agent. The number of processor units deprovisions the virtual machine using the deprovisioning agent in response to the set of metrics meeting a set of criteria for deprovisioning the virtual machine.

Abstract: An approach is provided for sidecar sizing. An application running in a cluster of a containerized system is provided. The application includes at least one sidecar container having configuration data including a first size of the at least one sidecar container. Requests for the application over time and usage data for the application over time, including memory and/or CPU consumption, are monitored. The first size of the at least one sidecar container is evaluated, and a second size of the least one sidecar container is determined, based on the monitored requests for the application and usage data for the application. Updated configuration data for the at least one sidecar container, including the second size of the at least one sidecar container, is provided.

Abstract: A computer-implemented method for executing a serverless workload on a transient infrastructure is disclosed. The method comprises receiving a request for executing a workload and at least one policy, selecting an infrastructure component of the transient infrastructure for an execution of the workload, wherein the transient infrastructure is implemented utilizing a plurality of geographically distributed computing nodes, and executing the workload on the transient infrastructure. Furthermore, the method comprises upon receiving an interfering event during the execution of the workload causing a stop of the workload execution, freezing the execution of the workload, storing intermediate results and statuses of the workload execution in a cross-domain storage system, terminating the execution of the workload, and continuing the workload execution using the intermediate results and under a constraint defined by the at least one policy.

Abstract: A method, system, and computer program product for implementing automated serverless runtime container allocation is provided. The method includes defining a number of runtime containers and associated characteristics required for each worker node of a plurality of worker nodes for execution of a specified workload. The specified workload is dispatched to the plurality of worker nodes and a specified portion of the specified workload is assigned to each worker node. An application executing a universal runtime container that includes potential application runtimes and associated supported software versions within a layered modifiable format is generated and unused layers are removed from the universal runtime container. The specified workload is executed via the universal runtime container and a set of available universal runtime containers is refilled on an associated work node.

Abstract: Methods and systems for starting a node without a default password are provided. Exemplary methods include: creating a node responsive to indicia received from a user; checking for an existing keystore in the node; when no existing keystore is in the node: generating a seed password for a predefined user of the node; non-persistently providing the seed password to the user; creating an encrypted keystore in the node; and storing the seed password in the encrypted keystore; and allowing access to the node using the built-in user and seed password.

Abstract: Methods and systems for searching a frozen index are provided. Exemplary methods include: a method may comprise: receiving an initial search and a subsequent search; loading the initial search and the subsequent search into a throttled thread pool, the throttled thread pool including; getting the initial search from the throttled thread pool; storing a first shard from a mass storage in a memory in response to the initial search; performing the initial search on the first shard; providing first top search result scores from the initial search; and removing the first shard from the memory when the initial search is completed.

Abstract: Methods and systems for shard splitting are provided. Exemplary methods include: marking a source index as read only, the source index comprising a source shard, the source shard comprising a source reference; creating a target index, the target index comprising target shards, each target shard of the target shards comprising a target reference of target references; copying the source reference, the copying producing the target references; hashing identifiers in the source reference, each identifier being associated with a document of a plurality of documents of the source shard, the hashing assigning each document of the plurality of documents to a target shard of the target shards, the plurality of documents being stored in a file associated with the source reference; hard linking the file into the target references; marking the target index as read-write; and deleting the source index.

Abstract: A method, system, and computer program product for implementing automated serverless runtime container allocation is provided. The method includes defining a number of runtime containers and associated characteristics required for each worker node of a plurality of worker nodes for execution of a specified workload. The specified workload is dispatched to the plurality of worker nodes and a specified portion of the specified workload is assigned to each worker node. An application executing a universal runtime container that includes potential application runtimes and associated supported software versions within a layered modifiable format is generated and unused layers are removed from the universal runtime container. The specified workload is executed via the universal runtime container and a set of available universal runtime containers is refilled on an associated work node.

Abstract: Asynchronous search of electronic assets via a distributed search engine is disclosed herein. An example method includes receiving a request from a user, the request including a query and a query time parameter, the query time parameter defining a time that the user will wait for results to be completed synchronously, determining that the query is incomplete and that the time has been exceeded, issuing the query a unique query identifier, and asynchronously adding results to an index based on the unique query identifier.

Abstract: Asynchronous search of electronic assets via a distributed search engine is disclosed herein. An example method includes receiving a request from a user, the request including a query and a query time parameter, the query time parameter defining a time that the user will wait for results to be completed synchronously, determining that the query is incomplete and that the time has been exceeded, issuing the query a unique query identifier, and asynchronously adding results to an index based on the unique query identifier.

Abstract: A method, computer program product and computer system for predicting excessive resource usage in a distributed computing environment is provided. A processor retrieves a portion of code associated with a workload in a distributed computing environment. A processor retrieves account information associated with the workload. A processor determines a likelihood that the workload is indicative of excessive resource usage based on the portion of code and the account information associated with the workload. In response to the likelihood of excessive resource usage exceeding a threshold, a processor reschedules the workload in the distributed computing environment.

Abstract: Methods and systems for starting a node without a default password are provided. Exemplary methods include: creating a node responsive to indicia received from a user; checking for an existing keystore in the node; when no existing keystore is in the node: generating a seed password for a predefined user of the node; non-persistently providing the seed password to the user; creating an encrypted keystore in the node; and storing the seed password in the encrypted keystore; and allowing access to the node using the built-in user and seed password.

Abstract: Methods and systems for starting a node without a default password are provided. Exemplary methods include: creating a node responsive to indicia received from a user; checking for an existing keystore in the node; when no existing keystore is in the node: generating a seed password for a predefined user of the node; non-persistently providing the seed password to the user; creating an encrypted keystore in the node; and storing the seed password in the encrypted keystore; and allowing access to the node using the built-in user and seed password.

Abstract: Methods and systems for searching a frozen index are provided. Exemplary methods include: a method may comprise: receiving an initial search and a subsequent search; loading the initial search and the subsequent search into a throttled thread pool, the throttled thread pool including; getting the initial search from the throttled thread pool; storing a first shard from a mass storage in a memory in response to the initial search; performing the initial search on the first shard; providing first top search result scores from the initial search; and removing the first shard from the memory when the initial search is completed.

Abstract: Methods and systems for searching a frozen index are provided. Exemplary methods include: a method may comprise: receiving an initial search and a subsequent search; loading the initial search and the subsequent search into a throttled thread pool, the throttled thread pool including; getting the initial search from the throttled thread pool; storing a first shard from a mass storage in a memory in response to the initial search; performing the initial search on the first shard; providing first top search result scores from the initial search; and removing the first shard from the memory when the initial search is completed.

Abstract: A first aspect provides a heat sink panel for receiving thermal energy from a photovoltaic panel. The heat sink panel comprises a shaped metal sheet, wherein at least part of the metal sheet is shaped into substantially parallel gutters. When attached to the photovoltaic panel, the gutters form channels between the heat sink panel and the photovoltaic panel. The gutters range from a proximal gutter end to a distal gutter end and the distal end and the proximal end comprise openings enabling an air flow through the gutters. Whereas known heat sinks comprise protrusions like parallel oriented fins, they do are not arranged to provide more or less closed channels at the back of the photovoltaic panel to enable a stream of air to flow through the channel. Channels do not have to be fully closed, smaller openings may be provided. An airflow may be provided by a chimney effect.