G06F2209/548

METHOD AND APPARATUS OF DEPLOYING A CLUSTER, AND STORAGE MEDIUM

Provided are a method and an apparatus of deploying a cluster, and a storage medium, which relate to the field of computer technologies and may be applied to the cloud computing technology. The method includes steps described below. Master node configuration information of a cluster master node and slave node configuration information of each cluster slave node are determined. Independent configuration is performed on the cluster master node according to the master node configuration information. The slave node configuration information is sent to each cluster slave node, so that each cluster slave node performs independent configuration on the cluster slave node according to the slave node configuration information.

SUB-QUEUE INSERTION SCHEMES EXECUTABLE BY QUEUE MANAGERS AND RELATED SYSTEMS AND OPERATIONS
20220365815 · 2022-11-17 ·

Introduced here are insertion schemes in which queues can be branched into one or more sub-queues for more effective management of queuing elements. Often, a computing device will have a primary buffer into which queuing elements are populated for execution by a processor. However, the amount of contiguous memory space allocated for the primary buffer may be fixed. To address this, a queue manager may insert indicators that link to secondary buffers into the primary buffer in order to expand the number of effective entries in the primary buffer.

CHAINED RESOURCE LOCKING
20230056500 · 2023-02-23 ·

Devices and techniques for CHAINED RESOURCE LOCKING are described herein. Threads form a last-in-first-out (LIFO) queue on a resource lock to create a chained lock on the resource. A data store representing the lock for the resource holds the previous thread’s identifier, enabling a subsequent thread to wake the previous thread using the identifier when the subsequent thread releases the lock. Generally, the thread releasing the lock need not interact with the data store, reducing contention for the data store among many threads.

Providing a global queue through replication
11500701 · 2022-11-15 · ·

A global queue service of a provider network allows clients to automatically replicate a queue to another queue of one or more other regions (creating a global queue). A local instance of the service receives a send request from a producer. In response, the local instance stores a message in a local queue and replicates the send request to a remote queue of a remote instance of the global queue service (e.g., at another region). The local instance receives a receive request from a consumer and sends the message to the consumer (without replicating the request to the remote queue). The local instance then receives a delete request from a consumer. In response, the local instance deletes the message from the local queue and replicates the delete request to the remote queue. The local instance also receives replicated requests from the remote instance and in response, applies them locally.

CONCURRENCY CONTROL IN AN ASYNCHRONOUS EVENT-LOOP BASED PROGRAM ENVIRONMENT
20230039929 · 2023-02-09 ·

Concurrency control in an asynchronous event-loop based program environment is described. A program is implemented with an asynchronous event-loop. A first piece of code controls events into the program by preventing events from being delivered to the program while a storage operation is executing except for storage completion events. Those events are prevented from being delivered to the program until the storage operation completes and the program is not executing code. A second piece of code controls outgoing messages from the program by preventing outgoing messages from being transmitted when a storage write operation is in progress except for outgoing messages that are storage write operations. Upon the successful completion of the storage write operation, the outgoing messages that were prevented from being transmitted are transmitted.

Computational partition for a multi-threaded, self-scheduling reconfigurable computing fabric
11573834 · 2023-02-07 · ·

Representative apparatus, method, and system embodiments are disclosed for configurable computing. A representative system includes an asynchronous packet network; a plurality of configurable circuits arranged in an array, each configurable circuit coupled to the asynchronous packet network and adapted to perform a plurality of computations; and a dispatch interface circuit adapted to partition the plurality of configurable circuits into one or more separate partitions of configurable circuits and to load one or more computation kernels into each partition of configurable circuits. The dispatch interface circuit may load balance across the partitions of configurable circuits by starting threads for execution in the partition having the highest number of available thread identifiers. The dispatch interface may also assert a partition enable signal to merge the one or more separate partitions and assert a stop signal to all configurable circuits of the one or more separate partitions of configurable circuits.

CLOUD ENVIRONMENT DELIVERY TOOL

Various examples are directed to systems and methods for deploying a cloud environment to a cloud hyperscaler infrastructure. A software tool may receive a description of a cloud environment element to be included in a cloud environment. The software tool may determine that the description of the cloud environment element is consistent with cloud environment security guideline data and add the cloud environment element to cloud environment description data. A security concept document may be generated for the cloud environment. The software tool may generate deployment code comprising executable code describing the cloud environment and submit the deployment code to create the cloud environment at the cloud hyperscaler infrastructure.

DETERMINISTIC REPLAY OF EVENTS BETWEEN SOFTWARE ENTITIES
20230032237 · 2023-02-02 ·

Deterministic replay of events between software entities. In current frameworks, replays of events (e.g., data communications) between software entities are non-deterministic and unreproducible. In an embodiment, as events are replayed, software entities, stimulated by those events, are queued according to a queuing strategy and executed from the queue. In an alternative embodiment, as software entities are executed, the events, output by those software entities, are queued according to a queuing strategy and played from the queue. Both embodiments ensure determinism and reproducibility across replays.

Adaptive Rule Trigger Thresholds For Managing Contact Center Interaction Time

A method includes (a) receiving and storing interaction time data associated with processes of a communication distributor server for an end-user network having an associated contact center with agent instances; (b) determining whether a trigger specified in a first logical directive is initiated; (c) upon determining that the trigger specified in the first logical directive is initiated, determining whether a metric related to the customer communications with the end-user network satisfies the condition in the first logical directive; and (d) upon determining that the metric related to the customer communications with the end-user network satisfies the condition in the first logical directive, providing the operation to at least one of the end-user network or the communication distributor server.

SYSTEM AND METHOD FOR CENTRALIZED CONFIGURATION OF DISTRIBUTED AND HETEROGENEOUS APPLICATIONS

Embodiments of systems and methods for the centralized configuration of distributed heterogeneous services is disclosed herein. Embodiments of such systems and methods may be utilized to configure one or more service instances executing in an enterprise computing environment where each of the set of service instance is one of a set of service types that may be different. These services may, for example, be off-cloud services associated with a cloud based computing platform.