dynamic temperature-aware task scheduling based on sliding window model for mpsocs

7/29/2019 Dynamic Temperature-Aware Task Scheduling Based on Sliding Window Model for MPSoCs

1/6

2011 3rd International Coerence on Advanced Computer Control CC 2011)

Dymc Tmrtr-Awr Ts Scd Bsd o Sd dow od for

PSoCs

Luguang Wang, Zhpng Ja, Xn L, ang LSchoo of omute Science an Technoogy

Shanong nivesityJina, R hina

emai: wg9870101@gmaicom

bstract-A y f aaay a va a a avy a ay a a fa A va ak a ava a a a vaa W a ya aaa ak y a y aa ay f ak aa f a a a a a f a axa ay x ayak f av a ay v y a a a ava a f xa a y a a aaa a a vaa f a a av a avy ava a a aa a

Keywordsmultiprocessor systemsonchips(oCs); sldingwindow; temperatureaware; mucore task schedung; HotSpot

In ecent yeas, inceasing numbe of new embee systems eman highefomance an highintegate ocessos to meet thei embee esign constains In this case,mutiocesso systemsonchis have been oose as a omising soution Howeve, because of the fastgowing integation an the iceasing numbe of ocessocoes, the chi temeatue soas asticay

Thema hot sots incease cooing costs, negativey imact eiabiity an egae efomance Hot sots acceeate faiue mechanisms such as stess migation, an ieectic beaown [] Because of the ecease of the eectiveoeating see with high temeatue, hot sots aso aect

efomance avesey Aessing thema hot sots aoneis not enouh to achieve bette eiabiity an temeatuegaients in time an sace etemine evice eiabii atmoeate temeatues Thema cycing henomenon cancause acceeate acage fatigue, astic efomations ofmateias an othe emanent faiues age satia temeatue vaiations acoss the chi may cause efomance oogic faiues o exame, coc sew obems becomenoticeabe fo satia vaiations of even 1520 egees [2]

This reserch is sponsored by the Natural Science Foundation ofChina (NSFC) under grant No. 971832,69331, and the Independent Innovation Foundation of Shandong University(IIFSDU) under grant No. 29TS32.

978-1-4244-881- /11/$26. 211 EEE 98

Meang QuDet of an omute

nivesity of Kentucyexigto, K 4050, SAemai: mqiu@enguyeu

Sevea thema conto techniques have been oosean aie in moe ocessos via hawaebase mechanisms Dynamic Scaing (DS) an DynamicVotage Scaing (DVS), as we as coc gating, ae abe toeectivey conto ocessos' temeatue an euce enegy cost, but the efomance ovehea is signicant As

muticoe systems become oua, some scheuing mechanisms [4, , 9] have been stuie to conto temeatuean baance wooa

ost existing themaawae o temeatueawae scheuing techniques focus on singe facto Savou an Tancoso [3] ooses a themaawae scheuing base on temeatue an cooing efciency of each coe, negecting theeect of temeatue vaiations in time an sace The obabiistic scheuing technique [4] focuses on the effect oftemoa an satia temeatue vaiations an uses aveagetemeatue of one oe to omute its obabiity But thetemeatue of a coe wi be aecte by its neighbo unitsThe temeatue of one coe an its neighbo units shou beconsiee at the same time

In this ae, a siing winow moe is inouce toenote histoica temeatues of each coe A ynamic temeatueawae tas scheuing oicy,is oose to achieve bette thema oes In this scheuing, cuent an histoica temeatues of each coe aeuse to cacuate the obabii of tas aocation fo thecoe Then the one with the maxima obabiity is chosen toexecute the eay tas If thee ae mutie coes have thesame obabii, the scheue gives ioity to the coe thathas the minima aveage temeatue of neighbo units Ateach tas aiva, each coe's new obabii vaue is ecomute nce the obabiities ae uate, we choose thesuitabe coe to execute the eay tas The exeimentaesuts show that ou oicy can achieve owe an moe stabe temeatues

The eme f this ae s oie as foows Section 2, we iscuss the eate wo The system moe isintouce in Section 3 In Section 4, we escibe ou scheuing oicy in etai We ovie the exeimenta methooogy an evauate the exeimenta esuts in Section 5Section 6 concues the ae

II EATED

In singeocesso systems, many oweawae scheuing techniques have been oose with the focuses on votage scheuing A DVS metho base on ecomosing onchi an offchi wooa is esente in [5] muti coe


2/6

2011 3rd International Corence on Advanced Computer Control (ICACC 2011)

systems, thee ae many comex oweawae scheuingtechniques with timing an emance constains In [6],two DVSbase otima agoithms ae oose, one founiocesso an the othe fo mutiocesso DSP systems,to minimize the execte tota enegy consumtion whiesatising the timing constaint with a guaantee conenceobabiity In [7], MPSo scheuing obem is sovewith the objectives of minimizing the ata tansfe on the busan guaanteeing eaines fo the aveage case, using IP(Intege inea Pogamming) an constaint ogamming,esectivey

As oweawae oicies ae not aways sucient to event temeatue inuce obems, thema moeing anmanagement methos have been oose In oe to euceea temeatue an avoi thema emegency, a themaawae scheuing agoithm [8] is oose fo aicationswith stochastic wooas Pae [9] investigates how theexisting thema management, owe management an jobscheuing oicies aect thema behavio in 3D chi moes, an ooses a ynamic themaawae job scheuingtechnique to euce the equency of hot sots, satia gaients, an thema cyces HotSot [10] is an accuate yetfast an actica moe base on an equivaent cicuit ofthema esistance an caacitances that coeson to micoachitectue bocs an essentia asects of the themaacage, which cacuates tansient temeatue esonsegiven the hysica chaacteistics an owe consumtion ofunits on the ie A eogammabe gate aay (FPGA)base emuation amewo [11] is esente fo I esignes to exoe a wie ange of esign ateatives fo MPSosystems at cyceaccuate eves, whie chaacteizing thei

thema behavio at a vey fast see with esect to MPSoachitectua simuatos Michau et a [12] oose a newmigation metho fo temeatueconstaine muticoesystem, in which theas ae exchange wheneve the simutaneous occuence of a co an a hot coe is etecte Theauthos emonstate that thei metho yies the samethoughut with heatanun thea migation (TM) [13],but equies much ess migations

III YSTEM ODE

A. Appicaion Mode

We consie a MPSo with M units V = {V i=l, 2, ,} , incuing coes, caches an othe secia ocessing

units The set of coes is exesse as C = { i=1, 2, , } , whee is the tota numbe of coes In this ae, theunits iecty connectng with a unt in te ooan aecae 'S neighbo units Fo exame, the neighbo units ofoe 0 in Fig ae 2 ache 0, 2 Tag 0 an oe 2 theneighbo units of oe 4 ae oe 2, DRAM 0, 2 Tag 2 anoe 6 The neighbo units set of coe ( iseesente as A (A ;U), whee the numbe of units in A is

eesente as A We assume that MPSo oesn't suotDVS

Tass iscusse in this ae ae noneemtive Theeae no eaines o eenence among tass We assume thatthe MPSo has one tas aiva at most at a given time Thetas is cae eay tas

99

h h

DM g g Bg

UBf DM

g g BU h h

Figure . .Floorplan of UltraSPARC T

B Sidin Window ModeIn oe to eco instantaneous temeatues of each

coe when the ast tass aive, we ene a temeatuesiing winow This winow is a twoimensiona stoagestuctue shown in Fig2 an is exesse as r= {T 1i L, :} , whee T is the instantaneous temeatue of coe

when the th tas aives an L is the size of siing winow Moeove, we aso ene TV = {TV 1 i :} toeco the cuent temeatue of each unit, whee T is thecuent temeatue of unit

In this ae, the hihest temeatue at whih theMPSo chi can wo nomay is cae esod empeaueTesho temeatue is enote as Tth an set at 85"Cin exeiments The chi cannot be bue immeiateywhen its temeatue excees thesho temeatue, howeve, it shou avoi this situation When the instantaneoustemeatue of a unit excees Tth" this instantaneous temeatue is aso name o spo empeaue

cedulngmeL

Nw

7 72 2 2

2

Dsded

7 7N N N

Nes N

Figure 2. .Structure of temperature sliding indo

IV YNAMIC EMPERATUREAARE ASK CHEDUINGOICY

In this section, we oose a ynamic temeatueawaetas scheuing oicy base on siing winow moe,PobH This oicy consists of two stes: (1) the obabiity


3/6


of tas aocation fo each coe is cacuate by cuent anhistoica temeatues of the coe, (2) the coe with the maxima obabiity is chosen to execute the eay tas If mutie coes have the same obabiity, the scheue cacuates aveage cuent temeatue of thei neighbo units anchooses the coe with the minima vaue

In this ae, a scheuing ecisions ae base on temeatues measue in MPSo chi Moe chis tyicaycontain sevea thema sensos, an these sensos can beea by a continuous system teemety inastuctue fo coecting an anayzing time seies senso ata [14] The temeatue ata ae witten to memoy an ea by the S to beocesse on a egua basis, an then these ata ae asseto the scheue to guie scheuing

A. Cacuaion of e Pobabii of Task Aocaion

In temeatueawae tas scheuing, the temeatue ofeach coe is the ey to scheue Many existing temeatueawae tas scheuing oicies meey consie cuent temeatue of each coe whie negecting histoica temeatues In ou oicy, when cacuating the obabiity of tasaocation of coe , the scheue taes into consieationboth cuent temeatue an histoica temeatues of coe

In oe to eect the inisensibe oe of thesho temeatue th" the consieation of cuent temeatue of coe is ivie into two ats IfT has eache o exceeeth> the obabiity of tas aocation of coe is oe to thewise, the obabiity of tas aocation of coe iscacuate base on the atio ofT an thesho temeatueth

Fo the sae of highe accuacy, we tae the effect oftemeatue histoy into count A temeatue siing winow r is use to eco ecent L temeatues of each coeExisting tas scheuing oicies aways cacuate the aveage temeatue in a eio of time, an then consie temeatue histoy by the aveage temeatue this ae,ieent weights ae aocate fo histoica temeatuesaccoing to the istance om cuent time The neae to thecuent time, the bigge the weight is To aocate weightsmoe easonabe an easie to conto, we ene an attenuation function

Attenuation Function : In temeatue siing winowr the weight function of temeatues at th time is caeaenuaion funcion In this ae, attenuation function Y iseesente as

yk=Y =pk O 1 thenP =O

else

l-TCP

end if

end if

end for

B Coice of e Suiabe CoeAe cacuation of the obabiity of tas aocation of

each coe, we choose the coe with the maxima obabiity

to execute eay tas If mutie coes have the same obabt, w chse the suitabe c base n he eect neighbo units' temeatues

To those coes with the same obabiity, the scheuecacuates the aveage cuent temeatue of neighbo unitsof each coe The aveage cuent temeatue A of neighbo units of coe Cj can be easiy obtaine by

IAT

=J NA

J

(4)

whee Aj is the neighbo units set of coe Cj; is thenumbe of neighbo units of coe Cj Then we choose the


4/6

2011 3rd International Corene on Advaned Computer Control (ICACC 2011)

coe with the minima aveage cuent temeatue to executeeay tas

The choice ocess of the suitabe coe is esente in2

2 oe hoiceRequire: {Pl } , TU, A , A

} : for i= I to do2:

3:

4:

5:

6:

7:

8:

9:

10:

11:

n the maxima obabiityMix_PofP

count te numbe of coes wit ix

end for

if M=} then

choose the coe with Mix_P to execute eay tas

else

for each coe Cj with Mix_P do

I TU

cacuate A

=J A

end for

choose the coe with the minima AT to execute

eay tas

12: end if

Compexi Anaysis of AoimAgoithm 1 cacuates a the obabiities of tas aoca

tion of coes It taes 0 (L) to comute temeatue attenuation oabty T o each coe Thus, the tme comexityof Agoithm 1 is 0 (*L), whee is the tota numbe ofcoes This agoithm is a oynomia agoithm Agoithm 2

chooses the suitabe coe to execute the eay tas It taes 0() to n the maxima vaue ofP an taes 0 (*Q) tochooses the suitabe coe, whee R is the numbe of coeswith the same obabiity an Q is the maxima numbe ofneighbo units of each coe Thus, the time comexi ofAgoithm 2 is 0 (+R*Q) Because R an Q


5/6

2011 3rd International Conference on Advanced Computer Control (ICACC 2011)

Figure 5. HSTR results

In Fig5, we show the eciency in eucing hot sots ofthe scheuing techniques Fom these esuts we can obsevethat the scheuing techniques of ooest an ooestFPefom simiay in tems of eucing HSTR, an the efomances of the scheuing techniques of AatRan anPobH ae obviousy bete This is ue to the eect of the

ma histoy As the temeatue of the chi cannot suenychange, the eect of thema histoy is vey imotant As aesut of the consieation of the eect of histoica temeatues of the coe an neighbo units' temeatues, PobHcan euce the HSTR by aoun 30% with esect to ooest

Fig6 shows thema mas of MPSos (a) an (b), whichhave been scheue with ooest an PobH, esectiveyIn thema ma (a), the coes with highe temeatue aeajacent to the coes with owe temeatue iecty Thesecause high satia temeatue ieences equenty Inthema ma (b), the units' temeatues istibute moe unfomy In comason wth ooest, PobH icayachieves a moe unifom thema

Figure 6. Thermal maps

In Fig7, it show how each scheuing technique affectssatia gaients ooestFP euces SVTR amaticay incomaison to ooest, whie they efom simiay in temsof eucing HSTR This is ue to the effect of heat shaing

ooestFP exoits the fact that a signicant amount ofheat tansfe ccus mong nighbo uts, n ctive coewith ie neighbos wi esut in owe an moe eveny istibute temeatues on the MPSo PobH can aso eiminate the age satia gaients, an achieve vey simia esuts to AatRan, o even euce t SVTR by aoun 75%with esect to ooest

102

Figure 7. .SVTR results

Coolest Coolcs-FLP AdapRand Pro"HFigure 8. TVTR results

Fig shows how each scheuing technique affects temoa temeatue uctuations We can obseve that thescheuing techniques of ooest an ooestFP efomsimiay in tems of eucing TVTR, an the efomancesof the scheuing techniques of AatRan an PobH aebette ooest an ooestFP cannot effectivey eucethe temoa vaiations as AatRan an PobH becausethey o not consie the thema histoy on each coe PobHcan euce TVTR by aoun 20% with esect to ooest

VI ONCLUSIONSWe oose a ynamic temeatueawae tas scheu

ing oicy base on siing winow moe This scheuingoicy cacuates the obabiity of tas aocation fo eachcoe using cuent an histoica temeatues The coe withthe maxima obabiity is chosen to execute eay tas Ifmutie coes have the same obabiity, the scheue givesioi to the coe that has the minima aveage temeatueof neighbo units Exeimenta esuts show that this oicyovies 30% euction in hot sots comae with existingtechniques It aso ovies 75% an 20% euctions in satia temeatue vaiations an temoa temeatue vaiations esectivey

EFERNCES[] JEDEC Solid State Technology Association, Arlington, VA, "Failure

mechanisms and models for semiconductor devices JEDECpublication JEP22C 2006. Online]. Available:httpjedec.org

2] A.H. Ajami K. Banerjee and M. Pedram "Modeling and analsis ofnonuniform substrate temperature eects on global ULSIinterconnects IEEE Trans. Comput.-Aided Des. Integr. CircuitsSyst.vol. 24 no. 6Jun. 2005 pp. 849861.

3] Kriakos Sravrou and Pedro Trancoso "Thermalaare schedulingfor future chip multiprocessors EURASIP Joual on EmbeddedSstems Volume 2007 Issue Januar 2007 pp. 400.

4] A.K. Coskun T. S Rosing and Keith Whisnant"Temperature aaretask scheduling in MPSoCs Proceedings of the conference onDesign automation and test in Europe2007 pp. 1659 1664.


6/6


5] . Choi R. Soma and M. Pedram "Dnamic voltage and frequencscaling based on orkload decomposition in Proc. ISLPED 2004

pp. 174179.

6] Meikang Qiu Zhiping Jia Chun Xue Zili Shao and Edin H. -

M. Sha "Voltage Assignment ith Guaranteed Probabilit SatisingTiming Constraint for Real-time Multiprocessor DSP The Joual ofVLSI Signal ProcessingVolume 46umber 2007 pp. 55-73.

7] M. Ruggiero A. Guerri D. Berozzi F. Polet ti and M. Milano"Communication-aare allocation and scheduling ameork forstream-oriented multi-processor sstem-on-chip in Proc. DATE2006pp. 38.

8] Shaobo Liu and Meikang Qiu "Thermal-Aare Scheduling for PeakTemperature Reduction ith Stochastic Workloads in 16th IEEEReal-Time and Embedded Technolog and Applications SmposiumStockholm: Proceedings2010 pp. 592.

9] A.. Coskun T. S. Rosing 1. Aala D. Atienza and Y. Leblebici"Dnamic thermal management in 3D multicore architectures inDesign Automation and Test in Europe (DATE)2009.

10] evin Skadron mircea R.Stan arhik Sankaranaraanan WeiHuangSivakumar Velusam and David Tarjan "Temperature-Aare

Microarchitecture Modeling and Implementation ACMTransactions on Architecture and Code Optimization vol. no. March 2004 pp. 94-125.

] David Atienza Pablo G. Del Valle Giacomo Paci Francesco PolettiLuca Benini Giovanni De Micheli Jose M. Mendias and RomanHermida "HW-SW Emulation Frameork for Temperature-AareDesign in MPSoCs ACM Transactions on Design Automation ofEletronic Sstemsvol. 12 no. 32007Aricle 26.

12] P Michaud A. SeznecD. FetisY. Sazeides and T. Constantinou"AStud of Thread Migration in Temperature-Constrained MulticoresACM Transactions on Architecture and Code Optimization eYork: ACM vol. 4 no. 22007Aricle 9.

] Michael D. Poell Mohamed Gomaa and T. . Vijakumar "Heatand-Run: Leveraging SMT and CMP to Manage Poer DensitThrough the Operating Sstem ACM SIGARCH Computer Architecture esVolume 32Issue 5December 2004.

13] . Gross . Whisnant and A. Urmanov prognosticsthrough continuous sstem telemetr in 60th Meeting of the Societfor Machine Failure Prevention TechnologApril 2006 pp. 5362.

14] HotSpothttp://lava.cs.virginia.edHotSpot/

15] Ana Sonia Leon ena W. Tam Jinuk Luke Shin David Weisnerand Francis Schumacher "A poer-eicient high-throughput 32-tread SPARC processor IEEE Joual of solid-state circuits Vol.42o. Januar 2007pp. 716.

13

dynamic temperature-aware task scheduling based on sliding window model for mpsocs

Documents