G06F9/465

DEPENDENCY INJECTION WITH AUTO-SERIALIZATION IN MULTIPLE WORKER SYSTEM
20230094029 · 2023-03-30 ·

In some embodiments, a system performs a service using a plurality of compute nodes. A second compute node installs a dependency injection container to manage a dependency graph of dependencies for classes in an application. The dependency injection container is determined from a first compute node in the plurality of compute nodes that manages performing the service with the plurality of compute nodes. The second compute node receives information identifying a node in the dependency graph from the first compute node. The information is received to create a first object that has been created on the first compute node. The second compute node uses the information to determine a first class for the node in the dependency graph and a dependency on a second class and creates the first object of the first class with the dependency on a second object of the second class on the second compute node.

Computer-implemented systems and methods for service provisioning

Versions of a service not reachable by a set of service requestors that use the service are removed. Multiple, different versions of a service are stored, along with metadata associated with the multiple, different versions of the service. The metadata is examined to determine one or more of the multiple, different versions of the service that are not reachable by the set of service requestors that use the service. Those versions are deleted.

DYNAMIC MODIFICATION OF ROBOTIC PROCESS AUTOMATION CONTROLS USING BLOCKCHAIN
20230083385 · 2023-03-16 ·

Systems, methods, and apparatus are provided for modification of RPA controls during a workflow without impacting bot performance. A background scan may be initiated in parallel to an RPA application workflow. The scan may identify values for an application control parameter and a corresponding bot control parameter. Hashes of the values may be validated against a key value pair stored as a block in a distributed ledger. If any changes have been made to the application control values, the bot control value will not match the application control value and validation will fail. If validation fails, an override may be generated for the bot value. An updated bot value may be stored in a temporary cache until the workflow is complete. Following completion of the workflow, a new block may be added to the blockchain storing a new key value pair that includes the application control value and the updated bot control value.

Deserialization of stream objects using multiple deserialization algorithms

Techniques for deserializing stream objects are disclosed. The system may receive data representing a stream object. The data can include an object descriptor, a class descriptor, and stream field values corresponding to the stream object. The system may select a particular deserialization process, from among a plurality of deserialization processes. The selection may be based at least in part on the object descriptor and the class descriptor. The system can deserialize the data representing the stream object using the selected deserialization process, yielding one or more deserialized objects.

FACILITATING PER-CPU REFERENCE COUNTING FOR MULTI-CORE SYSTEMS WITH A LONG-LIVED REFERENCE
20230121841 · 2023-04-20 ·

Facilitating per-CPU reference counting for multi-core systems with a long-lived reference is provided herein. A system includes a processor and a memory that stores executable instructions that, when executed by the processor, facilitate performance of operations. The operations include determining a first quantity of releases associated with an object in a data structure of the system and determining a second quantity of acquisitions associated with the object. The first quantity of releases can be distributed among respective first counters of processing elements of a group of processing elements. The second quantity of acquisitions can be distributed among respective second counters of the processing elements of the group of processing elements. Further, the operations can include, based on the second quantity of acquisitions and the first quantity of releases being determined to be a same value, implementing a removal of the object from the data structure.

METHOD AND SYSTEM FOR RECONCILIATION OF A SET OF K8s RESOURCE/OBJECTS
20220326942 · 2022-10-13 ·

A method and system for reconciliation of a set of K8s resource/objects includes a Graph Dependency (GD) API enabling a Developer to define a dependency graph between K8s resource/objects of the set. Interfacing with the API Server in a K8s system, the GD API monitors events on the K8s resource/objects of the set, and upon occurrence of an event on an affected K8s resource/object, triggers reconciliation of the set as determined necessary based on the matching of versioning level of the affected K8s resource/object, with the versioning level of the parent recorded in children of the affected K8s resource/object, from immediate children to leaf children in the dependency graph.

System and method for providing a dynamic invocation and service interface for use in a middleware or other environment

A system and method for providing a dynamic invocation and service interface for use in a middleware or other environment. At the service-side, messages can be inserted into an inbound processing chain. After service-side inbound processing, messages are given to the user via a provider request function. The user gives a response by using a provider response function that inserts messages into a service-side outbound processing chain. After service-side outbound processing, messages are given to the user's service response transport. On the client side, the user can insert messages into the outbound processing chain using a dispatcher request. After client-side outbound processing, messages are given to the user's client request transport. This decouples message processing from the transport and makes the message processing asynchronous in nature. When the response is received, a user uses a client response transport function to insert the response into the client-side inbound processing chain.

Systems and methods for generating a unique fingerprint aggregating set of unique tracking identifiers throughout request/response processing
09852003 · 2017-12-26 · ·

Systems and methods for generating a fingerprint including multiple tracking identifiers. Control circuitry receives a first tracking identifier from a first component of a network. The first tracking identifier is associated with a data request sent to the first component. The control circuitry identifies parameters based on a configuration of the first component. The control circuitry transmits an application programming interface (API) request for information related to the parameters from the first component. The control circuitry receives information related to the parameters for the first component in response to the API request. The control circuitry determines a second tracking identifier based on the first tracking identifier and the information related to the parameters for the first component. The control circuitry transmits the second tracking identifier to the first component. The first tracking identifier and the second tracking identifier are combined to generate a fingerprint in connection with the data request.

Unified Operating System for Distributed Computing
20230195431 · 2023-06-22 · ·

In some embodiments, a real-time event is detected and context is determined based on the real-time event. An application model is fetched based on the context and meta-data associated with the real-time event, the application model referencing a micro-function and including pre-condition and post-condition descriptors. A graph is constructed based on the micro-function. The micro-function is transformed into micro-capabilities by determining a computing resource for execution of a micro-capability by matching pre-conditions and post-conditions of the micro-capability, and enabling execution and configuration of the micro-capability on the computing resource by providing access in a target environment to an API capable of calling the micro-capability to configure and execute the micro-capability. A request is received from the target environment to execute and configure the micro-capability on the computing resource. The micro-capability is executed and configured on the computing resource, and an output of the micro-capability is provided to the target environment.

Maintaining data block maps of clones of storage objects
09830096 · 2017-11-28 · ·

Described herein is a system and method for retaining deduplication of data blocks of a resulting storage object (e.g., a flexible volume) from a split operation of a clone of a base storage object. The clone may comprise data blocks that are shared with at least one data block of the base storage object and at least one data block that is not shared with at least one data block of the base storage object. The data blocks of the clone that are shared with the base storage object may be indicated to receive a write allocation that may comprise assigning a new pointer to an indicated data block. Each data block may comprise a plurality of pointers comprising a virtual address pointer and a physical address pointer. As such, data blocks of the clone comprising the same virtual address pointer may be assigned a single physical address pointer. Thus, a new physical address pointer is assigned or allocated once to a given virtual address pointer of data blocks of a clone.