Sep 2026· IEEE Transactions on Mobile Computing· Vol 25, pp. 14120-14134· 0 citations· 46 references
Abstract
This paper presents a reliability analysis framework for distributed computing in extreme edge computing (XEC) with limited information availability. XEC pushes computation to the outermost boundaries of networks by leveraging consumer-owned devices, known as Extreme Edge Devices (XEDs). Unlike traditional distributed systems with defined computational resource states, XEC operates under uncertainty due to consumer device usage patterns, varying computational capacities, and local scheduling algorithms. In this work, we address discrete task assignment particularly. The framework analyzes scenarios for computational reliability assessments with minimal knowledge of XED capabilities and service requirements. The framework adapts to different levels of available information, from operational limits to historical performance data, providing refined reliability estimates. The aim of this work is to provide generalized reliability models for distributed computing in XEC that allow decision-makers (e.g. service orchestrators) to make informed decisions about task allocation, service placement, and resource allocation under uncertainty in XEC. Simulations and experimental analysis demonstrate the framework’s effectiveness in estimating reliability under various system conditions.
Service placement in edge computing is a complex multi-objective optimisation problem defined by conflicting requirements and dynamic environments. While self-adaptive approaches are essential for handling this dynamism, the community needs specific frameworks to evaluate them. We introduce iFogSim-placement, a framework designed for experimenting with self-adaptive service placement. Unlike existing simulators, iFogSim-placement decouples decision-making from execution for modelling information staleness, mobility, and stochastic demand. The artefact enables implementing self-adaptive approaches as Java plug-ins and evaluating them under heterogeneous configurations. Researchers can define experiments to evaluate self-adaptive approaches under variable configurations, including network topology, application complexity, request patterns, and mobility scenarios. We present the architecture, usage instructions, and validation of the artefact, demonstrating its ability to capture performance metrics, including application latency, resource usage, and energy consumption. The artefact is open-source (https://github.com/DawnSpider96/iFogSim-Placement), aiming to lower the barrier to developing and fairly benchmarking self-adaptive edge systems.
Joseph Poon, Christian Cabrera, N. D. Lawrence· SEAMS@ICSE· 0 citations
A distributed Multi-stage Adaptive Deferred Acceptance (MA-DA) algorithm is proposed that enables a stable and Pareto-optimal assignment of tasks to edge computing nodes (ECNs) and determines a reasonable task execution sequence and ensures the prioritized completion of delay-sensitive tasks.
Experiments show that the proposed Hybrid Framework for Joint Optimization of Resource Allocation and Load Balancing that spans two layers in heterogeneous cloud computing systems obtains 25-30% energy savings compared with ordinary methods, significantly reduces p95 latency and also achieves a relatively better Quality Of Service.
Eram Fatma, Nidhi Mishra, Mohammed Abdul Bari· Journal of Intelligent Decis...· 0 citations
A novel QoS-aware task deployment methodology to enhance the Quality of Service (QoS) under resource limitations is introduced and results demonstrate that the proposed method achieves superior system performance compared to existing approaches.
Haotong Zhu, Lei Mo, T. Al-Hasan et al.· ACM Transactions on Design A...· 0 citations
Dynamic edge networks suffer from fluctuating bandwidth, latency, and edge-node load, which weaken conventional task offloading strategies under deadline and energy constraints. This study proposes an adaptive task offloading strategy based on dynamic network states. An online broad learning system predicts short-term bandwidth, transmission delay, and load from sliding-window observations. The predictions are embedded into a model predictive control framework for rolling optimization of the local-edge task allocation ratio, while confidence-interval-guided compensation adjusts decisions under prediction uncertainty. ADMM is used for distributed solution. NS-3/Python simulations show that the proposed method achieves a $93\%$ task success rate, 1.22 W average terminal energy consumption, 3.2 switches/s, and 45 ms average completion time, outperforming local execution, reactive offloading, and DQN-based offloading. The proposed strategy improves real-time reliability, energy efficiency, and robustness in highly dynamic edge computing environments.
Jie Yang, Peng Li, Guangfu Ge et al.· 2026 5th International Confe...· 0 citations
Related blog posts
Microsoft Research Blog· microsoft.comAug 31, 2026
What if pathology foundation models could do more with less? GigaPath-Flash and GigaTIME-Flash cut computational demands while maintaining strong performance, opening the door to larger studies and broader exploration. The post GigaPath-Flash and GigaTIME-Flash: Toward population-scale discovery with efficient pathology foundation models appeared first on Microsoft Research.
MIT News · Artificial Intelligence· news.mit.eduAug 31, 2026
With millions of users across the world, Julia has been used to conduct cutting-edge research and to design new drugs, jet engines, heat pumps, and more.
MIT News · Artificial Intelligence· news.mit.eduAug 27, 2026
A new machine-learning framework aims to improve the success rate of computational protein design while moving away from results that reproduce sequences found in nature.