Satnam Singh of Microsoft Research

Hello, Recently Satnam Singh of Microsoft Research gave a talk at Google about concurrency, Haskell STM, etc. Was there a transcript of this talk? Thanks, Vasili

2008/3/18 Galchin Vasili
Recently Satnam Singh of Microsoft Research gave a talk at Google about concurrency, Haskell STM, etc. Was there a transcript of this talk?
Do you have the exact date of this talk? I can't see that anyone called Satnam has given a talk at Google. (It might have been very informal, in which case there wouldn't be a record of it, and nor would there be a video) Cheers, AGL -- Adam Langley agl@imperialviolet.org http://www.imperialviolet.org

oops ... my bad ... it was at Standford's CS dept on Feb 29 at 1:30:
This presentation describes a variety of ways to write parallel and
concurrent programs in the lazy functional language Haskell. We start off by
introducing par/pseq annotations which provide guidance to the run-time
about how work can be performed speculatively which provides a basic
mechanism for writing implicitly parallel programs. We then describe how a
library of strategies can be used to force specific evaluation orders which
are necessary to exploit parallelism. We then go on to describe the basic
mechanism for writing explicitly parallel programs using Haskell's
lightweight threads and then we describe how Haskell's STM implementation
can help to write programs that share state between threads through the use
of a special monads and as an example we describe the implementation of a
multi-way rendezvous library. We then describe some work with Tim Harris on
feedback directed implicit parallelism which provides yet another way to
write implicitly parallel programs with out resorting to par/pseq
annotations. Finally, we report on the progress of a nested data parallel
library for Haskell inspired by the NESL language. Throughout the talk we
shall emphasizes how Haskell's pure nature (with side
effecting operations clearly indicated by the type system) facilitates the
exploitation of parallelism.
It would be great to get more than the above!
Regards.
Vasili
On 3/18/08, Adam Langley
2008/3/18 Galchin Vasili
: Recently Satnam Singh of Microsoft Research gave a talk at Google
about
concurrency, Haskell STM, etc. Was there a transcript of this talk?
Do you have the exact date of this talk? I can't see that anyone called Satnam has given a talk at Google.
(It might have been very informal, in which case there wouldn't be a record of it, and nor would there be a video)
Cheers,
AGL
-- Adam Langley agl@imperialviolet.org http://www.imperialviolet.org

Hi,
It would be great to get more than the above!
The "Feedback Directed Implicit Parallelism" part is available in a
paper from ICFP 2007:
http://research.microsoft.com/~tharris/papers/2007-fdip.pdf
There might be papers online for the other segments of the talk, too.
- Chris.
--
Chris Ball

Hello,
I contacted Satnam Singh about this talk and we tried to arrange with
Stanford to video record the presentation, but it was not possible on the
short notice...
__
Donnie
On 3/18/08, Galchin Vasili
oops ... my bad ... it was at Standford's CS dept on Feb 29 at 1:30:
This presentation describes a variety of ways to write parallel and concurrent programs in the lazy functional language Haskell. We start off by introducing par/pseq annotations which provide guidance to the run-time about how work can be performed speculatively which provides a basic mechanism for writing implicitly parallel programs. We then describe how a library of strategies can be used to force specific evaluation orders which are necessary to exploit parallelism. We then go on to describe the basic mechanism for writing explicitly parallel programs using Haskell's lightweight threads and then we describe how Haskell's STM implementation can help to write programs that share state between threads through the use of a special monads and as an example we describe the implementation of a multi-way rendezvous library. We then describe some work with Tim Harris on feedback directed implicit parallelism which provides yet another way to write implicitly parallel programs with out resorting to par/pseq annotations. Finally, we report on the progress of a nested data parallel library for Haskell inspired by the NESL language. Throughout the talk we shall emphasizes how Haskell's pure nature (with side effecting operations clearly indicated by the type system) facilitates the exploitation of parallelism.
It would be great to get more than the above!
Regards.
Vasili
On 3/18/08, Adam Langley
wrote: 2008/3/18 Galchin Vasili
: Recently Satnam Singh of Microsoft Research gave a talk at Google
about
concurrency, Haskell STM, etc. Was there a transcript of this talk?
Do you have the exact date of this talk? I can't see that anyone called Satnam has given a talk at Google.
(It might have been very informal, in which case there wouldn't be a record of it, and nor would there be a video)
Cheers,
AGL
-- Adam Langley agl@imperialviolet.org http://www.imperialviolet.org
_______________________________________________ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

Related news -- Intel, Microsoft choose UC-Berkeley to host $10M parallel computing center March 19, 2008 8:36 AM ET http://news.moneycentral.msn.com/provider/providerarticle.aspx?feed=ACBJ&date=20080319&id=8361298
participants (5)
-
Adam Langley
-
Chris Ball
-
Donnie Jones
-
Galchin Vasili
-
Steve Lihn