摘要
Inthispaper,thestoragecapacityofcommunicationamongcoresandprocessorsistakenintoaccountandamaximumD-value-firstalgorithmisproposed.Byimprovingthehardwareparallelisminthetaskexecutionprocess,themaximumstoragerequirementsforcommunicationareminimized.Experimentalresultswithvariousdirectedacyclicgraphmodelsshowedthatcomparedwiththeearliest-task-firstalgorithm,thestoragerequirementsforcommunicationwerereducedby22.46%,onaverage,whiletheaverageofmakespanonlyincreasedby0.82%,.
出版日期
2015年04月14日(中国期刊网平台首次上网日期,不代表论文的发表时间)