1、武漢理工大學碩士學位論文網格環(huán)境下MinMin調度算法改進與實現(xiàn)姓名：張瀾申請學位級別：碩士專業(yè)：通信與信息系統(tǒng)指導教師：劉泉20080401武漢理工大學碩士學位論文AbstractTherapiddevelopingnetworkmakesitpossibletointegratethegeographicallydistributedandheterogeneouscomputingresourcesintotremendousGr

2、idSothetasksschedulinginGridhasbecomeanimportantproblemAndtheresearchofschedulealgorithms，whichdirectlyrelatedtothespeedandqualityplaysadecisiveroleintheresearchofcomputingGridMinMinalgorithm，aclassicsalgorithminheuristi

3、calgorithm，whichalwayscompletestheshortesttotalcompletiontimetaskfirst，hasthecharacteristicofsimpleandshortestcompletiontimeSoitcatchesalotofcloseattentionsinthefieldofstudyingfortasksschedulingalgorithmsinGridButmostoft

4、heexistingGridSystemsaredevelopedforthepurposeofleamingresearch，thesesystemsemphasizetheshareandcooperateworkwithresources，thepriceofresourceiSnotconsidered’MostoftheresourcesarenotvolunteerintheactualapplicationInresult

5、oftheproblemmentionedjustnowtheMinMinalgorithmalreadyCannotsatisfytheneedforschedulingSoweshouldconsidernewalgorithmsthattakethetasks’demandsforpriceofresourcesinaccountBasedonthis，thispaperfocusesonthefollowingresearche

6、s：Afterweknowtheresearchstatusfortaskschedulingobjects，algorithms，andsimulatorsoftaskschedulingalgorithms，thenmodifytheMin—MinalgorithmFirstlyweExpandstheconceptofshortestfinishtimeinMinMinalgorithms，andmakesthejobfinish

7、attheleastcost，whichnotonlyincludecompletiontimebutalsotheexpensesofCPUSecondlywedefineperformancepriceratiofunction，thenwecanchange‘‘distributeeveryjobstothecomputerswhichfinishthemintheshortesttime’’inMin—Minalgorithmt

8、o“distributeeveryjobstothecomputerswhichfinishtheminthebestperformancepriceratio”WesimulateMinMinalgorithm、QosGuidedMinMinalgorithmandthetwomodifiedalgorithmsinprogramAnalyzesandcomparestheabovefouralgorithmsfrommufti—as