Oct 2026· IEEE Transactions on Mobile Computing· Vol 25, pp. 17732-17743· 0 citations· 37 references
Abstract
Serverless edge computing, despite its flexibility and efficiency, is hindered by high startup latency during peak load. Remote fork, employing either Checkpoint/Restore (C/R) or Remote Direct Memory Access (RDMA), offers a potential solution for function scaling acceleration. Although RDMA fork is faster, the opportunities are limited, whereas C/R fork is more common but slower. Moreover, the regeneration capability that a forked function can further fork new instances complicates the remote fork decisions for fast scaling. Therefore, in this paper, we are motivated to address the problem on how to holistically exploit C/R fork and RDMA fork with the consideration of the underlying infrastructure features (e.g., topology, resources, etc.) to realize fast function scaling. We first formulate it to an Integer Linear Programming (ILP) problem. We further introduce a Heat metric to assess the potential of an edge server as a fork destination according to the topology and resource availability, and propose a Heat-based fork strategy (HEAT) for both the fork destination site and the corresponding fork mode decisions. Experiment results demonstrate that HEAT improves the function scaling speed by 46% and RDMA resource utilization by 51%, compared to state-of-the-art scaling solutions.
Results demonstrate that RSC can make RDMA economically viable for serverless services, and workflow, request‑mix, resource, noisy‑neighbor, endpoint‑scale, and QP‑density diagnostics confirm that connection reuse removes millisecond‑scale RC setup from warm service invocation paths.
Wen-Di Song, Guang-Ping Xu, Yang-Yang Fan et al.· Proceedings of the Internati...· 0 citations
Frontier open-weight models are increasingly available, but serving them still largely assumes datacenter infrastructure. We present FreeToken, an edge-native MoE serving system that treats a personal machine not as a small GPU, but as a unified, elastic inference platform. FreeToken co-designs the full serving stack,...
Shuo Yang, Xiao-yun Fan, Melissa Z. Pan et al.· 3 citations
CELLServe formalizes SLO-constrained joint resource provisioning as an optimization problem with a dedicated algorithm, and introduces an opportunistic instance merging strategy for decode phase functions to reclaim fragmented resources.
Ze-Jian Wang, Nan Lin, Zi-Nuo Cai et al.· ACM Transactions on Architec...· 0 citations
Gutenberg, a CPU+NDP for mutable, latency-critical cloud services, outperforms prior systems, reducing average and p99 latency by up to 80.4% and 85.8% and improves isolation and fairness while adapting to changing workload behaviors.
Qi Lin, Phillip B. Gibbons, Jovan Stojkovic et al.· 0 citations
QMScaler is proposed, a QoS-driven microservice horizontal scaling framework based on Monte Carlo Tree Search (MCTS) that aims to minimize the number of container instances while meeting the QoS requirements of multiple application functions.
Tian-Yang Zheng, Peng-Fei Yang, Zhe Xu et al.· Proceedings of the Internati...· 0 citations
Computing-continuum applications distribute work across devices, edge systems, fog resources, and clouds. While a placement, scheduling, or recovery decision is being made, resource availability, network conditions, and application progress may change, so the decision can be invalid by the time it is executed. Existing...
Zhi-Yu Wang, Rajkummar Buyya· 0 citations
Related blog posts
Microsoft Research Blog· microsoft.comOct 29, 2026
Host Sowbhagya Suresh shares some of the latest news and cutting-edge research from across Microsoft—from understanding the challenges facing coding agents to uncovering how people use AI at work and improving extended-range weather forecasting. The post Microsoft Research Focus – Edition #97 appeared first on Microsoft Research.
MIT News · Artificial Intelligence· news.mit.eduOct 28, 2026
Professor Paris Smaragdis develops computers with superhuman hearing for applications like speech recognition, music understanding, and environmental monitoring.
For decades, a fundamental question about the difficulty of computing in high-dimensional spaces has resisted proof. New research resolves this question, removing a major theoretical obstacle to understanding the efficiency of randomized algorithms used across science and computing. The Kannan–Lovász–Simonovits (KLS) conjecture was proposed in 1995. It asks whether, for a broad class of high-dimensional […] The post Solving a 31-year-old grand challenge in mathematics – the KLS conjecture appear…
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.