Scheduling algorithms for message transmission over a satellite broadcast system
Scheduling algorithms for message transmission over a satellite broadcast system
复制标题
卫星广播系统消息传输的调度算法
DOI：
10.1109/milcom.1997.646697
复制
发表时间：
1997
期刊：
影响因子：
--
通讯作者：
E. Modiano
中科院分区：
文献类型：
--
作者：
E. Modiano
本文讨论了卫星广播系统上消息传输的调度算法。该系统预计可以传递不同长度的消息。我们的目标是找到一种对所有大小的消息都表现出良好延迟性能的调度算法。我们表明，先到先服务和循环等经典调度算法在这种环境中表现不佳。我们研究了两种替代方案。第一种，为剩余处理时间 (SRPT) 最短的消息提供抢占优先级。众所周知，该方案可以最大限度地减少总体平均消息延迟，但会导致长消息出现不成比例的大延迟。第二种方案基于动态优先级函数来提供消息，其中消息的优先级根据消息在系统中存在的时间及其长度而变化。这种方案会导致整体平均延迟稍大一些，但对于长消息来说更公平。
This paper addresses scheduling algorithms for message transmissions over a satellite broadcast system. The system is expected to deliver messages of widely varied length. Our objective is to find a scheduling algorithm that exhibits good delay performance for messages of all sizes. We show that classical scheduling algorithms such as first-come-first-serve and round-robin perform poorly in this environment. We study two alternative schemes. The first, gives preemptive priority to the message with the shortest remaining processing time (SRPT). This scheme is known to minimize overall average message delays, but results in disproportionately large delays for long messages. The second scheme, serves messages based on a dynamic priority function, where a message's priority varies based on how long the message has been in the system as well as its length. This scheme results in somewhat larger overall average delays, but it is more fair to long messages.