Inthispaper,thestoragecapacityofcommunicationamongcoresandprocessorsistakenintoaccountandamaximumD-value-firstalgorithmisproposed.Byimprovingthehardwareparallelisminthetaskexecutionprocess,themaximumstoragerequirementsforcommunicationareminimized.Experimentalresultswithvariousdirectedacyclicgraphmodelsshowedthatcomparedwiththeearliest-task-firstalgorithm,thestoragerequirementsforcommunicationwerereducedby22.46%,onaverage,whiletheaverageofmakespanonlyincreasedby0.82%,.
