Abstract: Container technology has been widely used in the oblivious computing platform of edge servers due to its advantages such as lightweight nature,easy deployment,and high availability.However,with the increasing demand for low-latency in applications,the high-latency problem caused by the cold start of containers has gradually become a bottleneck for system perfor-mance.WebAssembly(Wasm),with its lightweight sandbox feature and millisecond-level startup capability,has become an important complementary solution to container technology in certain scenarios.However,its computational performance is inferior to that of containers.Especially when dealing with complex interdependencies between functions,the inherent advantages and disadvantages of Wasm and containers make the decision on function deployment methods and locations extremely difficult.To address this issue,this paper constructs an oblivious computing model for servers based on function dependencies,transforming the pro-blem of mixed deployment of Wasm and containers into a non-linear integer programming problem.This problem is subsequently proven to be an NP-hard problem.Therefore,this paper designs the Long-Latency-Sensitive Weighted Bandwidth Greedy Scheduling Algorithm(LLS-WBG).Based on function dependencies and the longest completion time of predecessor functions,it calculates the server bandwidth with weights to optimize resource utilization and reduce the tail latency of tasks.Experimental results based on real-world data show that,in the edge computing scenario,compared with the state-of-the-art algorithms,the proposed algorithm can reduce the application completion time by 44.45%.

Key words: Serverless computing, Container, Edge computing, WebAssembly