Generic Adaptive Scheduling for Efficient Context Inconsistency Detection

Huiyan Wang

doi:10.1109/TSE.2019.2898976

Generic Adaptive Scheduling for Efficient Context Inconsistency Detection

2021-03-01

6

PRE

AI

DOI：10.1109/TSE.2019.2898976

Original

Original request for help

Save

Abstract

En 中文

Many applications use contexts to understand their environments and make adaptation. However, contexts are often inaccurate or even conflicting with each other (a.k.a. context inconsistency). To prevent applications from behaving abnormally or even failing, one promising approach is to deploy constraint checking to detect context inconsistencies. A variety of constraint checking techniques have been proposed, based on different incremental or parallel mechanisms for the efficiency. They are commonly deployed with the strategy that schedules constraint checking immediately upon context changes. This assures no missed inconsistency, but also limits the detection efficiency. One may break the limit by grouping context changes for checking together, but this can cause severe inconsistency missing problem (up to 79.2 percent). In this article, we propose a novel strategy GEAS to isolate latent interferences among context changes and schedule constraint checking with adaptive group sizes. This makes GEAS not only improve the detection efficiency, but also assure no missed inconsistency with theoretical guarantee. We experimentally evaluated GEAS with large-volume real-world context data. The results show that GEAS achieved significant efficiency gains for context inconsistency detection by 38.8-566.7 percent (or 1.4x-6.7x). When enhanced with an extended change-cancellation optimization, the gains were up to 2,755.9 percent (or 28.6x).

Keywords:

Context inconsistency detection

consistency constraint

scheduling strategy

susceptibility

cancellation condition

Generic Adaptive Scheduling for Efficient Context Inconsistency Detection

Abstract

AI Summary

Journal

Organization