检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:钱光明[1]
机构地区:[1]湖南师范大学数学与计算机科学学院,中国长沙410081
出 处:《湖南师范大学自然科学学报》2009年第4期23-26,共4页Journal of Natural Science of Hunan Normal University
基 金:湖南省自然科学基金资助项目(09JJ5040);湖南省科技厅科学与技术研究基金资助项目(2008FJ4215)
摘 要:研究对象是交换式实时局域网.一个交换机中,多个实时任务可能要经由同一出口,因而可以看作一个实时任务集.多个出口可对应多个实时任务集,且有的任务可能会出现在不同的任务集中.传统的自动调度算法难以直接应对这样的环境.因此,提出了一种EDF-A(earliest deadline first-adjustment)算法,旨在对单个任务集的调度方案进行调整,以尽量满足所有任务集的时间指标.同时为应对不断提高的网络速度,还对所用方案采用全硬件快速实现作了详细描述.Real-time switched networks are studied. In a switch, tasks destined to the same output can be considered as a set of real-time tasks. Multi-ports relate to multi-sets of real-time tasks, some of which may act in different sets. Classical auto schedulers are hard to be directly used in such situation. An EDF-A (earliest deadline first-adjustment) algorithm is presented, on which schedulers for single sets are adjusted to make as many time constraints of tasks in all sets satisfied as possible. At the same time, the overall hardware implementation of the algorithm is described in detail to cater for the increasing speed in networks today.
分 类 号:TP393.1[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.229