Time‐cost efficient memory configuration for serverless workflow applications. (21st September 2022)

• Record Type: Journal Article
• Authors: Li, Zengpeng; Yu, Huiqun; Fan, Guisheng
• Is Part Of: Concurrency and computation. Volume 34:Number 27(2022)
• Page Start: n/a
• Page End: n/a
• Publication Date: 2022-09-21
• Subjects: constrained optimization -- performance modeling -- serverless computing -- workflow memory configuration; Parallel processing (Electronic computers) -- Periodicals; Parallel computers -- Periodicals; 004.35
• DOI: 10.1002/cpe.7308
• Languages: English
• ISSNs: 1532-0626

Abstract

Summary: Recently, workflow applications are increasingly migrated to Function‐as‐a‐Service platforms which are easy to manage, highly‐scalable, and pay‐as‐you‐go. Meanwhile, users face challenges in migration of serverless applications because of the lack of efficient algorithm for workflow memory configuration to optimize the performance. To this end, this article proposes a heuristic urgency‐based algorithm UWC and a meta‐heuristic hybrid algorithm BPSO to tackle the time‐cost tradeoff. UWC sorts functions and allocates each function an appropriate memory size by greedy strategy. BPSO hybridizes particle swarm optimization as well as beetle antennae search algorithm to guide particles to search directionally and utilizes nonlinear inertia weight to avoid local premature convergence. Extensive experiments with classical serverless application demonstrate that UWC and BPSO are very competitive in comparison with existing algorithms as they can find the optimal workflow memory configuration.