The key to unlocking accessible concurrent programming lies in controlling interactions: to run a program in parallel we have to understand the interactions between the parallel tasks. Many of the better concurrent programming models…
(More)
http://qconlondon.com/london-2010/speaker/Simon+Marlow
The key to unlocking accessible concurrent programming lies in controlling interactions: to run a program in parallel we have to understand the interactions between the parallel tasks. Many of the better concurrent programming models rely on reducing interactions. In message passing, for example, interactions only occur through messages.
Haskell is a pure functional lanugage, which means that the default is zero interaction, and access to state is tightly controlled by the type system. So it should come as no surprise that Haskell is establishing itself not only as a testbed for concurrent programming models, but also as a realistic platform for multicore programming.
In this talk I'll give a tour of concurrency from the Haskell viewpoint through various practical examples. I'll explain why we believe there is no "one size fits all" concurrent programming model. Haskell provides thread-based concurrency with a choice of synchronisation mechanisms for situations where those models fit best, but also pure parallel programming models that are often a better choice when the goal is to parallelise a compute-intensive task.
(Less)
There was a problem sending you an sms. Check your phone number or try again later.
To get Scribd mobile enter your number and we'll send you a link to the Scribd app for iPhone & Android.We've sent a link to the Scribd app. If you didn't receive it, try again.