Scheduling algorithms of real-time transactions based on traversing a directed acyclic graph
Xiang Jun · Computer Engineering and Applications Journal · 2010
Real-time transactions will restart or abort possibly for competing limited system resources in low bandwidth environ-ments and the unpredictable system workloads in mobile environments.Conventional scheduling algorithms of real-time transactions cannot adapt this situation,so a novel scheduling algorithm of real-time transactions is proposed based on traversing a directed acyclic graph which describes the derived relationship of all real-time data objects.Some update transactions with low value will be discarded to reduce system workload considering the data objects validity in time domain and value domain.The deadline miss ratio of transactions can be reduced and data freshness can be improved through simulation experiments.