Changes between Version 51 and Version 52 of LightweightConcurrency


Ignore:
Timestamp:
May 19, 2012 2:19:07 AM (2 years ago)
Author:
kc
Comment:

--

Legend:

Unmodified
Added
Removed
Modified
  • LightweightConcurrency

    v51 v52  
    238238As an aside, the race condition in [http://www.haskell.org/ghc/docs/6.12.2/html/libraries/base-4.2.0.1/Control-Concurrent-MVar.html#v%3AswapMVar swapMVar] can be eliminated with the help of PTM abstraction. TODO: show example. Thus, PTM abstraction makes it easy to construct correct concurrent data-structures.  
    239239 
     240== SCont Affinity == 
     241 
     242Every SCont is bound to a particular capability and only that capability is capable of running the SCont. Switching to an SCont that is not bound to the current capability raises a runtime error. SCont affinity interface is shown below. 
     243 
     244{{{ 
     245}}} 
     246 
     247A newly created SCont is bound to the current capability.  
     248 
     249 
    240250== Capabilities and Tasks == 
    241251