摘要
提出一种基于需求广播模型的实时事务数据的广播调度策略 .在本策略中 ,综合考虑了事务存取多个数据项和满足定时限制的要求 .本策略的目标是使错过截止期的事务数量最少 .对我们提出的算法 ,通过建立模拟实验进行评价 。
In this paper, we propose a broadcast scheduling strategy for real time transaction based on the BoD (Broadcast on Demand) model. In the strategy, the issue of both accessing multiple data items and meeting the timing constrain of the transaction are considered. The purpose of the algorithms is to reduce the number of transactions missing their deadlines. An extensive simulation experiments have been conducted to evaluate the performance of the proposed algorithm. Results show that our broadcast algorithms achieve excellent performance comparing with existing strategies.
出处
《小型微型计算机系统》
CSCD
北大核心
2004年第4期531-534,共4页
Journal of Chinese Computer Systems
基金
国家自然科学基金 ( 60 0 73 0 45 )资助
国防预研基金 ( 0 0 J15 .3 .3 .JW0 5 2 9)项目
关键词
移动计算
实时事务
定时限制
广播调度
mobile computing
real time
timing constraint
broadcast scheduling
