Provisioning using pre-fetched data in serverless computing environments

Patent metadata

Field	Value
Publication number	US-2019166221-A1
Application number	US-201715827969-A
Country	US
Kind code	A1
Filing date	Nov 30, 2017
Priority date	Nov 30, 2017
Publication date	May 30, 2019
Grant date	—

Abstract

A method for data provisioning a serverless computing cluster. A plurality of user defined functions (UDFs) are received for execution on worker nodes of the serverless computing cluster. For a first UDF, one or more data locations of UDF data needed to execute the first UDF are determined. At a master node of the serverless computing cluster, a plurality of worker node tickets are received, each ticket indicating a resource availability of a corresponding worker node. The one or more data locations and the plurality of worker node tickets are analyzed to determine eligible worker nodes capable of executing the first UDF. The master node transmits a pre-fetch command to one or more of the eligible worker nodes, causing the eligible worker nodes to become a provisioned worker node for the first UDF by storing a pre-fetched first UDF data before the first UDF is assigned for execution.

First claim

We claim:

1 . A method for data provisioning, comprising:
receiving, at a serverless computing cluster, a plurality of user defined functions (UDFs) for execution on one or more worker nodes of the serverless computing cluster; determining, via the serverless computing cluster, one or more data locations of a first UDF data needed for the future execution of a first UDF of the plurality of UDFs; receiving, at a master node of the serverless computing cluster, a plurality of worker node tickets, each worker node ticket indicating a resource availability of a corresponding worker node; analyzing, via the master node, the one or more data locations and the plurality of worker node tickets to determine eligible worker nodes capable of executing the first UDF; transmitting, via the master node, a pre-fetch command to one or more of the eligible worker nodes, the pre-fetch command generated from the determined one or more data locations such that the one or more of the eligible worker nodes become provisioned worker nodes, wherein each provisioned worker node stores a pre-fetched UDF data before the first UDF has been assigned for execution; and performing UDF allocation across the provisioned worker nodes.

2 . The method of claim 1 , wherein:
the provisioned worker nodes each store the same pre-fetched UDF data; and UDF allocation comprises selecting one of the provisioned worker nodes to execute the first UDF.

3 . The method of claim 2 , wherein UDF allocation further comprises selecting one or more worker nodes from a remaining portion of the provisioned worker nodes to execute one or more additional UDFs that are each determined to require the first UDF data.

4 . The method of claim 3 , wherein the number of provisioned worker nodes in the remaining portion is equal to the number of the additional UDFs determined to require the first UDF data.

5 . The method of claim 1 , wherein:
in response to a determination that the first UDF can be processed in parallel, multiple pre-fetch commands are transmitted such that the provisioned worker nodes store different pre-fetched UDF data; and UDF allocation comprises selecting two or more of the provisioned worker nodes to execute the first UDF, such that a combination of the different pre-fetched UDF data stored by the selected two or more provisioned worker nodes contains all of the first UDF data.

6 . The method of claim 1 , wherein each worker node ticket is generated by a worker node in response to a resource availability or state change at the worker node, or in response to the expiration of a pre-defined ticket refresh period that resets when the worker node generates a new worker node ticket.

7 . The method of claim 1 , wherein pre-fetch commands are transmitted such that pre-fetched UDF data is stored for multiple UDFs before any of the multiple UDFs have been assigned to a worker node for execution.

8 . The method of claim 1 , wherein pre-fetch commands are transmitted such that each of the one or more worker nodes is provisioned to store pre-fetched UDF data for at least one UDF of the plurality of UDFs.

9 . The method of claim 1 , wherein the one or more data locations comprise Uniform Resource Identifiers (URIs) that point to one or more of: worker nodes of the serverless computing cluster; dedicated storage nodes of the serverless computing cluster, the dedicated storage nodes distinct from the worker nodes; and outside nodes external to the serverless computing cluster.

10 . The method of claim 1 , further comprising:
determining that each of the provisioned worker nodes are no longer eligible worker nodes capable of executing the first UDF, the determining based at least in part on worker node tickets received from the corresponding provisioned worker nodes; and analyzing the remaining worker nodes to identify a new worker node capable of receiving the first UDF data from one or more of the provisioned worker nodes and subsequently executing the first UDF, wherein the new worker node is identified based on its proximity to the provisioned worker nodes such that a transfer time of the first UDF data to the new worker node is minimized.

11 . A computer-readable device having stored therein instructions which, when executed by at least one processor, cause the at least one processor to perform operations comprising:
receiving, at a serverless computing cluster, a plurality of user defined functions (UDFs) for execution on one or more worker nodes of the serverless computing cluster; determining one or more data locations of a first UDF data needed for the future execution of a first UDF of the plurality of UDFs; receiving, at a master node of the serverless computing cluster, a plurality of worker node tickets, each worker node ticket indicating a resource availability of a corresponding worker node; analyzing, via the master node, the one or more data locations and the plurality of worker node tickets to determine eligible worker nodes capable of executing the first UDF; transmitting, via the master node, a pre-fetch command to one or more of the eligible worker nodes, the pre-fetch command generated from the determined one or more data locations such that the one or more of the eligible worker nodes become provisioned worker nodes, wherein each provisioned worker node stores a pre-fetched UDF data before the first UDF has been assigned for execution; and performing UDF allocation across the provisioned worker nodes.

12 . The computer-readable device of claim 11 , wherein:
the provisioned worker nodes each store the same pre-fetched UDF data; and UDF allocation comprises selecting one of the provisioned worker nodes to execute the first UDF.

13 . The computer-readable device of claim 11 , wherein the instructions further cause the at least one processor to perform UDF allocation by selecting one or more worker nodes from a remaining portion of the provisioned worker nodes to execute one or more additional UDFs that are each determined to require the first UDF data.

14 . The computer-readable device of claim 13 , wherein the number of provisioned worker nodes in the remaining portion is equal to the number of the additional UDFs determined to require the first UDF data.

15 . The computer-readable device of claim 11 , wherein:
in response to a determination that the first UDF can be processed in parallel, multiple pre-fetch commands are transmitted such that the provisioned worker nodes store different pre-fetched UDF data; and UDF allocation comprises selecting two or more of the provisioned worker nodes to execute the first UDF, such that a combination of the different pre-fetched UDF data stored by the selected two or more provisioned worker nodes contains all of the first UDF data.

16 . The computer-readable device of claim 11 , wherein each worker node ticket is generated by a worker node in response to a resource availability or state change at the worker node, or in response to the expiration of a pre-defined ticket refresh period that resets when the worker node generates a new worker node ticket.

17 . The computer-readable device of claim 11 , wherein pre-fetch commands are transmitted such that pre-fetched UDF data is stored for multiple UDFs before any of the multiple UDFs have been assigned to a worker node for execution.

18 . The computer-readable device of claim 11 , wherein pre-fetch commands are transmitted such that each of the one or more worker nodes is provisioned to store pre-fetched UDF data for at least one UDF of the plurality o

Assignees

• Cisco Tech Inc

Inventors

• Shimamura Komei
• Saha Amit Kumar
• Dutta Debojyoti

Classifications

• G06F9/5072

  Grid computing · CPC title

• H04L67/10

  in which an application is distributed across nodes in the network (software deployment G06F8/60; multiprogramming arrangements G06F9/46) · CPC title

• G06F9/5077

  Logical partitioning of resources; Management or configuration of virtualized resources (specific details on emulation or internal functioning of virtual machines G06F9/455) · CPC title

• H04L67/2847 Primary

  Electricity · mapped topic

• G06F9/5027 Primary

  the resource being a machine, e.g. CPUs, Servers, Terminals · CPC title