A Fault Tolerant Mechanism for Partitioning and Offloading Framework in Pervasive Environments
Nevin Vunka Jungum, Nawaz Mohamudally, Nimal Nissanke

TL;DR
This paper proposes a fault tolerant algorithm for application partitioning and offloading in pervasive environments, addressing network disconnections caused by high mobility, and demonstrating adaptability with minimal overhead.
Contribution
It introduces a fault tolerant mechanism that groups devices by reliability and supports multiple policies, enhancing robustness in pervasive application offloading.
Findings
Algorithm adapts to various execution conditions
Minimal overhead incurred during fault tolerance
Effective in high mobility and disconnection scenarios
Abstract
Application partitioning and code offloading are being researched extensively during the past few years. Several frameworks for code offloading have been proposed. However, fewer works attempted to address issues occurred with its implementation in pervasive environments such as frequent network disconnection due to high mobility of users. Thus, in this paper, we proposed a fault tolerant algorithm that helps in consolidating the efficiency and robustness of application partitioning and offloading frameworks. To permit the usage of different fault tolerant policies such as replication and checkpointing, the devices are grouped into high and low reliability clusters. Experimental results shown that the fault tolerant algorithm can easily adapt to different execution conditions while incurring minimum overhead.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsIoT and Edge/Fog Computing · Distributed systems and fault tolerance · Cloud Computing and Resource Management
