摘要
分析了变长数据广播中平均访问时间的理论最小值,给出了平均访问时间取得最小值的必要条件,基于此分析提出了一种变长数据广播的多盘调度算法.实验表明,变长数据的多盘广播调度算法比较接近理论最小值,较平坦调度具有明显的优势.它适合于数据项长度不等的数据库,并且在数据项的访问概率呈现明显偏斜的情形下性能更佳.
A theoretical analysis on the optimal mean access time was conducted in broadcast of variable-length items. The necessary condition for the optimal mean access was given. On the basis of the analysis, a multi-disk scheduling algorithm was presented for broadcast of variable-length items. The experiment indicated that the algorithm results were close to the theoretical maximum and it possessed dominant advantage than the flat scheduling did. it is appropriate for database with unequal data length and possesses excellent performance when the visiting probability of data moves in inclined tendency.
出处
《华中科技大学学报（自然科学版）》
EI
CAS
CSCD
北大核心
2006年第1期30-32,共3页
Journal of Huazhong University of Science and Technology(Natural Science Edition)
基金
国家自然科学基金资助项目(60203017)
教育部留学回国人员基金资助项目
关键词
移动计算
变长数据广播
访问时间
mobile computing
variable-lengthed data broadcast
access time
