本文選題：資源調(diào)度 + 物聯(lián)網(wǎng)��； 參考：《計(jì)算機(jī)仿真》2017年01期

【摘要】：對(duì)物聯(lián)網(wǎng)共享資源數(shù)據(jù)進(jìn)行合理調(diào)度,可以減少冗余數(shù)據(jù),提高物聯(lián)網(wǎng)絡(luò)性能。在進(jìn)行共享資源數(shù)據(jù)調(diào)度時(shí),需要構(gòu)建數(shù)據(jù)約束函數(shù),對(duì)共享資源數(shù)據(jù)進(jìn)行上下界的約束,而傳統(tǒng)的共享隊(duì)列算法是將數(shù)據(jù)資源請(qǐng)求提交到某個(gè)線程隊(duì)列中進(jìn)行調(diào)度,沒(méi)有設(shè)定數(shù)據(jù)資源上下界約束條件,導(dǎo)致某個(gè)隊(duì)列中出現(xiàn)數(shù)據(jù)擁塞,而另一隊(duì)列沒(méi)有數(shù)據(jù)的情況,降低了數(shù)據(jù)調(diào)的有效性。提出TD算法的物聯(lián)網(wǎng)中共享資源數(shù)據(jù)進(jìn)行調(diào)度,其中提出調(diào)度共享資源的上下界約束條件對(duì)將共享資源數(shù)據(jù)劃分為不同的狀態(tài),在此基礎(chǔ)上建立物聯(lián)網(wǎng)中共享資源數(shù)據(jù)調(diào)度模型,將模型中的執(zhí)行節(jié)點(diǎn)按計(jì)算能力進(jìn)行劃分,利用向上排序值計(jì)算方法將各個(gè)共享資源調(diào)度任務(wù)進(jìn)行排序,選取具有調(diào)度任務(wù)完成時(shí)間的最小值作為當(dāng)前任務(wù)分配的節(jié)點(diǎn),有效的完成了物聯(lián)網(wǎng)中共享資源數(shù)據(jù)調(diào)度。仿真結(jié)果證明,TD算法在物聯(lián)網(wǎng)共享資源數(shù)據(jù)調(diào)度中能夠大幅度的提升物聯(lián)網(wǎng)絡(luò)中共享資源數(shù)據(jù)調(diào)度的公平性與合理性。
[Abstract]:The rational scheduling of the shared resource data of the Internet of things can reduce redundant data and improve the performance of the network. In the process of sharing resource data scheduling, the data constraint functions need to be constructed to restrict the upper and lower bounds of the shared resource data, while the traditional shared queuing algorithm is to submit the data resource request to a thread queue. In scheduling, there is no set of constraints on the upper and lower bounds of data resources, which leads to the occurrence of data congestion in one queue, while the other queue has no data, which reduces the validity of the data transfer. The sharing resource data of the TD algorithm is scheduled, and the upper and lower bound constraints of the scheduling shared resources are proposed to share the resources. The data is divided into different states. On this basis, the sharing resource data scheduling model in the Internet of things is set up, the execution nodes in the model are divided according to the calculation ability, and the scheduling tasks of each shared resource are sorted by the upward sort value calculation method, and the minimum value of the completion time of the scheduling task is selected as the current task. The matching nodes effectively complete the shared resource data scheduling in the Internet of things. The simulation results show that the TD algorithm can greatly improve the fairness and rationality of sharing resource data scheduling in the IOT network with the shared resource data scheduling of the IOT.
【作者單位】： 南京林業(yè)大學(xué)信息中心;
【分類(lèi)號(hào)】：TP391.44;TN929.5

【參考文獻(xiàn)】

相關(guān)期刊論文 前6條

1 修于杰;黃凱;林威;余a\;莫鵬飛;嚴(yán)曉浪;;面向共享資源沖突的SoC并發(fā)時(shí)鐘調(diào)度管理[J];計(jì)算機(jī)工程;2015年09期

2 田春子;邵曉康;;局域網(wǎng)限速狀態(tài)下的資源調(diào)度模型仿真[J];計(jì)算機(jī)仿真;2015年04期

3 李嘯虎;;共享資源排隊(duì)調(diào)度系統(tǒng)的設(shè)計(jì)與實(shí)現(xiàn)[J];科技創(chuàng)業(yè)月刊;2015年03期

4 田國(guó)忠;肖創(chuàng)柏;謝軍奇;;有期限約束的多DAG共享資源的調(diào)度及公平費(fèi)用優(yōu)化方法[J];計(jì)算機(jī)學(xué)報(bào);2014年07期

5 張衛(wèi)華;謝曉琳;繆子英;丁恒;;資源共享?xiàng)l件下高速公路應(yīng)急救援資源調(diào)度方法[J];中國(guó)安全科學(xué)學(xué)報(bào);2014年05期

6 田國(guó)忠;肖創(chuàng)柏;趙娟娟;;云計(jì)算環(huán)境下多DAG調(diào)度的資源分配進(jìn)化算法[J];計(jì)算機(jī)應(yīng)用研究;2014年09期

【共引文獻(xiàn)】

相關(guān)期刊論文 前10條

1 周力臻;;大數(shù)據(jù)云平臺(tái)數(shù)據(jù)流量?jī)?yōu)化管理仿真[J];計(jì)算機(jī)仿真;2016年12期

2 陳超;;改進(jìn)CS算法結(jié)合決策樹(shù)的云工作流調(diào)度[J];電子科技大學(xué)學(xué)報(bào);2016年06期

3 江新;徐平;晉良海;朱忠榮;;水電工程突發(fā)事件實(shí)時(shí)響應(yīng)決策云模型研究[J];中國(guó)安全科學(xué)學(xué)報(bào);2016年09期

4 劉芳;彭智勇;高興;;云計(jì)算環(huán)境下的端口資源均衡調(diào)度模型仿真[J];計(jì)算機(jī)仿真;2016年08期

5 呂能超;李澤;羅齊漢;黃珍;吳超仲;;交通事故現(xiàn)場(chǎng)隔離路錐車(chē)的總體設(shè)計(jì)與研究[J];中國(guó)工程機(jī)械學(xué)報(bào);2016年03期

6 徐小平;;基于混合優(yōu)化算法的云計(jì)算資源分配問(wèn)題探討[J];信息與電腦(理論版);2016年07期

7 翟治年;盧亞輝;周武杰;陳志豪;王中鵬;林江;;工作流可滿足性(≠)計(jì)數(shù)的固定參數(shù)線性算法[J];計(jì)算機(jī)學(xué)報(bào);2016年11期

8 江務(wù)學(xué);魏文國(guó);丁度坤;李菲;;異構(gòu)云環(huán)境下基于分簇的云資源感知任務(wù)調(diào)度方案[J];計(jì)算機(jī)應(yīng)用研究;2016年11期

9 王U，

本文編號(hào)：2071991