一種基于模糊聚類的網(wǎng)格dag任務(wù)圖調(diào)度算法

一種基于模糊聚類的網(wǎng)格dag任務(wù)圖調(diào)度算法

ID:33325972

大?。?77.44 KB

頁(yè)數(shù):12頁(yè)

時(shí)間:2019-02-24

一種基于模糊聚類的網(wǎng)格dag任務(wù)圖調(diào)度算法_第1頁(yè)
一種基于模糊聚類的網(wǎng)格dag任務(wù)圖調(diào)度算法_第2頁(yè)
一種基于模糊聚類的網(wǎng)格dag任務(wù)圖調(diào)度算法_第3頁(yè)
一種基于模糊聚類的網(wǎng)格dag任務(wù)圖調(diào)度算法_第4頁(yè)
一種基于模糊聚類的網(wǎng)格dag任務(wù)圖調(diào)度算法_第5頁(yè)
資源描述:

《一種基于模糊聚類的網(wǎng)格dag任務(wù)圖調(diào)度算法》由會(huì)員上傳分享,免費(fèi)在線閱讀,更多相關(guān)內(nèi)容在行業(yè)資料-天天文庫(kù)

1、ISSN1000-9825,CODENRUXUEWE-mail:jos@iscas.ac.cnJournalofSoftware,Vol.17,No.11,November2006,pp.2277?2288http://www.jos.org.cnDOI:10.1360/jos172277Tel/Fax:+86-10-62562563?2006byJournalofSoftware.Allrightsreserved.?一種基于模糊聚類的網(wǎng)格DAG任務(wù)圖調(diào)度算法1,2+1,21,21,2杜曉麗,蔣昌俊,徐國(guó)榮,丁志軍1(同濟(jì)大學(xué)電子與信息工程

2、學(xué)院,上海201804)2(國(guó)家高性能計(jì)算機(jī)工程技術(shù)研究中心同濟(jì)分中心,上海201804)AGridDAGSchedulingAlgorithmBasedonFuzzyClustering1,2+1,21,21,2DUXiao-Li,JIANGChang-Jun,XUGuo-Rong,DINGZhi-Jun1(ElectronicsandInformationEngineeringSchool,TongjiUniversity,Shanghai201804,China)2(TonjiBranch,NationalEngineeringandT

3、echnologyCenterofHighPerformanceComputer,Shanghai201804,China)+Correspondingauthor:Phn:+86-21-69589864,E-mail:du_xiaoli@163.com,http://www.#edu.cnDuXL,JiangCJ,XuGR,DingZJ.AgridDAGschedulingalgorithmbasedonfuzzyclustering.JournalofSoftware,2006,17(11):2277?2288.http://

4、www.jos.org.cn/1000-9825/17/2277.htmAbstract:Focusingontheproblemoftaskschedulingunderlarge-scale,heterogeneousanddynamicenvironmentsingridcomputing,aheuristicalgorithmbasedonfuzzyclusteringispresented.Manypreviousschedulingalgorithmsneedtosearchandcompareeveryprocessingcel

5、linthetargetsysteminordertochooseasuitableoneforatask.ThoughthosemethodscangetanapprovingMake-span,undoubtedly,itwouldincreasetheentireruntime.Agroupoffeatures,whichdescribethesyntheticperformanceofprocessingcellsinthetargetsystem,aredefinedinthispaper.Withthesedefinedfeatu

6、res,thetargetsystem,alsocalledprocessingcellnetwork,ispretreatedbyfuzzyclusteringmethodinordertorealizethereasonableclusteringofprocessornetwork.Intheschedulingstage,theclusterwithbettersyntheticperformancewillbechosenfirst.Thereisnoneedtosearcheveryprocessingcellinthetarge

7、tsystemateveryschedulingstep.Therefore,itlargelyreducesthecostonchoosingwhichprocessingcelltoexecutethecurrenttask.Thedesignofthereadytask’spriorityconsidersnotonlytheinfluencethatcomesfromtheexecutingofnodesoncriticalpath,butalsotheinfluenceinducedbyheterogeneousresource,o

8、nwhichthetaskwillbescheduled.Inthelastpart,thealgorithm’sperformanceisanalyzedandc

當(dāng)前文檔最多預(yù)覽五頁(yè),下載文檔查看全文

此文檔下載收益歸作者所有

當(dāng)前文檔最多預(yù)覽五頁(yè),下載文檔查看全文
溫馨提示:
1. 部分包含數(shù)學(xué)公式或PPT動(dòng)畫的文件,查看預(yù)覽時(shí)可能會(huì)顯示錯(cuò)亂或異常,文件下載后無(wú)此問(wèn)題,請(qǐng)放心下載。
2. 本文檔由用戶上傳,版權(quán)歸屬用戶,天天文庫(kù)負(fù)責(zé)整理代發(fā)布。如果您對(duì)本文檔版權(quán)有爭(zhēng)議請(qǐng)及時(shí)聯(lián)系客服。
3. 下載前請(qǐng)仔細(xì)閱讀文檔內(nèi)容,確認(rèn)文檔內(nèi)容符合您的需求后進(jìn)行下載,若出現(xiàn)內(nèi)容與標(biāo)題不符可向本站投訴處理。
4. 下載文檔時(shí)可能由于網(wǎng)絡(luò)波動(dòng)等原因無(wú)法下載或下載錯(cuò)誤,付費(fèi)完成后未能成功下載的用戶請(qǐng)聯(lián)系客服處理。