文档下载 文档下载导航
设为首页 | 加入收藏
搜索 请输入内容:  
 导航当前位置: 文档下载 > 所有分类 > Lock-free scheduling of logical processes in parallel simulation
侵权投诉

Lock-free scheduling of logical processes in parallel simulation

With fixed lookahead information in a simulation model, the overhead of asynchronous conservative parallel simulation lies in the mechanism used for propagating time updates in order for logical processes to safely advance their local simulation clocks. St

Lock-free scheduling of logical processes in parallel simulation

o

itaR emiT noitucexENumber of Processors

Figure1.Theratioofexecutiontimeintheworst-casescenarioofCCT.

fastandslowprocessorsbecomesobvious.SinceitismorelikelythatLPsareeachrunningatadifferentpace,thereisasmallerchanceofanLPhavingitscriticalchannelsupdatedwhentherearemorethanonecriticalparentspresent.TheseunnecessarycontextswitchesarelesslikelytobeavoidedbyCCTandthereforeresultinsmallercontextswitchratiosforthelock-freecounterpart.

Lock-free scheduling of logical processes in parallel simulation

o

itaR hctiwS txetnoCNumber of Processors

Figure2.Theratioofthenumberofcontextswitchesintheworst-casescenarioofCCT.Inthesecondexperiment,weincreasedthenumberoflogicalprocessesassignedtoeachprocessor.AsmoreLPsarereadyforexecution,blockingislessofasystembottle-neck.Inthisexperiment,we xedthenumberofprocessorsat12andincreasedthenumberofLPsassignedtoeachoftheprocessors.Theexperimentwasconductedinthreeset-tingswithdifferenteventdensities(0,100,and10,000)torepresentdifferentlevelsofworkload.Ineachsetting,wealsochangedtheconnectionradius:onewithconnectionra-diusbeingone,onewiththeradiusbeingsix,andonewithfullyconnectedLPgraphs(denotedbyin niteradius).TheresultisshowninFigure3.ThecurvesrepresentchangingexecutiontimeratioofouralgorithmtotheCCTalgorithm.Notethatthex-axesareinlogarithmicscale.

Ingeneral,weseethatthelock-freealgorithmperformsmuchbetterthanCCTasthenumberofLPsperproces-sorissmall.Asthenumberincreases,theblockingef-

1.21.1o

1itaR em0.9iT noitu0.8cexE0.70.6R=1, D=00.5

R=inf, D=0

R=6, D=01

2

4

8

16

32

64

Number of LPs Per Processor

1.2

1.1o

1itaR em0.9iT noitu0.8cexE0.70.6R=1, D=1000.5

R=inf, D=100

R=6, D=1001

2

481632

64

Number of LPs Per Processor

1.21.1o

1itaR em0.9iT noitu0.8cexE0.70.6R=1, D=10,000R=inf, D=10,000

R=6, D=10,0000.5

1

2

4

8

16

32

64

Number of LPs Per Processor

Figure3.Theratiooftheexecutiontimewithincreasingnumberoflogicalprocessesperprocessor.

fectinCCTisalleviatedandtheoverheadofthelock-freealgorithmduetoextracomplexityinbookkeepingbeginstoshow.Theoverallperformancecausedbytheoverheadrangesfromabout10%inlightworkloadtolessthan4%inmoderatetorelativelyheavyworkloadwhenthenum-berofLPsperprocessorislarge.Therearetwoimportantmessagesfromtheresult.First,astheconnectivityoftheLPgraphincreases,thedifferencebetweenthetwoalgo-rithmsincreases.WithsmallnumberofLPsperprocessor,thelock-freealgorithmincreasesitsperformanceadvantageastheconnectivityincreases.Thisisbecauseunderhigherconnectivity,theslowprocessintheCCTalgorithmisabletoblockmoreofitsneighborsandfurtherslowdownthesystem.Ontheotherhand,withlargenumberofLPsperprocessor,theoppositeseemstobetruewherethelock-freealgorithmgetsslowerforlargenumberofconnectionsintheLPgraph.Thisistheresultofincreasingoverheadofouralgorithm.Ouralgorithmrequiresaccesstomanyvari-ables(bothsharedandprivate)tohelpavoidunnecessary

上一页第9页

你可能喜欢

热门文档

相关文档

站点地图 | 文档上传 | 侵权投诉 | 手机版
本站所有资源均来自互联网,本站只负责收集和整理,均不承担任何法律责任,如有侵权等其它行为请联系我们.
文档下载 Copyright 2013 doc.guandang.net All Rights Reserved.  -  email