diff options
author | Ulrich Spörlein <uqs@FreeBSD.org> | 2011-05-15 20:41:31 +0000 |
---|---|---|
committer | Ulrich Spörlein <uqs@FreeBSD.org> | 2011-05-15 20:41:31 +0000 |
commit | de198ef68df7efc5fb5d2b149bc4ba73fac0fe27 (patch) | |
tree | 1964fa914a3b23e79991794c51aa28db1a6ab7ea /en_US.ISO8859-1/captions/2009/asiabsdcon/rao-kernellocking-1.sbv | |
parent | 9e0abcb54876a26bae51d0e7ed9fa10ef9d971bb (diff) | |
download | doc-de198ef68df7efc5fb5d2b149bc4ba73fac0fe27.tar.gz doc-de198ef68df7efc5fb5d2b149bc4ba73fac0fe27.zip |
Typo and spelling fixes.
Notes
Notes:
svn path=/head/; revision=37259
Diffstat (limited to 'en_US.ISO8859-1/captions/2009/asiabsdcon/rao-kernellocking-1.sbv')
-rw-r--r-- | en_US.ISO8859-1/captions/2009/asiabsdcon/rao-kernellocking-1.sbv | 42 |
1 files changed, 21 insertions, 21 deletions
diff --git a/en_US.ISO8859-1/captions/2009/asiabsdcon/rao-kernellocking-1.sbv b/en_US.ISO8859-1/captions/2009/asiabsdcon/rao-kernellocking-1.sbv index 5fcc88159c..e0eb130aa8 100644 --- a/en_US.ISO8859-1/captions/2009/asiabsdcon/rao-kernellocking-1.sbv +++ b/en_US.ISO8859-1/captions/2009/asiabsdcon/rao-kernellocking-1.sbv @@ -458,7 +458,7 @@ that were imported new kernel memory allocator that was that I discovered 0:07:45.009,0:07:48.439 -and the scheduler was move with a seperate lock +and the scheduler was move with a separate lock 0:07:48.439,0:07:50.449 in order to @@ -563,7 +563,7 @@ all the thread willing to acquire to read mode to concurrently adjust to the structure but prevents the threads from 0:09:23.699,0:09:25.390 -writing nto the protected path. +writing to the protected path. 0:09:25.390,0:09:28.890 while the reader..while they are readers @@ -690,7 +690,7 @@ as we are going to see I think they're going to see it and its usage is pretty much discouraged 0:11:23.570,0:11:28.320 -basically FreeBSD you can consider locking primative divided into three classes +basically FreeBSD you can consider locking primitive divided into three classes 0:11:28.320,0:11:31.250 three classes of @@ -999,7 +999,7 @@ but as you're going to see we've used two techniques in order to to cope with that 0:16:42.020,0:16:45.830 -another thing is that while you cant +another thing is that while you can't 0:16:45.830,0:16:47.920 allow @@ -1011,7 +1011,7 @@ context switches while having while holding spin lock 0:16:52.570,0:16:55.249 -it's obvious you cant +it's obvious you can't 0:16:55.249,0:16:59.580 acquire a locking primitive while holding a spin lock @@ -1101,7 +1101,7 @@ we solve this problem actually in the 0:18:17.780,0:18:21.170 -kernel using a technique called priority propogation +kernel using a technique called priority propagation 0:18:21.170,0:18:22.020 basically @@ -1146,7 +1146,7 @@ Read locks cannot support 0:18:57.310,0:19:03.430 -priority propogation fixes for read lock that happens because you'd like to +priority propagation fixes for read lock that happens because you'd like to 0:19:03.430,0:19:07.290 the turnstile should keep track of all the readers @@ -1185,7 +1185,7 @@ basically what happens 0:19:39.070,0:19:42.150 -about the priority propogation is that the +about the priority propagation is that the 0:19:42.150,0:19:44.830 the threads and the turnstiles @@ -1235,7 +1235,7 @@ and this owner has a priority of two hundred and fifty six 0:20:26.150,0:20:31.120 well as you know higher level, higher value means lower priority. so if this is 0:20:31.120,0:20:34.960 -a suitable pace for priority propogation +a suitable pace for priority propagation 0:20:34.960,0:20:40.820 but what happens is that this owner is actually sleeping on another turnstile @@ -1250,7 +1250,7 @@ of the second turnstile has always the same priority of its sleepers so 0:20:50.750,0:20:55.530 -just propogating priority to the first owner was just unuseful because the first +just propagating priority to the first owner was just unuseful because the first 0:20:55.530,0:20:56.340 one @@ -1265,7 +1265,7 @@ still keep the chain to a 0:21:00.580,0:21:04.820 -lower priority so it's was going to be propogated to the first one +lower priority so it's was going to be propagated to the first one 0:21:04.820,0:21:07.679 actually running @@ -1274,7 +1274,7 @@ lower priority so it's was going to be propogated to the first one owner of the chain 0:21:09.870,0:21:14.670 -this is the situation after the propogation as you can see all of threads in the chain +this is the situation after the propagation as you can see all of threads in the chain 0:21:14.670,0:21:16.559 has the same priority @@ -1508,7 +1508,7 @@ the same conditions happens even for other kinds of lock lockmgr and the sx lock 0:25:25.540,0:25:26.860 -so you cant hold +so you can't hold 0:25:26.860,0:25:29.410 a mutex for example @@ -1541,13 +1541,13 @@ and so can create some raisee problems as the sleepqueues are born just to serve wait channels 0:26:04.779,0:26:09.190 - they don't track owner too so they dont care about priority propogation and priority inversion problem + they don't track owner too so they dont care about priority propagation and priority inversion problem 0:26:09.190,0:26:14.430 just because sleepqueues entirely should not have work 0:26:14.430,0:26:20.150 -so for example lockmgr and sx have not priority propogation +so for example lockmgr and sx have not priority propagation 0:26:20.150,0:26:22.360 systems and the @@ -1562,7 +1562,7 @@ sure it's you mean why it's not 0:26:39.000,0:26:41.790 -why doesnt blocking primitives exist yeah? +why doesn't blocking primitives exist yeah? 0:26:41.790,0:26:44.250 so imagine that for example the @@ -1598,7 +1598,7 @@ using the blocking the using the turnstile you will go to a 0:27:06.930,0:27:12.110 -always the mechanism of priority propogation and priority inversion handling.Its +always the mechanism of priority propagation and priority inversion handling.Its 0:27:12.110,0:27:13.760 not very @@ -1676,7 +1676,7 @@ but however 0:28:12.340,0:28:17.669 -as you could have seen before the three containers create a heirarchy that +as you could have seen before the three containers create a hierarchy that 0:28:17.669,0:28:20.090 should not be broken like @@ -1730,7 +1730,7 @@ in FreeBSD that means that if the allocator is pretty busy or going to to sleep 0:29:12.680,0:29:15.760 -in order to retreive your memory +in order to retrieve your memory 0:29:15.760,0:29:17.890 and if you do with a lock hold @@ -1853,7 +1853,7 @@ is the possibility to specify a wake up priority on the sleeping threads once they are asleep 0:31:04.740,0:31:07.470 -that condvar still doesnt +that condvar still doesn't 0:31:07.470,0:31:12.430 maybe if we could port these features to the condition variables we we will be able @@ -2292,7 +2292,7 @@ not sure would you repeat 0:39:59.919,0:40:03.879 - some voice please. No I cant hear + some voice please. No I can't hear 0:40:03.879,0:40:05.509 It seems to me that |