Efficient Perfectly Periodic Scheduling for Data Broadcasting
Efficient Perfectly Periodic Scheduling for Data Broadcasting
复制标题
DOI：
10.1109/umc.2008.15
复制
发表时间：
2008-10
期刊：
影响因子：
--
通讯作者：
Wei-Mei Chen;M. Huang
中科院分区：
文献类型：
--
作者：
Wei-Mei Chen;M. Huang
完美周期调度问题是调度一组工件，使得每个工件在相当规则的时间间隔内偶尔得到服务。对于无线广播系统，当服务器周期性地向不同的移动的客户端广播数据时，完美的周期性调度提供无抖动广播和有用的信息以减少移动的设备的功耗。在本文中，我们提出了一个有效的算法，以确定一个完美的周期性的平均延迟低。仿真结果表明，当总带宽请求量较大且请求周期变化较大时，新算法仍能取得较好的性能。
The perfectly periodic scheduling problem is to schedule a set of jobs such that each job is served occasionally, at fairly regular time intervals. For wireless broadcast systems, when a server periodically broadcasts data to different mobile clients, a perfectly periodic schedule provides no-jitter broadcasting and useful information to reduce power consumption for mobile devices. In this paper, we propose an efficient algorithm to determine a perfectly periodic schedule with low average delay. Our simulation results show that the new algorithm performs still well when the total requested bandwidth is high and the variance of requested period is large.