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
百驰云成立于2017年,是一家新国人IDC商家,且正规持证IDC/ISP/CDN,商家主要提供数据中心基础服务、互联网业务解决方案,及专属服务器租用、云服务器、云虚拟主机、专属服务器托管、带宽租用等产品和服务。百驰云提供源自大陆、香港、韩国和美国等地骨干级机房优质资源,包括BGP国际多线网络,CN2点对点直连带宽以及国际顶尖品牌硬件。专注为个人开发者用户,中小型,大型企业用户提供一站式核心网络云端...
DogYun(中文名称狗云)新上了一批韩国自动化上架独立服务器,使用月减200元优惠码后仅需每月300元,双E5 CPU,SSD+NVMe高性能硬盘,支持安装Linux或者Windows操作系统,下单自动化上架。这是一家成立于2019年的国人主机商,提供VPS和独立服务器租用等产品,数据中心包括中国香港、美国洛杉矶、日本、韩国、德国、荷兰等。下面分享这款自动化上架韩国独立服务器的配置和优惠码信息。...
我们先普及一下常识吧,每年9月的第一个星期一是美国劳工节。于是,有一些服务商会基于这些节日推出吸引用户的促销活动,比如RackNerd有推出四款洛杉矶和犹他州独立服务器,1G带宽、5个独立IP地址,可以配置Windows和Linux系统,如果有需要独立服务器的可以看看。第一、劳工节促销套餐这里有提供2个套餐。两个方案是选择犹他州的,有2个方案是可以选择洛杉矶机房的。CPU内存SSD硬盘配置流量价格...
ubuntu12.04为你推荐
乐划锁屏乐视手机怎么解除屏幕锁微信回应封杀钉钉微信违规操作被封了,access数据库ACCESS数据库有什么用51sese.com谁有免费电影网站125xx.comwww.free.com 是官方网站吗?kb123.netwww.zhmmjyw.net百度收录慢?haole012.com说在:012qq.com这个网站能免费挂QQ,是真的吗?dadi.tvApple TV是干嘛的?怎么用?多少钱?www.gogo.com哪种丰胸产品是不含激素的?dpscycleDPScycle插件为什么没有猎人模块 最好详细点
备案未注册域名 unsplash 789电视 双十一秒杀 创建邮箱 阿里云官方网站 xuni 1美元 好看的空间 windows2008 美国asp空间 时间服务器 赵 隐士ddos 丹弗润滑油 qq空间登入 灵动鬼影实录剧情 lickmyboobs 免费网络相册 免费网络管理软件 更多