基于Java RMI的動(dòng)態(tài)服務(wù)分配策略的研究.pdf

1、中國(guó)海洋大學(xué)碩士學(xué)位論文基于JavaRMI的動(dòng)態(tài)服務(wù)分配策略的研究姓名：耿蓋申請(qǐng)學(xué)位級(jí)別：碩士專業(yè)：計(jì)算機(jī)軟件與理論指導(dǎo)教師：張春海20090601ResearchofDynamicServiceAllocationStrategyBasedonJavaRMIAbstractJavaisallexcellentprogramdevelopmentlanguageDuetotheadvantageofCROSS—platform，itha

2、sbeenwidelyusedinthedevelopmentofdistributednetworkapplicationsRMItechnologyisasimple，andthemainwaytodevelopnetworksdistributedapplicationsystem，whichisalsoincreasinglyusednOWAlongwiththecomplexityofclientrequests，itisdi

3、fficultforasimpleservertomeettheneedsofthecurrentusersSodusterservicebasedonthiskindofapplicationsystemswasproducedThekeyproblemofclusterserviceishowtoeffectivelyusethesystemresourcesProcessmigrationmechanismisaneffectiv

4、ewayforclustersystemstoachieveloadbalancingalgorithmandloadbalancingalgorithmisanimportanttoolofachievingsystemresourcesefficientusesTheRMItechnologyisdiscussedandtheRMIframework，plusthecolesystemisintroducedAndthen，reso

5、urcesharingandschedulingalgorithmofdusterssystemsareintroducedTodiscusstheimplementationofdynamicservicesbalanceschedulingmodel，weusedtheweakconsistencyofinformationtodescribethepartialityandinaccuracyofthenodeloadinform

6、ationindustersystemsWeakconsistencyofnodeinformationisthecoreissuewheneffectiveschedulingofdynamicloadbalancingalgorithmisneededAccordingtothis，aksubsetrandomalgorithmtheweakconsistencyofnodeinformationispresentedinthist

7、hesisBaseontheksubsetrandomalgorithmwhichhasthepropertyofnodeinformationweakconsistency，anodeinformationliststructurewithdouble—InfosmechanismispresentedThroughacertainreplacementalgorithm，nodeInfosrespectivelysavetheinf

8、ormationofthetwoInfosineachnodetobethemaximumsetofoverloadingnodeinthenumberofkandtheminimumsetofundeflodingnodeinthenumberkinthecurrentdustersystemInthiscase，whenprocessingthebalancingschedulingofdynamicservices，whether