MATEC Web Conf.
Volume 160, 2018International Conference on Electrical Engineering, Control and Robotics (EECR 2018)
|Number of page(s)||5|
|Section||Information Science and Engineering|
|Published online||09 April 2018|
Maintaining temporal validity of real-time data on non-continuously executing resources
Hunan Institute of Science and Technology, College of Computer Science, 414000, Yueyang, China
2 Wuhan Maritime Communication Research Institute, 430079, Wuhan, China
This paper studies the problem of temporal validity maintenance on non-continuously-executing resources. Response time bounds for sensor transaction scheduling are derived in the context of the hybrid extended multiprocessor periodic resource model. Then two deadline and period assignment schemes are proposed to maintain the temporal validity of real-time data. The calculation based scheme (DPA-C) uses the response time bounds to compute deadlines and periods. The check based scheme (DPA-A) assigns deadlines and periods directly. It then checks the feasibility of the assignment based on the response time bounds. Experiments are conducted to evaluate the performance of the proposed schemes. The results show that DPA-C performs better than DPA-A in terms of the scheduling success ratio and the imposed update workload.
© The Authors, published by EDP Sciences, 2018
This is an Open Access article distributed under the terms of the Creative Commons Attribution License 4.0, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. (http://creativecommons.org/licenses/by/4.0/).
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.