G06F9/5033

HANDLING EXECUTION OF FUNCTIONS

There is provided a method performed by an entity for handling execution of functions in a function-as-a-service (FaaS) system. The FaaS system includes one or more nodes on which functions are executable. The method includes grouping functions into a group of functions to be executed on a single one of the one or more nodes. The grouping is based on information from the one or more nodes. The information is indicative of which functions access which data during execution of the functions and each function of the group accesses the same data as at least one other function of the group.

Apparatus, system, and method for maintaining a context stack

An apparatus, system, and method are disclosed for maintaining a context stack. A monitor module monitors a stack size after each monitor interval for a stack of a plurality of contexts. Each context defines communications between a process and a data set and comprises a pathway for communicating with the data set and a process identifier. A stack module deallocates a context that satisfies a stack policy from the stack if the stack size is within a buffer threshold of a maximum threshold.

SYSTEM AND METHOD FOR TRIGGERING ONE OR MORE ACTIONS

A computer server system comprises a communications module; a processor coupled with the communications module; and a memory coupled to the processor and storing processor-executable instructions which, when executed by the processor, configure the processor to obtain trigger data identifying two or more resource types and criteria for triggering one or more actions associated with each of the two or more resource types; monitor resource consumption data to identify another resource type being provided to a resource requester; responsive to identifying the another resource type being provided to the resource requester, determine, based on the trigger data, one or more actions to be triggered; and trigger the one or more actions.

OPTIMIZING READ OPERATIONS IN OBJECT SCHEMA-BASED APPLICATION PROGRAMMING INTERFACES (APIS)
20170346875 · 2017-11-30 ·

The present disclosure relates to processing read requests to retrieve data from a plurality of data sources. According to one embodiment, an example method includes determining a navigable path of nodes accessed to satisfy a read request based on a graph projection of an application programming interface (API). An API service generates a plurality of subqueries, each subqueries being associated with a node in the navigable path. While traversing the navigable path to satisfy the read request, the API service identifies data associated with lower level nodes that is cached at a data source associated with a current node, replaces subqueries directed to data stored at the current node and the identified data with a single subquery executed against the data source associated with the current node, and executes the single subquery at the current node. The API service returns data accessed during traversal of the navigable path.

OPTIMIZING WRITE OPERATIONS IN OBJECT SCHEMA-BASED APPLICATION PROGRAMMING INTERFACES (APIS)
20170344605 · 2017-11-30 ·

The present disclosure relates to processing write requests across a plurality of data sources. According to one embodiment, an example method includes determining a navigable path of nodes accessed to satisfy a write request in a graph projection of an application programming interface (API). An API service generates a plurality of subqueries, each subqueries being associated with a node in the navigable path. While traversing the navigable path to execute the write request, the API service identifies one or more nodes in the navigable path sharing an association with a data repository associated with the current node and upon which execution of a write operation associated with the current node depends. The API service coalesces a set of subqueries associated with the current node and the identified one or more nodes into a single subquery and executes the single subquery.

System and method for selectively delaying execution of an operation based on a search for uncompleted predicate operations in processor-associated queues

A system and method of parallelizing programs employs runtime instructions to identify data accessed by program portions and to assign those program portions to particular processors based on potential overlap between the access data. Data dependence between different program portions may be identified and used to look for pending “predicate” program portions that could create data dependencies and to postpone program portions that may be dependent while permitting parallel execution of other program portions.

COORDINATED APPLICATION PROCESSING
20230176922 · 2023-06-08 · ·

Coordinated application processing includes obtaining a plurality of images and distributing them to processing engines to perform image processing. The plurality of images cover an image area, with different sub-areas, in which a biological sample to be sequenced is present. The image processing proceeds across multiple cycles to process a respective set of images, of the plurality of images, of each sub-area of the different sub-areas, and therefore of the respective area, of the flow cell, to which that sub-area correlates. The distributing the plurality of images includes, for each sub-area of the different sub-areas, distributing, across the multiple cycles of the image processing, the images of the respective set of images of that sub-area to a respective processing engine, of a plurality of processing engines, associated with, and selected for, processing images of that sub-area.

Method and system for providing high efficiency, bidirectional messaging for low latency applications

A system and a method for routing a message to an application over a connection oriented session in a Kafka messaging platform environment are provided. The method includes: acquiring a plurality of partitions from the Kafka messaging platform; designating a first partition from among the plurality of partitions as a sticky partition; generating a plurality of routing keys that are configured to route to the sticky partition; receiving a subscription from a service that corresponds to a first application; transmitting, to the first application, a first routing key that identifies the subscription from among the plurality of routing keys; and receiving messages from Kafka services that are routed by the first routing key to the first application. For any particular application or set of applications, a plurality of connection oriented sessions may be used to achieve load balancing and high availability.

CROSS-DOMAIN CABIN COMPUTING SYSTEM AND METHOD BASED ON DATA RESOURCE DISTRIBUTION

A cross-domain cabin computing system and a cross-domain cabin computing method based on data resource distribution are provided, including: a cabin generation and management system obtains a data resource distribution map from a virtual data center system according to a cabin data and resource request, obtains a cross-domain resource directory from a cross-domain resource management system, and calculates a list of resource requirements of cabins; the cross-domain resource management system sends a resource request to a public cloud or a non-cloud resource to which resources belong based on the list of resource requirement of the cabins, and send information signaling that the resource request is successful to the cabin generation and management system to enable the cabin users to establish cabins based on cross-domain resources and data resources corresponding to the data resource distribution map, thereby realizing cabin computing.

Provisioning system and method for a distributed computing environment using a map reduce process

A provisioning system for a distributed computing environment includes a map reduce framework that includes a splitter process, a mapper process, and a reduce process. The splitter process receives a task associated with a distributed application to be deployed on the distributed computing environment, and selects which of the resources are to be provisioned for executing the distributed application. The mapper process converts at least one abstract address included in the task to an absolute address, and executes the task for provisioning the selected resources, while the reduce process consolidates results of the executed task.