EP4198729A1 - Workload characterization-based capacity planning for cost-effective and high-performance serverless execution environment - Google Patents

Workload characterization-based capacity planning for cost-effective and high-performance serverless execution environment Download PDF

Info

Publication number
EP4198729A1
EP4198729A1 EP22210521.5A EP22210521A EP4198729A1 EP 4198729 A1 EP4198729 A1 EP 4198729A1 EP 22210521 A EP22210521 A EP 22210521A EP 4198729 A1 EP4198729 A1 EP 4198729A1
Authority
EP
European Patent Office
Prior art keywords
apis
serverless
application
execution environment
cores
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
EP22210521.5A
Other languages
German (de)
French (fr)
Inventor
Dheeraj Chahal
Rekha Singhal
Surya Chaitanya Venkata Palepu
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Tata Consultancy Services Ltd
Original Assignee
Tata Consultancy Services Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Tata Consultancy Services Ltd filed Critical Tata Consultancy Services Ltd
Publication of EP4198729A1 publication Critical patent/EP4198729A1/en
Pending legal-status Critical Current

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00Arrangements for program control, e.g. control units
    • G06F9/06Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/46Multiprogramming arrangements
    • G06F9/50Allocation of resources, e.g. of the central processing unit [CPU]
    • G06F9/5005Allocation of resources, e.g. of the central processing unit [CPU] to service a request
    • G06F9/5027Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resource being a machine, e.g. CPUs, Servers, Terminals
    • G06F9/505Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resource being a machine, e.g. CPUs, Servers, Terminals considering the load
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00Arrangements for program control, e.g. control units
    • G06F9/06Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/46Multiprogramming arrangements
    • G06F9/50Allocation of resources, e.g. of the central processing unit [CPU]
    • G06F9/5005Allocation of resources, e.g. of the central processing unit [CPU] to service a request
    • G06F9/5027Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resource being a machine, e.g. CPUs, Servers, Terminals
    • G06F9/5044Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resource being a machine, e.g. CPUs, Servers, Terminals considering hardware capabilities
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00Arrangements for program control, e.g. control units
    • G06F9/06Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/46Multiprogramming arrangements
    • G06F9/54Interprogram communication
    • G06F9/544Buffers; Shared memory; Pipes

Landscapes

  • Engineering & Computer Science (AREA)
  • Software Systems (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Debugging And Monitoring (AREA)

Abstract

Recent techniques for workload characterization of an application to be executed in a serverless execution environment or cloud are based on benchmark-approximation. Multiple microbenchmarks are run against the multiple VM configurations and a score is calculated which is used for mapping futuristic workloads to the appropriate configuration. Embodiments herein disclose method and system for workload characterization-based capacity planning of an actual application running on-premise with different configurations of the same machine and providing a cost-effective and high-performance serverless execution environment. Resource demand of each API in the application workflow is evaluated. Based on the resource demand of each API, a mapping is performed to the serverless platform on cloud. Additionally, characterization of threads within each API is performed and each thread is mapped to a serverless instance based on its resource requirements.

Description

    CROSS-REFERENCE TO RELATED APPLICATIONS AND PRIORITY
  • The present application claims priority to Indian application no. 202121058253, filed on December 14, 2021 .
  • TECHNICAL FIELD
  • The embodiments herein generally relate to serverless execution environment and, more particularly, to a method and system for workload characterization-based capacity planning of an application for cost-effective and high-performance serverless execution environment.
  • BACKGROUND
  • Serverless platform is a cloud computing execution model that provides auto-scaling, high availability, and a pay-for-value cost model. It simplifies the application deployment as the service provider manages resources including Operating Systems (OSs), runtimes, libraries, etc., that allow users to focus on code development. In the past, serverless platforms were used for small application functions requiring limited resources such as compute cores, memory, and stateful storage. However, due to the provisioning of more resources per serverless instance by cloud vendors, serverless platforms are being used for deploying Artificial Intelligence (AI) workloads as well Thus, importance of memory size of serverless instances for cost-effective deployment of the application has been emphasized by researchers in many works. However, most of the cost optimization techniques ignore the memory configuration of the serverless instances. An existing approach that predicts size of serverless instances for application execution, relies on synthetic benchmarks. Such benchmark based prediction does not capture the variations in requirements of actual application to be executed and are not able to predict optimal resource requirements specific to the application.
  • SUMMARY
  • Embodiments of the present disclosure present technological improvements as solutions to one or more of the above-mentioned technical problems recognized by the inventors in conventional systems. For example, in one embodiment, a method for workload characterization-based capacity planning of an application for cost-effective and high-performance serverless execution environment is provided.
  • The method includes receiving an application to be executed in the serverless execution environment. Further, the method includes performing the workload characterization-based capacity planning of the application in a serverful execution environment. The workload characterization comprises steps of: A) Checking whether a storage requirement of the application, to create an execution environment of the application, is more than a maximum temporary storage available on a serverless instance of the serverless execution environment. B) Refactoring the application into a plurality of Application Programming Interfaces (APIs) if the storage requirement is more than the maximum temporary storage. The plurality of APIs are independent of each other and are run on a plurality of serverless instances of the serverless execution environment. A Point to Point (P2P) communication between the newly created APIs is performed using an Elastic File System (EFS) enabling the plurality of APIs to read and write the data from the EFS. C) Checking whether compute requirement of each of the plurality of APIs is within a maximum number of cores provided by the serverless execution environment. D) Running each data unit from among a plurality of data units of a dataset used by the application for each of the plurality of APIs on the serverful execution environment by varying number of cores provided by a server in the serverful environment from a minimum number of cores to the maximum number of cores if the compute requirement is satisfied by the maximum number of cores. Data units in the dataset comprise a mix of identical data units and unidentical data units for similar type of data. E) Determining an average execution time for each data unit of the dataset for each of the plurality of APIs. F) Recording an optimal number of cores for each of the plurality of APIs, beyond which there is no further decrease in the execution time of each of the plurality the APIs. G) Configuring the plurality of serverless instances for executing the application in accordance with the optimal number of cores for each of the plurality of APIs in the serverless computing environment.
  • In another aspect, a system for workload characterization-based capacity planning of an application for cost-effective and high-performance serverless execution environment is provided. The system comprises a memory storing instructions; one or more Input/Output (I/O) interfaces; and one or more hardware processors coupled to the memory via the one or more I/O interfaces, wherein the one or more hardware processors are configured by the instructions to receive an application to be executed in the serverless execution environment. Further, the system is configured to perform the workload characterization-based capacity planning of the application in a serverful execution environment. The workload characterization comprises steps of: A) Checking whether a storage requirement of the application, to create an execution environment of the application, is more than a maximum temporary storage available on a serverless instance of the serverless execution environment. B) Refactoring the application into a plurality of Application Programming Interfaces (APIs) if the storage requirement is more than the maximum temporary storage. The plurality of APIs are independent of each other and are run on a plurality of serverless instances of the serverless execution environment. A Point to Point (P2P) communication between the newly created APIs is performed using an Elastic File System (EFS) enabling the plurality of APIs to read and write the data from the EFS. C) Checking whether compute requirement of each of the plurality of APIs is within a maximum number of cores provided by the serverless execution environment. D) Running each data unit from among a plurality of data units in a dataset used by the application for each of the plurality of APIs on the serverful execution environment by varying number of cores provided by a server in the serverful environment from a minimum number of cores to the maximum number of cores if the compute requirement is satisfied by the maximum number of cores. Data units in the dataset comprise a mix of identical data units and unidentical data units for similar type of data. E) Determining an average execution time for each data unit of the dataset for each of the plurality of APIs. F) Recording an optimal number of cores for each of the plurality of APIs, beyond which there is no further decrease in the execution time of each of the plurality the APIs. G) Configuring the plurality of serverless instances for executing the application in accordance with the optimal number of cores for each of the plurality of APIs in the serverless computing environment.
  • In yet another aspect, there are provided one or more non-transitory machine-readable information storage mediums comprising one or more instructions, which when executed by one or more hardware processors causes a method for workload characterization-based capacity planning of an application for cost-effective and high-performance serverless execution environment. The method includes receiving an application to be executed in the serverless execution environment. Further, the method includes performing the workload characterization-based capacity planning of the application in a serverful execution environment. The workload characterization comprises steps of: A) Checking whether a storage requirement of the application, to create an execution environment of the application, is more than a maximum temporary storage available on a serverless instance of the serverless execution environment. B) Refactoring the application into a plurality of Application Programming Interfaces (APIs) if the storage requirement is more than the maximum temporary storage. The plurality of APIs are independent of each other and are run on a plurality of serverless instances of the serverless execution environment. A Point to Point (P2P) communication between the newly created APIs is performed using an Elastic File System (EFS) enabling the plurality of APIs to read and write the data from the EFS. C) Checking whether compute requirement of each of the plurality of APIs is within a maximum number of cores provided by the serverless execution environment. D) Running each data unit from among a plurality of data units in a dataset used by the application for each of the plurality of APIs on the serverful execution environment by varying number of cores provided by a server in the serverful environment from a minimum number of cores to the maximum number of cores if the compute requirement is satisfied by the maximum number of cores. Data units in the dataset comprise a mix of identical data units and unidentical data units for similar type of data. E) Determining an average execution time for each data unit of the dataset for each of the plurality of APIs. F) Recording an optimal number of cores for each of the plurality of APIs, beyond which there is no further decrease in the execution time of each of the plurality the APIs. G) Configuring the plurality of serverless instances for executing the application in accordance with the optimal number of cores for each of the plurality of APIs in the serverless computing environment.
  • It is to be understood that both the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the invention, as claimed.
  • BRIEF DESCRIPTION OF THE DRAWINGS
  • The accompanying drawings, which are incorporated in and constitute a part of this disclosure, illustrate exemplary embodiments and, together with the description, serve to explain the disclosed principles:
    • FIG. 1 is a functional block diagram of a system for workload characterization-based capacity planning of an application for cost-effective and high-performance serverless execution environment, in accordance with some embodiments of the present disclosure.
    • FIGS. 2A and 2B (collectively referred as FIG. 2) is a flow diagram illustrating a method for workload characterization-based capacity planning of the application for cost-effective and high-performance serverless execution environment, using the system of FIG. 1, in accordance with some embodiments of the present disclosure.
    • FIGS. 3A through 3G (collectively referred as FIG. 3) depicts workload characterization based capacity planning performed by the system of FIG. 1 for an example document reader application for execution in a serverless execution environment, in accordance with some embodiments of the present disclosure.
    • FIGS. 4A through 4F (collectively referred as FIG. 4) depict performance analysis of the document reader application, in accordance with some embodiments of the present disclosure.
    • FIGS. 5A through 5D (collectively referred as FIG. 5) depict comparative analysis of the document reader application, while using various storage options provided by the example serverless execution environment utilized by the system of FIG. 1, in accordance with some embodiments of the present disclosure.
  • It should be appreciated by those skilled in the art that any block diagrams herein represent conceptual views of illustrative systems and devices embodying the principles of the present subject matter. Similarly, it will be appreciated that any flow charts, flow diagrams, and the like represent various processes which may be substantially represented in computer readable medium and so executed by a computer or processor, whether or not such computer or processor is explicitly shown.
  • DETAILED DESCRIPTION OF EMBODIMENTS
  • Exemplary embodiments are described with reference to the accompanying drawings. In the figures, the left-most digit(s) of a reference number identifies the figure in which the reference number first appears. Wherever convenient, the same reference numbers are used throughout the drawings to refer to the same or like parts. While examples and features of disclosed principles are described herein, modifications, adaptations, and other implementations are possible without departing from the scope of the disclosed embodiments.
  • Workload characterization is a well-known technique for capacity planning. The traditional characterization approach is based on finding the resource utilization of the whole application for a given workload. Application is then deployed on a computer system based on its peak resource requirement. Although serverless architecture provides high scalability, it has some inherent constraints such as limited computing (please verify) capacity, statelessness, and inability of instances to communicate with each other. Hence traditional characterization approach is not suitable for capacity planning in serverless instances. Recent techniques for workload characterization of an application to be executed in a serverless execution environment or cloud, are based on benchmark-approximation. Multiple microbenchmarks are running against the multiple Virtual Machine (VM) configurations and a score is calculated which is used for mapping futuristic workloads to the appropriate configuration. Such benchmark based prediction does not capture the variations in requirements of actual application to be executed and are not able to predict optimal resource requirements specific to the application or the workload.
  • Embodiments herein disclose method and system for workload characterization-based capacity planning of an application for cost-effective and high-performance serverless execution environment when serverless architecture is offered as function as a Service (FaaS). In FaaS, the applications run only in response to events or requests. The method first evaluates resource demand of each Application Programming Interface (API) in the application workflow using a serverful execution environment, such as an on-premises server. Thereafter, based on the resource demand of each API, a mapping is performed to the serverless execution platform on the cloud. Additionally, workload characterization of threads within each API is performed and each thread is mapped to a serverless instance based on its resource requirements.
  • Thus, rather than approximation approach, the method disclosed herein performs actual workload characterization of the application to be executed, by determining real time requirements of the application and accordingly planning serverless execution for the application. This enables mapping of more optimal application resource requirements to the serverless platform, providing a cost effective and high performance execution of applications in the FaaS serverless architecture. The workload characterization disclosed herein is suitable for deploying deep learning workflows on serverless execution environments, interchangeably referred as serverless architecture or serverless platforms.
  • The method also provides a cost model that generates recommendations, based on cost and performance trade-offs, for selecting an deployment architecture of the serverless execution environment.
  • Referring now to the drawings, and more particularly to FIGS. 1 through 5D, where similar reference characters denote corresponding features consistently throughout the figures, there are shown preferred embodiments and these embodiments are described in the context of the following exemplary system and/or method.
  • FIG. 1 is a functional block diagram of a system 100 for workload characterization-based capacity planning of an application for cost-effective and high-performance serverless execution environment, in accordance with some embodiments of the present disclosure.
  • In an embodiment, the system 100 includes a processor(s) 104, communication interface device(s), alternatively referred as input/output (I/O) interface(s) 106, and one or more data storage devices or a memory 102 operatively coupled to the processor(s) 104. The system 100 with one or more hardware processors is configured to execute functions of one or more functional blocks of the system 100.
  • Referring to the components of system 100, in an embodiment, the processor(s) 104, can be one or more hardware processors 104. In an embodiment, the one or more hardware processors 104 can be implemented as one or more microprocessors, microcomputers, microcontrollers, digital signal processors, central processing units, state machines, logic circuitries, and/or any devices that manipulate signals based on operational instructions. Among other capabilities, the one or more hardware processors 104 are configured to fetch and execute computer-readable instructions stored in the memory 102. In an embodiment, the system 100 can be implemented in a variety of computing systems including laptop computers, notebooks, hand-held devices such as mobile phones, workstations, mainframe computers, servers, and the like.
  • The I/O interface(s) 106 can include a variety of software and hardware interfaces, for example, a web interface, a graphical user interface to display the generated target images and the like and can facilitate multiple communications within a wide variety of networks N/W and protocol types, including wired networks, for example, LAN, cable, etc., and wireless networks, such as WLAN, cellular and the like. In an embodiment, the I/O interface (s) 106 can include one or more ports for connecting to a number of external devices or to another server or devices.
  • The memory 102 may include any computer-readable medium known in the art including, for example, volatile memory, such as static random access memory (SRAM) and dynamic random access memory (DRAM), and/or non-volatile memory, such as read only memory (ROM), erasable programmable ROM, flash memories, hard disks, optical disks, and magnetic tapes.
  • Further, the memory 102 includes modules such as a workload characterization module (not shown) for workload characterization-based capacity planning of the application for cost-effective and high-performance serverless execution environment. Further, the includes an application deployment cost computation module (not shown) that estimates Further, the memory 102 may comprise information pertaining to input(s)/output(s) of each step performed by the processor(s) 104 of the system 100 and methods of the present disclosure. Further, the memory 102 includes a database 108. In an embodiment, the database 108 may be external (not shown) to the system 100 and coupled to the system via the I/O interface 106. Functions of the components of the system 100 are explained in conjunction with flow diagram of FIG. 2 and workload characterization of an example 'document reader' application of FIG. 3.
  • FIGS. 2A and 2B (collectively referred as FIG. 2) is a flow diagram illustrating a method 200 for workload characterization-based capacity planning of the application for cost-effective and high-performance serverless execution environment, using the system of FIG. 1, in accordance with some embodiments of the present disclosure.
  • In an embodiment, the system 100 comprises one or more data storage devices or the memory 102 operatively coupled to the processor(s) 104 and is configured to store instructions for execution of steps of the method 200 by the processor(s) or one or more hardware processors 104. The steps of the method 200 of the present disclosure will now be explained with reference to the components or blocks of the system 100 as depicted in FIG. 1 and the steps of flow diagram as depicted in FIG. 2. Although process steps, method steps, techniques or the like may be described in a sequential order, such processes, methods, and techniques may be configured to work in alternate orders. In other words, any sequence or order of steps that may be described does not necessarily indicate a requirement that the steps to be performed in that order. The steps of processes described herein may be performed in any order practical. Further, some steps may be performed simultaneously.
  • The method is better explained in conjunction with FIGS. 3A through 3G (collectively referred as FIG. 3), which depicts workload characterization based capacity planning performed by the system of FIG. 1 for the example document reader application for execution in an example serverless execution environment, in accordance with some embodiments of the present disclosure.
  • Referring to the steps of the method 200, at step 202 of the method 200, the one or more hardware processors 104 receive an application to be executed in the serverless execution environment. At step 204 of the method 200, the workload characterization module (not shown) executed by the one or more hardware processors 104 performs the workload characterization-based capacity planning of the application using the serverful execution environment. The steps of workload characterization-based capacity planning are listed below:
    1. a) Check whether a storage requirement of the application, to create an execution environment of the application, is more than a maximum temporary storage available on a serverless instance of the serverless execution environment. Taking into consideration the maximum resources provided by a target environment (serverless platform) where the application is to be actually executed is important reference during workload characterization of the application for a specific serverless architecture that is to be used (204a).
    2. b) Refactor the application into a plurality of functions and a plurality of Application Programming Interfaces (APIs) if the storage requirement is more than the maximum temporary storage, such that the plurality of APIs are independent of each other and can be run on a plurality of serverless instances of the serverless execution environment. A Point to Point (P2P) communication between the newly created APIs is performed using an Elastic File System (EFS) enabling the plurality of APIs to read and write the data from the EFS (204b).
    3. c) Check whether compute requirement of each of the plurality of APIs is within a maximum number of cores provided by the serverless execution environment. (204c) Further when the compute requirement of one or more APIs among the plurality of API is not satisfied by the maximum number of cores, then the method 200, at step 204calso performs one of the following action:
      1. 1. Refactoring the one or more APIs into multiple APIs till the compute requirement is reduced below the maximum number of cores.
      2. 2. Launching each thread on a unique serverless instance, if one or more APIs have a multi-threaded component.
    4. d) Run each data unit from among a plurality of data units of a dataset used by the application for each of the plurality of APIs on a server in the serverful execution environment by varying number of cores provided by the server from a minimum number of cores to the maximum number of cores if the compute requirement is satisfied by the maximum number of cores. The data units in the dataset comprise a mix of identical data units and unidentical data units for similar type of data (204d). For example, the dataset may comprise images of different sizes. For example, each image among the set of input data images which can be of varying sizes are used and APIs are executed.
    5. e) Determine an average execution time for each data unit of the dataset for each of the plurality of APIs (204e).
    6. f) Record an optimal number of cores for each of the plurality of APIs, beyond which there is no further decrease in the execution time of each of the plurality the APIs (204f).
    7. g) Configure the plurality of serverless instances for executing the application in accordance with the optimal number of cores for each of the plurality of APIs in the serverless computing environment (204g).
  • FIG 3A depicts an overall architecture and process overview of the workload characterization of the document reader also referred to as Deep Reader application. The Deep Reader herein is an illustrative example and the method 200 can be extended to any other application consisting of multiple APIs. The Deep Reader is a deep learning application for information extraction from document images. It consists of multiple state-of-the-art computer vision algorithms and deep learning models. Deep Reader consist of four major APIs as depicted in FIG. 3B, FIG. 3C, FIG. 3D and FIG. 3E, also depicting logical flow of the Deep Reader application from FIG. 3B through 3E. The four APIs are identified by the system 100, as in step 204b.
    1. 1. Optical Character Recognition (OCR) API: The OCR API is the most frequently used API. It is used to extract words, sentences, and text blocks from the document along with their coordinates. The major components of OCR are the Connectionist Text Proposal Network (CTPN) model and Tesseract for detection and recognition of the text in the document, respectively.
    2. 2. Data Type API: To detect the semantic data types of detected entities
    3. 3. Spatial Relation Creator API: To identify the relationship existing amongst the objects present in the document.
    4. 4. Table Detection API: This API identifies the tables in the document and retrieves the data to save in a comma-separated values (CSV) format.
  • The set of APIs used in the processing of a document depends upon contents of the document. The OCR API is the most frequently used API and is used in the processing of most documents. Hence, it is a part of most of the workflows. It is also computation intensive and consumes a large amount of the total processing time of a document. For a given document, the service demand of each of these APIs is unique. FIGS. 3C, 3D and 3E depict a illustrative sample document sliced and processed by the Deep Reader application for information extraction. The number of slices created is based on the performance gain achieved such that the parallelization overhead due to multiple slice creation should be less than the execution time gain by executing these slices in parallel. The processing time of a document using all four APIs in a workflow is in the proportion shown in FIG. 3G. To accelerate the execution of the OCR API, the input document is sliced into nine parts. Each slice is processed for text detection by the CTPN model in parallel. The CTPN model then returns the coordinates of the bounding boxes containing the text. It also identifies the overlapping boxes and combines them. Only the unique polygon batch is generated as an output. The output generated from the CTPN models is later consumed by the Tesseract engine for text recognition. Finally, text blocks and sentences mapped to their coordinates is the output of OCR API.
  • As mentioned, at step 204 the workload characterization is performed on the Deep Reader application and is explained in conjunction with the illustrative sample document, which is processed as a set of multiple slices of the document image and the text information is extracted, as depicted in FIG. 3F, for creating the plurality of serverless instances that are cost-effective and provide high scalability. However, some inherent constraints require refactoring the application (Deep Reader) and associated frameworks as performed by the method disclosed herein and explained in conjunction with steps 204a through 204c.
  • In one example implementation for experiments and performance analysis of the method 200 disclosed herein, the system 100 utilizes a AWS Lambda serverless platform for execution of the plurality of serverless instances of the Deep Reader application. Serverless functions are stateless by nature. Very small temporary storage is available with each instance of serverless. For example, AWS Lambda allocates only 500MB of temporary storage with each instance during runtime and only 250MB of storage for deployment packages. The Deep Reader utilizes a TensorFlow framework, which is approximately 220MB in size. The framework and libraries of the Deep Reader are trimmed to accommodate them with the function code. For example, the Tensorboard and packages from the TensorFlow are removed to reduce its size to 112MB. Additionally, any library or model shared across APIs or multiple functions such as OpenCV and Tesseract is loaded in the AWS Lambda layer7 for sharing. The AWS Lambda layer allows code or data sharing as a.zip archive. It is also used to save libraries, configuration files, and a custom runtime. Another challenge in serverless architecture is cold start latency. For each new request, there is a cold start latency due to time spent in creating an execution environment for the function. The cold start latency is non-deterministic and difficult to predict. The system 100 disclosed herein addresses this issue by using provisioned concurrency available in the AWS Lambda. Provisioned concurrency results in a deterministic cold start; however, at an additional cost in comparison to the non-provisioned resources.
  • AWS Storage Services: AWS Lambda provides various cloud services for storing data. In the system implementation herein Simple Storage Service(S38) and Elastic File System (EFS9) are used. S3 is an object storage service for storing and retrieving data from anywhere. S3 provides high scalability, data availability, security, and performance. EFS is a serverless elastic file system. It allows sharing of data without the need of provisioning or managing storage, as mentioned in step 204b. Infrequently accessed files in are stored in S3 storage, whereas frequently accessed files are stored in EFS. Various models and images are stored on S3 as they are loaded into the memory of AWS Lambda instances once per invocation. However, all intermediary files that are generated and used during data pre-processing, post-processing, as well as shared by multiple APIs, are stored in EFS.
  • Referring to the architectural and process overview of the Deep Reader application depicted in FIG. 3A, it can be seen that the Deep Reader application, interchangeably referred herein after as Deep Reader, is deployed with six different serverless functions. Two for the OCR API, one for the Data Type API, one for Spatial Relation Creator API, and two for the Table Detection API. When an image document is uploaded by the user on S3 storage, an event is triggered to invoke the Deep Reader orchestration function which initiates the workflow. This also results in instantiating the Lambda instance for the OCR API function. The OCR API function splits the input image into 9 overlapping slices. Each slice is then processed for text detection. TensorFlow CTPN model is used for text detection in each of the slices. Text detection across slices is done in parallel for better execution times. Hence, 9 Lambda instances of the CTPN function are invoked synchronously by the OCR Lambda function as shown in FIG. 3A. This way each slice gets dedicated resources (cores and memory) to expedite text detection. The optimal configuration of each CTPN Lambda instance is decided using the workload characterization data as discussed in the following section. The CTPN function returns coordinates of the detected bounding boxes. These intermediate results generated by the CTPN function are then stored in the EFS mounted on the Lambda instance. On completion of the processing of the image slice by the CTPN function, the OCR function loads the results from EFS and sends them to the Tesseract engine for text recognition. Further in the sequence, Data Type API is invoked. It takes the results of the OCR API as an input and assigns data types to the detected entities. Likewise, when Spatial Relation Creator API is invoked in the workflow sequence, it takes the output of the OCR API as its input and establishes a positional relationship between entities of the document. The table detection API is used for processing image documents containing tables. Input to this API is the output of the OCR API. The rotation correction algorithm is executed first to stabilize the orientation of the image. The image is then sent to a custom-trained model which uses VGG16 as a base model for table detection. The results of the model are finally processed and saved as a CSV file consisting of table data as rows and columns.
  • COST MODEL AND WORKLOAD CHARACTERIZATION: There are a few challenges while calculating the total cost of application deployment in a production environment. Cloud providers often share the pricing model for each of the independent services that they offer. For some of the cloud services, the cost is calculated on a per hour basis and it is independent of the workload. For end-to-end deployment of a complex application that uses multiple services, the total cost due to each of these services depends on the distribution of the workload, scaling in each service, service features used, etc. Thus, explained is the cost model for cloud services followed by a workload characterization scheme when the application is processed by the system 100. The method 200 provides the cost model for evaluating a total cost of end-to-end deployment of the application, that utilizes a plurality of services of the serverless computation environment. The total cost is evaluated for a plurality of scenarios of usage of the plurality of services based on variations in computational requirements, storage requirements, and network requirements. The cost model generates recommendations, based on cost and performance trade-offs, for selecting a deployment architecture of the serverless execution environment.
  • Cost Model (Serverless architecture): The method 200 further comprises computing total cost of deployment of the application on the serverless execution environment that uses a plurality of cloud services, wherein the computation is based a plurality of components comprising a compute component CCompute, a storage component (CStorage), and a networking component (CNetwork). The total cost is modeled by the following equations. Total compute cost is the sum of the compute cost of individual Lambda functions, and is given by the equation as below: C compute = C c 1 + C c 2 + + C cn
    Figure imgb0001
  • Where Cci is the compute cost of ith function. The execution cost of an AWS lambda function is proportional to the number of function invocation requests (ni), memory (mi) configured (Table I) and the amount of time the function executes (eti). [001]
  • The compute cost for non-provisioned functions is calculated as: C cnpi = n i × m i × et i × C lamda
    Figure imgb0002
  • Where, Clamda is cost per GBsec. The total cost of number of requests is: C ri = n i × C request
    Figure imgb0003
    TABLE I:
    Memory (MB) Price per 1ms
    128 $0.0000000021
    512 $0.0000000083
    1024 $0.0000000167
    2048 $0.0000000333
    4096 $0.0000000667
    8192 $0.0000001333
    10240 $0.0000001667
  • Where, Crequest is static cost per request. The total non-provisioned concurrency cost is the sum of compute cost (2) and request cost (3) as below: C cnpti = C cnpi × C ri
    Figure imgb0004
  • The execution cost of a provisioned instance is: C cpei = n i × m i × et i × C provisoned
    Figure imgb0005
  • Where, Cprovisoned is cost per GBsec for provisioned concurrency. Provisioned instances offer better and consistent cold start times and hence priced more. Besides memory, execution time, and requests, provisioned instances have an extra static price for number of instances provisioned and the total duration for which concurrency is provisioned for a function. The total static cost is calculated as: C cpsi = n pi × m i × d p × C staticprovisoned
    Figure imgb0006
  • Where npi is the concurrency provisioned, dp and Cstaticprovisoned represent the duration for which concurrency is provisioned and the static price per min for provisioned instance respectively. Using equations 3, 5, and 6, the total provisioned concurrency cost is C cpti = C cpei + C cpsi + C ri
    Figure imgb0007
  • Hence the total compute cost for the ith Lambda function is given by equation 7 in case of provisioned concurrency, and equation 4 for non-provisioned as below. C cpti = { C cpti Provisioned currency C cnpti Non Provisioned currency
    Figure imgb0008
  • Cost for storage depends on two main storage services namely S3 and EFS. The S3 storage cost is calculated as the amount of data stored in GB/month and the number of reads and write requests. C S 3 = N × C S 3 perGB + n read × C S 3 read + n write × C S 3 write
    Figure imgb0009
  • Where N is the amount of data stored in GB. Other symbols are as defined in Table II. The EFS storage cost is calculated by the amount of data stored in GB per month as below on equation 10 and the total storage cost is the aggregate of S3 and EFS cost as given in equation 11, which is the sum of equation 9 and 10. C EFS = N × C EFSperGB
    Figure imgb0010
    C storage = C S 3 + C EFS
    Figure imgb0011
    TABLE II:
    C S3perGB S3 price per GB
    CEFSperGB EFS cost per GB
    C S3Write Cost for S3 PUT, COPY, POST, LIST requests
    C S3Read Cost for S3 GET, SELECT requests
    nWrite Number of 'reads' to S3
    nRead Number of 'writes' to S3
    CS3 Total S3 storage cost
    CEFS Total EFS storage cost
  • For the networking of the deployed Deep Reader application with other cloud services, a Virtual Private Cloud (VPC) is set up. AWS Lambda functions within the VPC by default do not have internet access. This access is required to use public APIs available on the internet. To activate this access, a Network Address Translation (NAT) Gateway is set up with an appropriate routing table along with an Elastic IP. The cost of elastic IP is 0.01$ per hour. However, if it is tagged to a VPC, there is no cost. Hence, only cost is NAT Gateway hourly charge CNATperHr. So total networking cost is derived as: C Network = Duration × C NATperHr
    Figure imgb0012
  • Where Duration is the amount of time for which NAT, Gateway is configured. The total cost comprising all the compute, storage, and network components is given by the equation 13 below. C Total = C Compute + C storage + C Network
    Figure imgb0013
  • Equation 13 is executed by the application deployment cost computation module (not shown) of system of FIG. 1, to provide total cost of deploying a complex application on cloud that uses multiple cloud services.
  • Workload characterization of the Deep Reader: To find the optimal configuration of the serverless instances, the workload characterization of the Deep Reader application is first carried out in a serverful environment. The cost of using serverless instances is proportional to the amount of memory configured and the execution time of the workload. The total cost of using serverless instances is calculated as given in equation 4. The static overhead cost charge imposed by cloud vendors is insignificant in comparison to the consumed GBsec cost. As an example, cost of executing a function for 10s using 1024MB is: 10 s × 1GB × $ 0 .00001667 × $ 0 .0000002
    Figure imgb0014
  • Where USD 0.0000002 is static overhead. The maximum memory available with each serverless instance is 10GB which also results in the allocation of a maximum of 6 cores for that instance. The over-provisioning of the memory for each instance results in a cost escalation, however, under provisioning results in lesser compute power and hence performance degradation. In our implementation, we instantiate multiple serverless instances in parallel to reduce the total processing time of the image. The total number of serverless instances used for processing an image is as shown in Table IV. Configuring each instance optimally results in cost savings without affecting the performance.
  • The workloads of varying sizes are executed in the serverful environment (for example, an on-premises server) in a controlled environment to calculate the resource demand of each API and the model used in the application. The workload with a varying configuration of the on-premises server, also referred to as server, is processed and record the execution time of each of the API. Based on the resource demand, a performance model is built to predict the execution time for different configurations of serverless instances. An optimal configuration of the serverless instance results in significant cost savings without compromising the performance of the application. A scheme is disclosed to estimate the optimal configuration of the serverless instance memory configuration and hence the number of cores. The extraction application consists of multiple APIs invoking multiple deep learning models. To expedite the execution of documents, these APIs are multi-threaded such that some of the functions can be executed in parallel. For example, OCR API slices document images into nine parts for processing by an equivalent number of CTPN models as shown in FIG. 3A. Each of these functions is characterized in isolation to estimate the effect of memory and hence compute power on the execution time of the workload. FIGS. 4A and 4B depict performance analysis of two document reader APIs on an example serverful execution environment. FIG. 4C depicts the comparison of the document image processing time observed with on-premises server deployment (serverful execution environment) of the information extraction application with varying server configurations (12, 24, 48 cores) versus serverless deployment. FIG. 4D depicts the cost comparison of serverless instance and a virtual machine. FIG. 4E depicts comparison of the document image processing time using provisioned and non-provisioned resources requiring 14 serverless instances. FIG. 4F depicts cost comparison of provisioned and non-provisioned resources for processing one image requiring 14 serverless instances.
  • The execution time of executing one slice with changing the number of cores on a machine is as shown in FIG. 4A, wherein an improvement of 1.7x can be seen in the execution time when the number of cores is increased from 1 to 2. However, there is an insignificant improvement in the execution time beyond that. The characterization of the table API is shown in FIG. 4B. There is not seen any significant improvement in the execution time beyond 3 cores. Based on this observation, while deploying the OCR API on serverless instances, system 100 utilizes one serverless instance to process one slice of the image. Each of the nine instances is configured with only 4GB (more than 2 cores) instead of the available 10GB of memory. Also, only 4GB memory is used for the table API implementation to acquire 3 cores.
  • The experimental evaluation of performance and cost with serverless instances for some of the configurations is as shown in Table III. Configuration 1 results in a very high cost while configuration 3 has the largest execution time at the lowest cost. Configuration 2 results in a good performance and cost trade-off. The optimal configuration closely matches with the configurations suggested by our characterization approach described above. The characterization data is used to configure all the serverless instances optimally. This results in significant cost savings when all the APIs are deployed on serverless instances that are configured optimally. TABLE III:
    Configuration Memory (GB) Total processing time(s) Cost per 100 pages (USD)
    OCR DataType Spatial relation Table Detect
    1 10 1 1 10 83 68.1
    2 3 1 1 4 95 24.47
    3 3 1 1 3 102 23.67
    TABLE IV:
    API type
    OCR DataType Spatial relation Table Detect
    Memory used (GB) 4 2 2 4
    Number of instances 10 1 1 2
  • The workload characterization of any application of interest is automated by the system 100. Thus, for a given inference request, the system 100 evaluates the execution time of each API of the application for processing an image (for example, the Deep reader application herein). The execution time is evaluated by varying the resources such as number of cores or memory size. The system 100 is configured to find optimal resource requirements for each API such that resource configuration below this results in performance degradation while higher configuration does not provide any further performance gain.
  • EXPERIMENTAL SETUP: The on-premises version of the Deep Reader is deployed on an Intel Xeon 1359v2@2.45GHz machine with 24 physical cores configured with 256 GB of memory. All the AWS cloud services used in the experiments are deployed in the ap-south-1 region. The configuration of Lambda instances used in the experiments is based on the workload characterization performed for the Deep Reader. Storage services S3 and EFS, Lambda instances, and VMs are placed in one VPC. The document images chosen for the experiments consist of different categories including invoices, receipts, and bank statements, etc. Each experiment has been repeated a minimum of three times and average values of the metrics are considered. The cost data presented in the experiments include the workload-dependent pricing for using a service. It does not include static charges that are independent of the workload.
  • EXPERIMENTAL RESULTS: In this section, the experiments conducted to evaluate the cost and performance trade-offs using the Deep Reader application as a use case are discussed.
  • Expt1- On-premises vs Lambda Deployment: In this experiment, the scaling in Lambda against on-premises (bare metal) deployment is compared. As shown in FIG. 4C, as the workload is increases by increasing the number of documents to process concurrently, the execution time increases linearly for smaller concurrencies and then super linearly for larger concurrencies. This is due to the fact that servers are underutilized. However, the execution time with Lambda instances does not change with the increasing workload. This is because as workload increases, due to auto-scaling, a proportional number of Lambda instances are increased instantaneously resulting in constant execution time. The problem of increasing execution time for on-premises deployment at larger workloads can be solved by increasing the number of servers which requires investment upfront and may not be cost-efficient when resources are idle. Another solution adopted by enterprises is the use of flexible infrastructure available on cloud. Cloud services provide resource scale-up and scale-down features for dynamically varying workloads. However, one drawback here is that the start-up time of the new VM instances on scale-up is higher in comparison to the cold start of a few seconds in serverless instances. Hence, a serverless platform is a better solution for dynamically varying workloads.
  • Expt2- Serverless vs EC2 Cost Comparison: Both AWS Lambda and EC2 (Elastic Compute Cloud) use the pay-per-use cost mode. In the case of the EC2 VM instance, the cost is dependent on the time for which the instance is up and running. In this study, the cost of Lambda and EC2 instances is compared for varying workloads. An m5ad. 12xlarge type EC2 VM instance with 48 cores is used and 192GB memory at the price of USD 1:61= hour(hr.) for the cost comparison. Each Lambda instance is configured with 3GB of Memory such that the total number of cores from all the instances is same as in the EC2 VM instance. As shown in FIG. 4D, for smaller workloads, the cost of using Lambda is insignificant due to 400,000 free tiers GBs available for low or medium-size workloads. However, as the workload increases (the number of document images in the Deep Reader application mentioned herein), the use of EC2 becomes cost-effective. One conclusion can be derived from this study that AWS Lambda is cost-effective for low to moderate traffic (close to 400000GB-s load) while a dedicated EC2 instance can deliver the same performance at a lower cost for heavy workloads. Although serverless is not cost-effective at heavy workloads, it is still an attractive option due to its high scalability. Moreover, serverless is a platform of choice when dealing with dynamically varying workloads due to quick provisioning.
  • Expt3-Provisioned vs Non-provisioned Concurrency: In this study, the effect of AWS provisioned and non-provisioned concurrency on document image processing time and cost is understood. AWS has recently introduced provisioned concurrency features in Lambda to mitigate the cold start issue. In this experiment, a total of 14 Lambda instances for OCR (10), Data type API (1), Spatial Relationship Creator (1), Table Detection API (2) are provisioned. A single image is processed multiple times with minimum of 10 minutes gap to get a cold start for each run. As shown in FIG. 4E, the total average execution time observed for processing an image with provisioned concurrency is smaller than the non-provisioned concurrency. Also, the variation in execution time across multiple runs is smaller for provisioned concurrency as compared to non-provisioned concurrency. However, the expected cost of using provisioned is higher than non-provisioned concurrency as in FIG. 4F. In this experiment, the effect of S3 and EFS on performance and cost is studied. As discussed in section, AWS provides S3 and EFS as a storage option for the deep learning models, images, and intermediary files used in our deployment. The application models are accessed once per invocation of the serverless function. All the intermediary small files are frequently generated and used by multiple functions.
  • FIGS. 5A through 5D depict comparative analysis of the document reader application, while using various storage options provided by the example serverless execution environment utilized by the system of FIG. 1, in accordance with some embodiments of the present disclosure. FIG. 5A shows the model read latency comparison of S3 and EFS. Although the read latency of S3 is higher as compared to EFS, the cost of S3 is much lower as compared to EFS as depicted in FIG. 5D. Large models and document images that are accessed only once during serverless function invocation are kept in S3 as it proves to be a cost-effective solution for the persistent storage of a large number of document images and large size models (180MB or more). However, frequently accessed small intermediary files and bounding box images (nearly 110 small images for one document image) are saved in EFS due to the better read and write latency as shown in FIGS. 5B and 5C. From the experimental evaluation presented above, following points can be inferred:
    1. 1. Use of serverless platform for deploying applications similar to information extraction results in constant execution time even with increasing workload due to scalability and quick provisioning of serverless functions.
    2. 2. EFS storage is a better option for achieving low latency read and write in frequently accessed small files while S3 is cost-effective and recommended for infrequently accessed models and images.
    3. 3. Provisioned concurrency mitigates the problem of a cold start to some extent but at a higher cost.
    4. 4. The workload characterization results in a cost-effective deployment of complex applications containing multiple APIs and models.
  • The written description describes the subject matter herein to enable any person skilled in the art to make and use the embodiments. The scope of the subject matter embodiments is defined by the claims and may include other modifications that occur to those skilled in the art. Such other modifications are intended to be within the scope of the claims if they have similar elements that do not differ from the literal language of the claims or if they include equivalent elements with insubstantial differences from the literal language of the claims.
  • It is to be understood that the scope of the protection is extended to such a program and in addition to a computer-readable means having a message therein; such computer-readable storage means contain program-code means for implementation of one or more steps of the method, when the program runs on a server or mobile device or any suitable programmable device. The hardware device can be any kind of device which can be programmed including e.g. any kind of computer like a server or a personal computer, or the like, or any combination thereof. The device may also include means which could be e.g. hardware means like e.g. an application-specific integrated circuit (ASIC), a field-programmable gate array (FPGA), or a combination of hardware and software means, e.g. an ASIC and an FPGA, or at least one microprocessor and at least one memory with software processing components located therein. Thus, the means can include both hardware means, and software means. The method embodiments described herein could be implemented in hardware and software. The device may also include software means. Alternatively, the embodiments may be implemented on different hardware devices, e.g. using a plurality of CPUs.
  • The embodiments herein can comprise hardware and software elements. The embodiments that are implemented in software include but are not limited to, firmware, resident software, microcode, etc. The functions performed by various components described herein may be implemented in other components or combinations of other components. For the purposes of this description, a computer-usable or computer readable medium can be any apparatus that can comprise, store, communicate, propagate, or transport the program for use by or in connection with the instruction execution system, apparatus, or device.
  • The illustrated steps are set out to explain the exemplary embodiments shown, and it should be anticipated that ongoing technological development will change the manner in which particular functions are performed. These examples are presented herein for purposes of illustration, and not limitation. Further, the boundaries of the functional building blocks have been arbitrarily defined herein for the convenience of the description. Alternative boundaries can be defined so long as the specified functions and relationships thereof are appropriately performed. Alternatives (including equivalents, extensions, variations, deviations, etc., of those described herein) will be apparent to persons skilled in the relevant art(s) based on the teachings contained herein. Such alternatives fall within the scope of the disclosed embodiments. Also, the words "comprising," "having," "containing," and "including," and other similar forms are intended to be equivalent in meaning and be open ended in that an item or items following any one of these words is not meant to be an exhaustive listing of such item or items, or meant to be limited to only the listed item or items. It must also be noted that as used herein and in the appended claims, the singular forms "a," "an," and "the" include plural references unless the context clearly dictates otherwise.
  • Furthermore, one or more computer-readable storage media may be utilized in implementing embodiments consistent with the present disclosure. A computer-readable storage medium refers to any type of physical memory on which information or data readable by a processor may be stored. Thus, a computer-readable storage medium may store instructions for execution by one or more processors, including instructions for causing the processor(s) to perform steps or stages consistent with the embodiments described herein. The term "computer-readable medium" should be understood to include tangible items and exclude carrier waves and transient signals, i.e., be non-transitory. Examples include random access memory (RAM), read-only memory (ROM), volatile memory, nonvolatile memory, hard drives, CD ROMs, DVDs, flash drives, disks, and any other known physical storage media.
  • It is intended that the disclosure and examples be considered as exemplary only, with a true scope of disclosed embodiments being indicated by the following claims.

Claims (12)

  1. A processor implemented method (200) for workload characterization-based capacity planning for a serverless execution environment, the method comprising:
    receiving (202), via one or more hardware processors, an application to be executed in the serverless execution environment; and
    performing (204), via the one or more hardware processors, the workload characterization-based capacity planning of the application using a serverful execution environment, wherein performing the workload characterization-based capacity planning comprising:
    checking (204a) whether a storage requirement of the application, to create an execution environment of the application, is more than a maximum temporary storage available on a serverless instance of the serverless execution environment;
    refactoring (204b) the application into a plurality of Application Programming Interfaces (APIs) if the storage requirement is more than the maximum temporary storage, wherein the plurality of APIs are independent of each other and run on a plurality of serverless instances of the serverless execution environment, wherein a Point to Point (P2P) communication between the plurality of APIs is performed using an Elastic File System (EFS) enabling the plurality of APIs to read and write the data from the EFS;
    checking (204c) whether a compute requirement of each of the plurality of APIs is within a maximum number of cores provided by the serverless execution environment;
    running (204d) each data unit from among a plurality of data units in a dataset used by the application for each of the plurality of APIs on the serverful execution environment by varying number of cores provided by a server in the serverful execution environment from a minimum number of cores to the maximum number of cores if the compute requirement is satisfied by the maximum number of cores, wherein data units in the dataset comprise a mix of identical data units and unidentical data units for similar type of data;
    determining (204e) an average execution time for each of data unit of the dataset for each of the plurality of APIs;
    recording (204f) an optimal number of cores for each of the plurality of APIs, beyond which there is no further decrease in the execution time of each of the plurality of APIs; and
    configuring (204g) the plurality of serverless instances for executing the application in accordance with the optimal number of cores for each of the plurality of APIs in the serverless execution environment.
  2. The method of claim 1, further comprising performing one of, when the compute requirement of one or more APIs among the plurality of API is not satisfied by the maximum number of cores:
    a) refactoring the one or more APIs into multiple APIs till the compute requirement is below the maximum number of cores; and
    b) launching each thread on a unique serverless instance, if the one or more APIs have a multi-threaded component.
  3. The method of claim 1, wherein the method further comprises providing a cost model for evaluating a total cost of end-to-end deployment of the application, which utilizes a plurality of services of the serverless computation environment, wherein the total cost is evaluated for a plurality of scenarios of usage of the plurality of services based on variations in computational requirements, storage requirements, and network requirements.
  4. The method of claim 3, wherein the cost model generates recommendations based on cost and performance trade-offs for selecting a deployment architecture of the serverless execution environment.
  5. A system (100) for workload characterization-based capacity planning for a serverless execution environment, the system (100) comprising:
    a memory (102) storing instructions;
    one or more Input/Output (I/O) interfaces (106); and
    one or more hardware processors (104) coupled to the memory (102) via the one or more I/O interfaces (106), wherein the one or more hardware processors (104) are configured by the instructions to:
    receive an application to be executed in the serverless execution environment; and
    perform the workload characterization-based capacity planning of the application using a serverful execution environment, the workload characterization-based capacity planning comprising:
    checking whether a storage requirement of the application, to create an execution environment of the application, is more than a maximum temporary storage available on a serverless instance of the serverless execution environment;
    refactoring the application into a plurality of Application Programming Interfaces (APIs) if the storage requirement is more than the maximum temporary storage, wherein the plurality of APIs are independent of each other and are run on a plurality of serverless instances of the serverless execution environment, wherein a Point to Point (P2P) communication between the newly created APIs is performed using an Elastic File System (EFS) enabling the plurality of APIs to read and write the data from the EFS;
    checking whether a compute requirement of each of the plurality of APIs is within a maximum number of cores provided by the serverless execution environment;
    running each data unit from among a plurality of data units in a dataset used by the application for each of the plurality of APIs on the serverful execution environment by varying number of cores provided by a server in the serverful environment from a minimum number of cores to the maximum number of cores if the compute requirement is satisfied by the maximum number of cores, wherein data units in the dataset comprise a mix of identical data units and unidentical data units for similar type of data;
    determining an average execution time for each data unit of the dataset for each of the plurality of APIs;
    recording an optimal number of cores for each of the plurality of APIs, beyond which there is no further decrease in the execution time of each of the plurality of APIs; and
    configuring the plurality of serverless instances for executing the application in accordance with the optimal number of cores for each of the plurality of APIs in the serverless execution environment.
  6. The system of claim 5, wherein the one or more hardware processors are further configured to perform one of, when the compute requirement of one or more APIs among the plurality of API is not satisfied by the maximum number of cores:
    a) refactoring the one or more APIs into multiple APIs till the compute requirement is reduced to less than the maximum number of cores; and
    b) launching each thread on a unique serverless instance, if the one or more APIs have a multi-threaded component.
  7. The system of claim 5, wherein the one or more hardware processors are further configured execute a cost model for evaluating a total cost of end-to-end deployment of the application, which utilizes a plurality of services of the serverless computation environment, wherein the total cost is evaluated for a plurality of scenarios of usage of the plurality of services based on variations in computational requirements, storage requirements, and network requirements.
  8. The system of claim 7, wherein the cost model is configured to generate recommendations based on cost and performance trade-offs for selecting a deployment architecture of the serverless execution environment.
  9. One or more non-transitory machine-readable information storage mediums comprising one or more instructions which when executed by one or more hardware processors cause:
    receiving, an application to be executed in the serverless execution environment; and
    performing, the workload characterization-based capacity planning of the application using a serverful execution environment, wherein performing the workload characterization-based capacity planning comprising:
    checking whether a storage requirement of the application, to create an execution environment of the application, is more than a maximum temporary storage available on a serverless instance of the serverless execution environment;
    refactoring the application into a plurality of Application Programming Interfaces (APIs) if the storage requirement is more than the maximum temporary storage, wherein the plurality of APIs are independent of each other and run on a plurality of serverless instances of the serverless execution environment, wherein a Point to Point (P2P) communication between the plurality of APIs is performed using an Elastic File System (EFS) enabling the plurality of APIs to read and write the data from the EFS;
    checking whether a compute requirement of each of the plurality of APIs is within a maximum number of cores provided by the serverless execution environment;
    running each data unit from among a plurality of data units in a dataset used by the application for each of the plurality of APIs on the serverful execution environment by varying number of cores provided by a server in the serverful execution environment from a minimum number of cores to the maximum number of cores if the compute requirement is satisfied by the maximum number of cores, wherein data units in the dataset comprise a mix of identical data units and unidentical data units for similar type of data;
    determining an average execution time for each of data unit of the dataset for each of the plurality of APIs;
    recording an optimal number of cores for each of the plurality of APIs, beyond which there is no further decrease in the execution time of each of the plurality of APIs; and
    configuring the plurality of serverless instances for executing the application in accordance with the optimal number of cores for each of the plurality of APIs in the serverless execution environment.
  10. The one or more non-transitory machine-readable information storage mediums of claim 9, wherein the one or more instructions which when executed by the one or more hardware processors further cause performing one of, when the compute requirement of one or more APIs among the plurality of API is not satisfied by the maximum number of cores:
    a) refactoring the one or more APIs into multiple APIs till the compute requirement is below the maximum number of cores; and
    b) launching each thread on a unique serverless instance, if the one or more APIs have a multi-threaded component.
  11. The one or more non-transitory machine-readable information storage mediums of claim 9, wherein the one or more instructions which when executed by the one or more hardware processors further cause providing a cost model for evaluating a total cost of end-to-end deployment of the application, which utilizes a plurality of services of the serverless computation environment, wherein the total cost is evaluated for a plurality of scenarios of usage of the plurality of services based on variations in computational requirements, storage requirements, and network requirements.
  12. The one or more non-transitory machine-readable information storage mediums of claim 11, wherein the cost model generates recommendations based on cost and performance trade-offs for selecting a deployment architecture of the serverless execution environment.
EP22210521.5A 2021-12-14 2022-11-30 Workload characterization-based capacity planning for cost-effective and high-performance serverless execution environment Pending EP4198729A1 (en)

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
IN202121058253 2021-12-14

Publications (1)

Publication Number Publication Date
EP4198729A1 true EP4198729A1 (en) 2023-06-21

Family

ID=84366937

Family Applications (1)

Application Number Title Priority Date Filing Date
EP22210521.5A Pending EP4198729A1 (en) 2021-12-14 2022-11-30 Workload characterization-based capacity planning for cost-effective and high-performance serverless execution environment

Country Status (2)

Country Link
US (1) US20230185625A1 (en)
EP (1) EP4198729A1 (en)

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20210117307A1 (en) * 2020-12-26 2021-04-22 Chris M. MacNamara Automated verification of platform configuration for workload deployment
US11032160B1 (en) * 2020-07-31 2021-06-08 Boomi, Inc. Serverless elastic scale API gateway management system and method of an API service control plane system
US20210184941A1 (en) * 2019-12-13 2021-06-17 Hewlett Packard Enterprise Development Lp Proactively accomodating predicted future serverless workloads using a machine learning prediction model and a feedback control system
US20210367862A1 (en) * 2020-05-21 2021-11-25 Sap Se Personalized serverless functions for multi-tenant cloud computing environment

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20210184941A1 (en) * 2019-12-13 2021-06-17 Hewlett Packard Enterprise Development Lp Proactively accomodating predicted future serverless workloads using a machine learning prediction model and a feedback control system
US20210367862A1 (en) * 2020-05-21 2021-11-25 Sap Se Personalized serverless functions for multi-tenant cloud computing environment
US11032160B1 (en) * 2020-07-31 2021-06-08 Boomi, Inc. Serverless elastic scale API gateway management system and method of an API service control plane system
US20210117307A1 (en) * 2020-12-26 2021-04-22 Chris M. MacNamara Automated verification of platform configuration for workload deployment

Also Published As

Publication number Publication date
US20230185625A1 (en) 2023-06-15

Similar Documents

Publication Publication Date Title
US9218196B2 (en) Performing pre-stage replication of data associated with virtual machines prior to migration of virtual machines based on resource usage
US8572623B2 (en) Determining an optimal computing environment for running an image based on performance of similar images
US10650008B2 (en) Parallel scoring of an ensemble model
US8930957B2 (en) System, method and program product for cost-aware selection of stored virtual machine images for subsequent use
US20180052709A1 (en) Dynamic usage balance of central processing units and accelerators
US9535754B1 (en) Dynamic provisioning of computing resources
US11651499B2 (en) Reducing structural redundancy in automatic image segmentation
US10680975B2 (en) Method of dynamic resource allocation for public clouds
US20200034196A1 (en) Optimizing simultaneous startup or modification of inter-dependent machines with specified priorities
US9935849B2 (en) Assessing a service offering in a networked computing environment
US10929161B2 (en) Runtime GPU/CPU selection
US11809424B2 (en) Auto-scaling a query engine for enterprise-level big data workloads
WO2019193570A1 (en) Batch jobs execution time prediction using distinct service demand of threads and instantaneous cpu utilization
US11086776B2 (en) Maintaining correctness of pointers from a managed heap to off-heap memory
US20200278877A1 (en) Optimization of multi-layered images
US11409564B2 (en) Resource allocation for tuning hyperparameters of large-scale deep learning workloads
JP2021504777A (en) Automatic diagonal scaling of workloads in a distributed computing environment
EP4198729A1 (en) Workload characterization-based capacity planning for cost-effective and high-performance serverless execution environment
WO2023056793A1 (en) Optimizing a just-in-time compilation process
US10949343B2 (en) Instant storage reclamation ensuring uninterrupted media recording
US20200264926A1 (en) Reducing cloud application execution latency
US11164078B2 (en) Model matching and learning rate selection for fine tuning
US9619153B2 (en) Increase memory scalability using table-specific memory cleanup
EP3258388A1 (en) Parallelization techniques for variable selection and predictive models generation and its applications
US20200404270A1 (en) Flexible slice, tile and brick partitioning

Legal Events

Date Code Title Description
PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: THE APPLICATION HAS BEEN PUBLISHED

AK Designated contracting states

Kind code of ref document: A1

Designated state(s): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC ME MK MT NL NO PL PT RO RS SE SI SK SM TR

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: REQUEST FOR EXAMINATION WAS MADE

17P Request for examination filed

Effective date: 20230720

RBV Designated contracting states (corrected)

Designated state(s): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC ME MK MT NL NO PL PT RO RS SE SI SK SM TR