multiprocessor_Synchronization_lecture19_0520.pdf国

文件名称: multiprocessor_Synchronization_lecture19_0520.pdf

所属分类: 讲义

开发工具:

文件大小: 2mb

下载次数: 0

上传时间: 2019-08-17

提供者: zil****

下载 (2mb)

不能下载？报告错误

详细说明：国外高校教学课件，可以帮助大家对多核处理器中的同步理论做进一步的了解 multiprocessor_Synchronization_lecture19_0520Standard approach: "locking d lock( bool trylock( 铺 2D74 So Th1 图 11 DMA exels L(A Dock(B) 3)y Aquile locks iu salne Protal/application DeAL merce abdias nuaL Thready Similar implications as in Amdahl's Law:I=5+P ∠ p loading lads b an increase op bse opcw 铺 Mov f (lock flag==0) lock flag=l return false block: ⊥ockf1ag=0 oid locko i lock flag= lock flag=0 while(trylock())[ Critical Critical Section Section void unlock()[ lock flag=0 BolL ), iasnlia Aos 2+Lead olatile 1 flag[2 void lock() nt me=get thread id()i ag flag [me]=true d unlock)( ime-g flag [oj-tru flag=false, false) Critical flag[l]true flag[l]true g[olaf Critical 铺 Peterson's lock tile bool flag[2]i ctim latil - g d id flag=(false, false I flag flag[o]-true lag[l]true hile (frag [other] && victim victim victim victim==me)i do nothing I while(.) Critical d unlock() t a⊥se bool trylock()( 0) return truei y else retl 1 trylock()( return (testAndSet(&lock flag)==0) TSL Has iwpleabous safEst∠uAa oo&2Dwes4 Noe itke 铺 k() Wait to enter critical section in loop("spin") while ( trylock())( Prob|em:“ Busy waiti do nothing d lock()I Ⅵ int count N>( init (int n)( count=N; Na acquire() if(countnext-top->next D->next=A->nex ↓+日■E insert(E, A) insert(F, A) A->next A->next-F 544如人m4。1B自!

(系统自动生成,下载前可以参看下载内容)