CICQ交换机调度算法及基于时限的优先级保证

CICQ交换机调度算法及基于时限的优先级保证

ID:36451852

大小:2.69 MB

页数:105页

时间:2019-05-10

CICQ交换机调度算法及基于时限的优先级保证_第1页
CICQ交换机调度算法及基于时限的优先级保证_第2页
CICQ交换机调度算法及基于时限的优先级保证_第3页
CICQ交换机调度算法及基于时限的优先级保证_第4页
CICQ交换机调度算法及基于时限的优先级保证_第5页
资源描述:

《CICQ交换机调度算法及基于时限的优先级保证》由会员上传分享,免费在线阅读,更多相关内容在学术论文-天天文库

1、东南大学博士学位论文CICQ交换机调度算法及基于时限的优先级保证姓名:李勇申请学位级别:博士专业:计算机应用技术指导教师:罗军舟20070301ABSTRACTWithnOinternalspeed-uprequiredandparallel,distributeschedulingatinputandoutput,theClCQ(CombinedInputCrosspointQueuedorbufferedswitch)fabricprovidesuniqueadvantageofdesigni

2、nghighperformanceswitches.Theopenproblemsinthisfieldale:lowlevelschedulingalgorithmsusuallyputemphasisonitspracticability,whichaimatachievinglittlebuffer,lowcomplexityandhighthroughput.HigIIlevelschedulingalgorithmusuanyisconsideredtosolvesomeproblems

3、whichmustsatisfymorerestrictions,suchasdeadlineguaranteedetc.Multi-deadlineschedulingproblemhasbeenprovedtObeNP-completeifthreeormoledistinctdeadlines(classes)ampresentintheset.Priorityschedulingproblemwithdeadlineguaranteedhasalsobeenahotanddifficult

4、problemstudiedinthefieldofReal-Timescheduling.However,theproposedlowlevelschedulingalgorithmsc柚onlyachieveofIeOrseveralrequirements.Meanwhile,hilghlevelschedulingalgorithmsstillcannotbreaktheperformancelimitofEDFalgorithmsintheree,ent30years.Thisdisse

5、rtationaddressestheaboveopenproblems.Inthelowlevelschedulingfield,performanceanalysisresultsaleproposedunderuniformtrafficandnou-uniformtraffic.Thethreecriterionincludinglittlebuffer,lowcomplexityandhighthroughputmustbeobeyedinthedesignofschedulingalg

6、orithm.Moreover,RRarbiterisbelievedtobethebestchoiceintheoutputscheduling.Basedontheperformanceanalysisresults,aschedulingalgorithmisproposedwhichisliRlebuffer,0(】)complexityand100%throughputinthelowlevelscheduling.ThenewalgorithmCallachieve100%throug

7、hputundereitheruniformOrnon-uniformtraffic,maintainingthesimplicityandeffectivenessofRoundRobinalgorithmandmeanwhileovercomingtheinstabilityoftheRoundRobinalgorithmundernon-uniformtraffic.Inthehighlevelschedulingfield'anovelalgorithmnamedFlow-basedIte

8、rativePacketScheduling(FIPS)isproposed.TheFIPSalgorithmemployedentirelydifferentschedulingstrategywhencomparingtotheclassicEDFalgorithm.Themulti-deadlinepriorityschedulingNP-Cproblemisconvertedtosolvethenet-flowproblemwithupperandlowerboundthr

当前文档最多预览五页,下载文档查看全文

此文档下载收益归作者所有

当前文档最多预览五页,下载文档查看全文
温馨提示:
1. 部分包含数学公式或PPT动画的文件,查看预览时可能会显示错乱或异常,文件下载后无此问题,请放心下载。
2. 本文档由用户上传,版权归属用户,天天文库负责整理代发布。如果您对本文档版权有争议请及时联系客服。
3. 下载前请仔细阅读文档内容,确认文档内容符合您的需求后进行下载,若出现内容与标题不符可向本站投诉处理。
4. 下载文档时可能由于网络波动等原因无法下载或下载错误,付费完成后未能成功下载的用户请联系客服处理。