individualubuntu12.04

ubuntu12.04  时间:2021-03-29  阅读:()
AGPUHeterogeneousClusterSchedulingModelforPreventingTemperatureHeatIslandYun-PengCAO1,2,aandHai-FengWANG1,21SchoolofInformationScienceandEngineering,LinyiUniversity,LinyiShandong,China2760052InstituteofLinyiUniversityofShandongProvincialKeyLaboratoryofNetworkbasedIntelligentComputing,LinyiShandong,China276005Abstract.
WiththedevelopmentofGPUgeneral-purposecomputing,GPUheterogeneousclusterhasbecomeawidelyusedparalleldataprocessingsolutioninmoderndatacenter.
Temperaturemanagementandcontrollinghasbecomeanewresearchhotspotinbigdatacontinuouscomputing.
Temperatureheatislandinclusterhasimportantinfluenceoncomputingreliabilityandenergyefficiency.
InordertopreventtheoccurrenceofGPUclustertemperatureheatisland,abigdatataskschedulingmodelforpreventingtemperatureheatislandwasproposed.
Inthismodel,temperature,reliabilityandcomputingperformancearetakenintoaccounttoreducenodeperformancedifferenceandimprovethroughputperunittimeincluster.
Temperatureheatislandscausedbyslownodesarepreventedbyoptimizingscheduling.
Theexperimentalresultsshowthattheproposedschemecancontrolnodetemperatureandpreventtheoccurrenceoftemperatureheatislandunderthepremiseofguaranteeingcomputingperformanceandreliability.
1IntroductionAfterGPU(GraphicProcessingUnit)wasproposedbyNVIDIAcompanyanditsbirth,ithasbeendevelopingrapidlybeyondthespeedofMoore'sLaw,itscomputingcapabilityhasbeenrisingcontinuously.
AtSIGGRAPHconferencein2003,GPGPU(General-purposecomputingongraphicsprocessingunits)wasintroduced.
GPUsgraduallyshiftedfromdedicatedparallelprocessorsconsistingoffixedfunctionalunitstoarchitectureswithprimarygeneral-purposecomputingresourcesandsecondaryfixedfunctionalunits.
GPUiscomposedofalargenumberofparallelprocessingunitsandmemorycontrolunits,itsprocessingpowerandmemorybandwidthhasobviousadvantagescomparedwithCPU.
However,GPUcannotcompletelyreplaceCPU,alotofoperatingsystems,softwaresandcodescannotrunonGPU.
GPUgeneral-purposecomputingusuallyusesCPU/GPUheterogeneousmode,CPUexecutescomplexlogicandtransactionsandothertasksunsuitableforparallelprocessing,GPUimplementscompute-intensivelarge-scaledataparallelcomputingtasks.
Withitshighperformance,lowenergyconsumptionandotheradvantages,CPU/GPUhybridarchitecturehasbeenwidelyusedingraphicsandimageprocessing,videoencodinganddecoding,matrixcomputingandsimulation,medicalindustryapplication,lifescienceresearch,high-performancecomputing,signalprocessing,databaseanddataminingandmanyotherfields.
Withtechnologyadvancesandbreakthroughs,GPUisplayinganimportantrolecurrentlyinaCorrespondingauthor:lyucyp@163.
comDOI:10.
1051/,711070011ITMWebofConferencesitmconf/201IST201707003(2017)3TheAuthors,publishedbyEDPSciences.
ThisisanopenaccessarticledistributedunderthetermsoftheCreativeCommonsAttributionLicense4.
0(http://creativecommons.
org/licenses/by/4.
0/).
large-scaleparallelcomputing.
Withtherapidincreaseofproblemscalesofvariousapplicationfields,singleGPU'scomputingcapabilityhasbecomeinsufficient,somulti-GPUandGPUclustergeneral-purposecomputinghasbecomeanewresearchhotspot.
Asanimportantapproachofhigh-performancecomputing,GPUclustershavesuchadvantagesaslowcost,highperformanceandlowenergyconsumptionforcompute-intensiveapplications.
InconstructingGPUclusters,CPUandGPUcooperatewitheachother,participateindataprocessing,andformGPUheterogeneouscluster.
GPUheterogeneousclustercanmakefulluseofhardwareresources,improveprocessingspeedandthroughput.
Ithasbecomeanimportantmeansofbigdataprocessing.
Processingbigdata,especiallyreal-timebigdatastreamneedscluster'scontinuouscomputingandprocessing,anditwillinevitablyrequirecomputer'shigh-loadandcontinuouswork,sothetemperatureofCPU,GPUandothercomponentswillcontinuetorise.
Ononehand,computingenergyconsumptionincreases,ontheotherhand,fansandairconditionersareneededforreducingtemperature,therebyincreasingcoolingenergyconsumption.
Whentemperaturerisestoacertainextent,thetemperatureofoneorsomenodeswillbetoohigh.
Thenodewithtoohightemperatureisknownastemperatureheatisland.
Theoccurrenceoftemperatureheatislandwillreducecomputingreliability,rangingfromresulterrortosystem'sparalysisandhalt.
Onceerrorsoccurincomputingresults,recomputingisneeded,resultingintimeandresourcewaste,increasingprocessingcosts.
Inthiscase,wemustreasonablydesignclustertaskschedulingschemetominimizeclusteroverallruntime,controltemperaturetoappropriaterange,preventindividualnodefromrunningsolongthatleadingtooverhightemperatureandformingtemperatureheatisland,toensurereliablecomputingresults,reduceenergyconsumptionasmuchaspossibleandachievegreencomputing.
ThispaperstudiedthetaskschedulingonGPUheterogeneouscluster,andproposedataskschedulingschemeofpreventingtemperatureheatisland.
Thescheme'smainfeaturesandadvantagesare:(1)strongrobustness.
ThestructureofGPUheterogeneousclusteriscomplex,eachnode'sconfigurationisdifferent,andthenodeisoftenchangedandadjusted.
Thistaskschedulingschemecansenseandadapttothiscomplicatedandchangeablesituation.
(2)highprocessingperformance.
Ataskisdividedintosomesub-tasks,andthentheyarescheduledtomultiplenodesforparallelprocessing.
Themainproblemisdeterminingthemodeofdivisionandtreatment.
Theconceptofcomputingscalethresholdandasymmetricpartitioningmethodareproposedinordertoadapttothediversityandheterogeneityofnodeconfiguration,improvetheparallelismandshortenthewholerunningtimeofcluster.
Thisnotonlypreventstemperatureheatislandfromoccurringbecauseofindividualnode'soverlongrunningtime,butalsoimprovesprocessingperformance.
2RelatedresearchesWiththewideapplicationofGPUheterogeneouscluster,itstaskscheduling,temperatureandheatmanagementandenergyconsumptionoptimizationhasbecomearesearchhotspot.
Manyscholarshaveputforwardvariousschedulingschemesandmethodstosolvetheproblemofenergyconsumptionandreliability.
Thishasplayedapositiveroleinreducingclusterenergyconsumptionandensuringthereliabilityofcomputingresults.
In[1]adynamictaskpartitionmethodwasproposed.
Itdividesparallelcomputingtasksaccordingtoexecutionspeedtoachievebestoverallsystemperformance.
In[2]amulti-GPUself-adaptiveloadbalancingmethodwasproposed.
GPUcanself-adaptivelyselecttaskstoexecuteaccordingtolocalfree-busystatebyestablishingtaskqueuemodelbetweenCPUandGPU.
In[3]aloadbalancingstrategythatcombinestaskpartitioningandstealingwasproposed.
IttakesintoaccounttaskaffinityandprocessordiversitytodirecttaskschedulingbetweenCPUandGPU.
In[4]feedbackcontrollingwascombinedwithmixedintegerprogramming,andtheenergyconsumptioncontrollingmodelofWebserverclusterwasconstructed.
In[5]modelpredictivecontrollingstrategywasintroducedfromglobalperspective.
Theenergyconsumptionstateischangedbyadjustingcomputingfrequencyandchangingactivestreammultiprocessor.
ThefeedbackcontrollingandrollingoptimizationmechanismDOI:10.
1051/,711070011ITMWebofConferencesitmconf/201IST201707003(2017)32areusedtopredictfuturecontrollingtoreduceredundantenergyconsumption.
In[6]theenergylossatidlestateisreducedbyaspecificnodeselectionstrategy.
CPUresourceutilizationisimprovedbytasktypedivision,combinationdistributionandDVFS.
Theaboveresearchesmainlyfocusonclustertaskscheduling,changingCPU/GPUcorevoltage,frequency,hardware-basedstatistics,andsoontodesignclusterenergyconsumptionmodel,studytaskschedulingalgorithmandachieveenergy-savingpurpose,butdonotconsidertemperaturemuch.
InGPUclustercomputing,especiallycontinuouscomputing,temperaturehasobviousrelationshipwithenergyconsumptionandreliability.
Whentemperatureistoohigh,energyconsumptionincreases,reliabilitydeclines,andtheprobabilityofresulterrorincreases.
Therefore,temperatureshouldbecontrolledinareasonablerangetominimizeenergyconsumptionunderthepremiseofensuringreliability.
Thetaskschedulingschemeproposedinthispaperdistributestasksreasonablyamongcomputingnodestopreventtheoccurrenceoftemperatureheatislandandensurethecorrectnessofcomputingresults.
3TaskschedulingmodelInGPUheterogeneouscluster,CPUandGPUallparticipateindataprocessing.
Theyareregardedascomputingunitsuniformlywhendistributingtasks.
Thecomputersinclusterarecontrollingnodesandcomputingnodes.
Thecontrollingnodecanbesimultaneouslyusedasacomputingnode.
Alltasksformaqueue.
Eachtaskisdecomposedintoseveralsub-taskstoformsub-taskqueue.
Thecontrollingnoderunsthemainschedulingprocess,Scheduler.
Eachcomputingnodehasaschedulingagentprocess,Agent.
SchedulerandAgentcooperatetofinishtaskscheduling.
ThearchitectureisshowninFigure1.
Figure1.
Taskschedulingarchitecture4TaskschedulingalgorithmandstrategyScheduleralgorithmisasfollows:Algorithm1ControllingnodeSchedulerschedulingalgorithm1.
Obtainataskfromtaskqueue2.
Obtainthehardwareconfigurationandrunningstatusinformationofeachcomputingnode3.
Determinethenumberofcomputingnodesparticipatinginparallelprocessing4.
Dividetaskintosub-taskqueueandassignsub-taskstocorrespondingcomputingnode5.
Waitfortheresultsofeachsub-task6.
Modifythestatusofcorrespondingsub-tasksandtheassociatedtasksinqueue.
7.
Reschedulesub-tasksthattimedoutorrequestedtotransfer,modifycorrespondingstatus8.
Goto1Foreachcomputingnode,thesub-tasksthatcontrollingnodedispatchestoitformaqueue.
TheschedulingalgorithmofAgentoncomputingnodeisasfollows:ControllingnodeSchedulerComputingnodeAgent…Sub-taskqueueTaskqueueSub-taskqueueComputingnodeAgentSub-taskqueueComputingnodeAgentSub-taskqueueDOI:10.
1051/,711070011ITMWebofConferencesitmconf/201IST201707003(2017)33Algorithm2ComputingnodeAgentschedulingalgorithm1.
Obtainasub-taskfromthesub-taskqueueoflocalnode2.
Assignthesub-tasktolocalnodeforprocessing3.
Waitfortheresulttobereturnedfromlocalnode4.
Reportresultstocontrollingnode(completion,timeout,orrequestingtransfer)5.
Goto14.
1AcquiringhardwareconfigurationinformationSchedulerfirstobtainsthehardwareconfigurationinformationofeachnodeincluster.
Theinformationcanbemanuallycreatedinadvanceandsavedinfile.
Whenclusterisstarted,Schedulerloadsclusterhardwareconfigurationinformationfile.
Itpollseachcomputingnode,AgentrespondstothepollandreportshardwarechangeinformationtoScheduler.
Or,AgentreportshardwarechangeinformationtoScheduleractively.
ThenSchedulermodifiescluster'shardwareconfigurationinformation.
Inthisway,controllingnodecangraspthelatestchangesinclusterhardwareconfiguration,avoidingunnecessaryacquisitionandreportingofhardwareconfigurationinformation,thusadaptingtoactualhardwareconfigurationchangesandreducingnetworkcommunicationoverhead.
4.
2SchedulingstrategyComputingscaleisusedtomeasuretasksize.
Computingscaleisthenumberofinstructionstobeexecutedortheamountofdatatobeprocessedtocompletethetask.
Ataskcontainsparallelizableandnon-parallelizablepart.
SupposethecomputingscaleofataskisT,TTs+Tp,Tsisthecomputingscaleofnon-parallelizablepart,andTpisthecomputingscaleofparallelizablepart.
LetTtbethecriticalvalueofthecomputingscaleofparallelizablepart,thentaskschedulingstrategyisasfollows:(1)0≤Tp(2)Tp≥Tt,thetaskhasparallelizablepartanditreachesacertainscale.
Theparallelizablepartoftaskisdividedintosmallersub-tasks,manycomputingunitswithstrongestcomputingcapabilityareselectedfromidleprocessingunitstoprocessthem.
4.
2.
1DeterminingTtandthenumberofcomputingunitsTheprocessingcapabilityisassumedtobeCswhentaskisprocessedseparatelybyasinglecomputingunit.
Withoutlossofgenerality,assumingthatwhenparallelprocessing,thenumberofcomputingunitsparticipatinginprocessingisn,theirprocessingcapabilityisallCp.
Inordertoobtainbetterperformance,then:ttspTTQCnC≥+(1)WhereQistheadditionaltimeoverheadrequiredforparallelprocessing,includingparallelcomputingpreparation,resultmerging,synchronization,networktransmission,andsoon.
Atthesametimeinordertoensurehighprocessingefficiency,then:tpTQnC≥(2)Solvingtheinequalitygroupconsistingofabovetwoinequalitieswillget:DOI:10.
1051/,711070011ITMWebofConferencesitmconf/201IST201707003(2017)34max{,}pstppsnCCQTnCQnCC≥(3)ThevalueofQcanbedeterminedexperimentallyorbyaccumulatinghistoricalempiricaldata.
Cpcanbetakenastheaverageofthecurrentcomputingcapabilityofallcomputingunits,andCsistheaverageofthecurrentcomputingcapabilityofallCPUsincluster.
Letmax{,}psmppsmCCQTmCQmCC=,m=1,2,…,Nidle,Nidleisthenumberofallidlecomputingunitsincurrentcluster.
Inordertoincreasetheparallelizationdegreeoftaskprocessing,changefromNidleindescendingmanneruntilthefirstnumberkwhichletsTp≥Tkisfound,thenkisthenumberofunitsinvolvedinparallelprocessing,thealgorithmtodetermineitisasfollows:Algorithm3Determiningthenumberofparallelprocessingunits1.
getNidle2.
i←Nidlek←13.
ifi≤1goto74.
Ti←max{,}psppsiCCQiCQiCC5.
ifTp≥Tithenk←igoto76.
i←i-1goto37.
endIfk<2orqualifiedkvaluecannotbefound,thetaskishandledbyoneCPUandnotscheduledinparallelmanner.
4.
2.
2PartitioningparallelpartAssumingthatthecurrentcomputingcapabilityofkcomputingunitsinvolvedinparallelcomputingisC1,C2,….
,Ck,thescaleofsub-tasksassignedtoeachprocessingunitisT1,T2,…,Tk,thenthetimetocompletethetaskis:1212max{kkTTTCCCt=(4)WhereT1+T2+…+Tk=Tp.
ItcanbeproventhatwhenipCTiCT=(i=1,2,…,k),tisminimumandpTCt=,whereC=C1+C2+…+Ck.
Therefore,theproportionofallocatedtasktototaltaskscalebeingequaltotheratioofthecurrentcomputingcapabilityofthecomputingunittothesumofthecurrentcomputingcapabilitiesofallcomputingunitsparticipatinginparallelprocessing,caneffectivelyreduceoverallprocessingtime,balanceload,andavoidthecasethatsomeunitsareidleandsomeunitsrunforlongtimeandcausetemperatureheatislandstooccur.
4.
3EstimatingcurrentcomputingcapabilityCurrentcomputingcapabilityisrelatedtoitsownhardwareconfigurationandhardware'scurrentstateofutilization.
Forcomputingunitswithsameconfiguration,thebusieroneshavestrongercurrentcomputingcapabilitythantheidleones.
Byreferencing[7]andimproving,thecurrentcomputingcapabilityisestimated.
ForanycomputingnodeNi,consideritsfivehardwareconfigurationparameters:CPUfrequencyrate_cpui,memorysizememi,cachesizecachei,GPUfrequencyrate_gpui,GPUmemorysizemem_gpuiandfivestateparameters:CPUutilizationutlz_cpui,memoryDOI:10.
1051/,711070011ITMWebofConferencesitmconf/201IST201707003(2017)35utilizationutlz_memi,cacheutilizationutlz_cachei,GPUutilizationutlz_gpui,GPUmemoryutilizationutlz_gpumemi.
ThecurrentcomputingcapabilityofnodeNiis:1122334455iCkQkQkQkQkQ5)k1,k2,k3,k4andk5representsthelevelproportionweightofinfluenceonnodecurrentcomputingcapabilityofCPU,memory,Cache,GPUandGPUmemoryrespectively.
Theirsumis1.
Q1-Q5respectivelydenotesCPUcurrentcapability,memorycurrentcapability,cachecurrentcapability,GPUcurrentcapabilityandGPUmemorycurrentcapabilityafternormalizationofnodeNi.
Q1iscalculatedas:11_(1_)(_(1_))iiNjjjratecpuutlzcpuQratecpuutlzcpu=*=*∑(6)TheformulasforQ2-Q5aresimilar.
Foracertainnode,Ci,Q1,Q2,Q3,Q4andQ5canbedeterminedexperimentally,andthentheapproximatevalueofk1,k2,k3,k4andk5canbedeterminedbyregressionmethod.
5ExperimentandanalysisTheschemeproposedinthispaperwasverifiedexperimentally.
Twoexperimentswereconductedonsamecluster.
Theexperimentprogramis:Somerelativesoftwares(suchasCPU-Z,HWMonitor,CoreTemp,etc.
)wereusedtomeasuretemperaturesofCPUandGPUofeachcomputingunitatdifferenttimeduringcluster'srunning,andthetemperaturecurveofeachcomputingunitwasdrawnaccordingtothem.
SevencomputerswereusedtoconstituteGPUheterogeneouscluster.
Fiveofthemhavetheconfiguration:modelisLenovoErazerX700,memoryis16G,CPUisInteli7-3930k,GPUisNVIDIAGTX660i,operatingsystemisUbuntu12.
04LTS,clusterenvironmentishadoop2.
2.
0,JavaversionisJDK1.
7.
Theothertwohavelowerconfiguration:CPUisIntelPentium(R)Dual-CoreE53002.
60GHz,memoryis4G,GPUisNVIDIAGeForce9400GT,operatingsystemisWindows764-bitUltimate.
TheexperimentaldataistaxiGPSdataanddatageneratedcontinuouslybyloadrunner.
5.
1ConventionalschedulingmethodFirstly,conventionalschedulingmethodwasused.
Onlytaskbalancedschedulingwasconsidered,regardlessoftemperaturechanges.
Every1minutetemperaturewassampledonce.
TheresultisshowninFigure2,whereC1,C2,.
.
.
,C7iseachcomputingnode.
0123456789101135363738394041424344454647484950Temprature(oC)SamplingIntervalC1C2C3C4C5C6C7Figure2.
TemperaturechangeinconventionalschedulingmethodDOI:10.
1051/,711070011ITMWebofConferencesitmconf/201IST201707003(2017)36TheclusterprocessestaxiGPSdatafirstly.
Thedataamountislarger,butbecauseitishistoricaldata,itdoesnottakelongtimetoprocessit.
Temperatureandpoweraremeasuredwithmeasuringinstruments,temperaturesofCPU,GPUandsoonaremonitoredwithsoftwares.
ItisfoundthatthetemperatureandpowerofCPUandGPUareincreasingduringprocessing,butthetaskhasbeenfinishedbeforetemperaturerisestothesetthreshold,andtheproblemoftemperatureheatislandandreliabilitydoesnotoccur.
Thensimulationdatathatloadrunnersoftwarecontinuestogenerateisprocessed.
Atthistime,CPUandGPUtemperaturecontinuestorise,energyconsumptioncontinuestoincrease.
Afteracertaintime,temperatureexceedsthethresholdandtemperatureheatislandisformed,computingresulterroroccurs.
Thedifferencebetweenthelowestandhighesttemperaturesofvariouscomputingnodesisabout12°C.
5.
2SchedulingschemeproposedinthispaperInthesecondexperiment,thesameexperimentalenvironmentanddatawereused,buttheschedulingschemepreventingtemperatureheatislandproposedinthispaperwasused.
Duringprocessingtask,temperatureiscollected.
TheresultisshowninFigure3.
0123456789101135363738394041424344454647484950Temprature(oC)SamplingIntervalC1C2C3C4C5C6C7Figure3.
TemperaturechangeinschedulingmethodpreventingtemperatureheatislandTheresultofprocessingtaxiGPSdataissimilartotheprevious,buttheresultshowsthatthedifferenceoftemperatureandenergyconsumptionofeachnodetendstodecrease.
Thisshowsthatthisschemeismoretime-balancedintaskschedulingtopreventtemperatureheatislandfromoccurringandguaranteeoverallstability.
Datastreamsgeneratedcontinuouslybyprogramareprocessedbycluster.
Itwasfoundthat,althoughthetemperatureofCPUandGPUincreased,thetemperatureandpowerdidnotincreasecontinuouslywhentemperaturerisednearlytothresholdvalue,andnotemperatureheatislandandcomputingerroroccurred.
Whendatasupplyamountwasincreased,thephenomenonthattemperatureandpowerincreasedidnotoccur.
Thisshowsthattheschedulingschemetrystobalancerunningtime,inhibittheincreasingoftemperatureandenergyconsumptiontopreventtemperatureheatislandfromoccurring.
Thedifferencebetweenthelowestandhighesttemperaturesamongvariouscomputingnodesisabout9°C.
Analyzingaboveexperimentalresults,itisshownthat,ifconventionalmethodisadopted,thetemperatureofeachcomputingnodeincreasescontinuouslywiththeprocessingoftask,thetemperatureofsomenodesexceedsthreshold,andthetemperaturefluctuatesgreatly.
However,whentheschedulingmethodproposedinthispaperisused,temperatureisalsorising,butbecausetaskdivisionmakesnoderunningtimebeconsistentasfaraspossible,therangeoftemperaturefluctuationissmall,theoveralltemperaturechangeisrelativelycalm,thusitisavoidedthatthetemperatureheatislandoccurs.
DOI:10.
1051/,711070011ITMWebofConferencesitmconf/201IST201707003(2017)37ConclusionTheGPUheterogeneousclustertaskschedulingschemeproposedinthispaperavoidslongrunningtimeofindividualnodesasfaraspossible,preventstemperatureheatislandfromoccurring,guaranteescomputingreliability,controlsenergyconsumptioninacertainrange,andalsoconsiderstheconstraintsamongtemperature,reliability,performanceandenergyconsumption,minimizesenergyconsumptionorimprovesprocessingspeedasfaraspossibleunderthepremiseofensuringreliability.
ThemainworkofnextstepistostudyhowGPUheterogeneousclusterperceivesandpredictsclustertemperatureanditsvariation,andapplyittoclustertaskscheduling.
AcknowledgmentsThisresearchprojectissupportedbythejointspecialprojectofShandongProvincialNaturalScienceFoundation(ProjectNo.
:ZR2015FL014)andthespecialprojectofShandongProvincialIndependentInnovationandAchievementTransformation(ProjectNo.
:2014ZZCX02702).
References1.
C.
Q.
Yang,F.
Wang,Y.
F.
Du,etal.
AdaptiveoptimizationforpetascaleheterogeneousCPU/GPUcomputing.
The2010IEEEInt'lConf.
onClusterComputing.
(2010)2.
L.
Chen,O.
Villa,S.
Krishnamoorthy,G.
R.
Gao.
Dynamicloadbalancingonsingle-andmulti-GPUsystems.
The2010IEEEInt'lSymp.
onParallel&DistributedProcessing(IPDPS).
(2010)3.
E.
Hermann,B.
Raffin,F.
Faure,T.
Gautier,J.
Allard.
Multi-GPUandmulti-CPUparallelizationforinteractivephysicssimulations.
The16thInt'lEuro-ParConf.
onParallelProcessing:PartII(Euro-Par2010).
Berlin,Heidelberg:Springer-Verlag.
(2010)4.
L.
Bertini,C.
B.
Julius,D.
Mosse.
Poweroptimizationfordynamicconfigurationinheterogeneouswebserverclusters.
JournalofSystemsandSoftware,83(4):585-598.
(2010)5.
H.
F.
Wang,Y.
P.
Cao.
GPUPowerConsumptionOptimizationControlModelofGPUClusters.
ActaElectronicaSinica,43(10):1904-1910.
(2015)6.
H.
P.
Huo,X.
M.
Hu,C.
C.
Sheng,B.
F.
Wu.
Anenergyefficienttaskschedulingschemefornode-layerheterogeneousGPUclusters.
ComputerApplicationsandSoftware,30(3):283-286.
(2013)7.
H.
Liu,J.
G.
Wang,Z.
Z.
Ge,etal.
Self-learningLoadBalancingSchedulingAlgorithmforGPUHeterogeneousCluster.
JournalofXi'anShiyouUniversity,30(3):105-111.
(2015)DOI:10.
1051/,711070011ITMWebofConferencesitmconf/201IST201707003(2017)38

ReliableSite:美国服务器租用,洛杉矶/纽约/迈阿密等机房;E3-1240V6/64GB/1TSSD,$95/月

reliablesite怎么样?reliablesite是一家于2006年成立的老牌美国主机商,主要提供独服,数据中心有迈阿密、纽约、洛杉矶等,均免费提供20Gbps DDoS防护,150TB月流量,1Gbps带宽。月付19美金可升级为10Gbps带宽。洛杉矶/纽约/迈阿密等机房,E3-1240V6/64GB内存/1TB SSD硬盘/DDOS/150TB流量/1Gbps带宽/DDOS,$95/月,...

盘点AoYoZhuJi傲游主机商8个数据中心常见方案及八折优惠

傲游主机商我们可能很多人并不陌生,实际上这个商家早年也就是个人主机商,传说是有几个个人投资创办的,不过能坚持到现在也算不错,毕竟有早年的用户积累正常情况上还是能延续的。如果是新服务商这几年确实不是特别容易,问到几个老牌的个人服务商很多都是早年的用户积累客户群。傲游主机目前有提供XEN和KVM架构的云服务器,不少还是亚洲CN2优化节点,目前数据中心包括中国香港、韩国、德国、荷兰和美国等多个地区的CN...

rfchost:洛杉矶vps/双向CN2 GIA,1核/1G/10G SSD/500G流量/100Mbps/季付$23.9

rfchost怎么样?rfchost是一家开办了近六年的国人主机商,一般能挺过三年的国人商家,还是值得入手的,商家主要销售VPS,机房有美国洛杉矶/堪萨斯、中国香港,三年前本站分享过他家堪萨斯机房的套餐。目前rfchost商家的洛杉矶机房还是非常不错的,采用CN2优化线路,电信双程CN2 GIA,联通去程CN2 GIA,回程AS4837,移动走自己的直连线路,目前季付套餐还是比较划算的,有需要的可...

ubuntu12.04为你推荐
ip购买急。购买一年的固定IP地址要多少钱?酒店回应名媛拼单名媛一天到晚都做什么?微信回应封杀钉钉为什么微信被封以后然后解封了过了一会又被封了地图应用谁知道什么地图软件好用,求 最好可以看到路上行人甲骨文不满赔偿公司倒闭员工不满一年怎么赔偿地陷裂口天上顿时露出一个大窟窿地上也裂开了,一到黑幽幽的深沟可以用什么四字词语来?psbc.com邮政储蓄卡如何激活sss17.com一玩棋牌吧(www.17wqp.com)怎么样?www.kknnn.com求有颜色的网站!要免费的partnersonline我家Internet Explorer为什么开不起来
北京租服务器 vps优惠码 pccw 私服服务器 紫田 realvnc 国内php空间 京东商城双十一活动 免费mysql 电子邮件服务器 国外免费asp空间 无限流量 web服务器搭建 512mb 台湾google 测试网速命令 97rb 杭州电信 存储服务器 乐视会员免费领取 更多