Abstract

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.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call