检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:刘庆利[1,2] 潘成胜[1] 王国仁[2] 田野[3]
机构地区:[1]大连大学,大连116622 [2]东北大学信息科学与工程学院,沈阳110004 [3]沈阳理工大学信息科学与工程学院,沈阳110159
出 处:《系统仿真学报》2013年第1期87-93,共7页Journal of System Simulation
基 金:国家自然科学基金(61101116);辽宁省高等学校杰出青年学者成长计划(LJQ2012018)
摘 要:提出了一种适用于AOS的虚拟信道/帧分离估算的调度算法。该算法根据信源的数据类型将传输时隙分成同步时隙和异步时隙,在同步时隙时采用轮询算法进行调度,在异步时隙时则首先分别估算虚拟信道的紧迫度与数据帧的紧迫度,再将二者结合起来构造新的虚拟信道传输紧迫度函数,以满足各信源数据传输的时延要求。与传统的动态优先级调度算法相比,提出的算法在各虚拟信道丢帧率和系统信道利用率保持不变的情况下,大幅度的降低了重要性较高的虚拟信道的平均调度时延、最大调度时延与缓存剩余量。实验表明,本算法的性能明显优于传统的算法,更适合空间链路的多样化数据传输。A novel AOS virtual channels scheduling algorithm based on separate evaluation of Virtual Channels and Frames was proposed. The proposed algorithm divided transmission time slots into synchronous ones and asynchronous ones. In synchronous time slots, the virtual channels were scheduled in a polling manner. While in asynchronous time slots, virtual channels urgent degree and frame urgent degree were first considered separately, and then they were joined together to form a new urgent degree function, which could satisfy the transmission demand of various data sources. Compared to the traditional dynamic priority scheduling algorithm, the proposed algorithm could provide much lower average scheduling delay and maximal scheduling delay of the important virtual channels, without deteriorating frame loss rates and channel utilization rate. Experiments show that the proposed algorithm outperforms the traditional algorithm greatly, and it fits for diverse data transmission over space links much better.
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.46