This book covers the breadth of Haskell's diverse selection of programming APIs for concurrent and parallel programming. It is split into two parts. The first part, on parallel programming, covers the techniques for using multiple processors to speed up CPU-intensive computations, including methods for using parallelism in both idiomatic Haskell and numerical array-based algori...
This book covers the breadth of Haskell's diverse selection of programming APIs for concurrent and parallel programming. It is split into two parts. The first part, on parallel programming, covers the techniques for using multiple processors to speed up CPU-intensive computations, including methods for using parallelism in both idiomatic Haskell and numerical array-based algorithms, and for running computations on a GPU. The second part, on concurrent programming, covers techniques for using multiple threads, including overlapping multiple I/O operations, building concurrent network servers, and distributed programming across multiple machines.
作者简介
· · · · · ·
Simon Marlow has been a prominent figure in the Haskell community formany years. He is the author of large parts of the Glasgow HaskellCompiler, including in particular its highly regarded mulitcoreruntime system, along with many of the libraries and tools thatHaskell programmers take for granted. Simon also contributes to thefunctional programming research community, and has a...
Simon Marlow has been a prominent figure in the Haskell community formany years. He is the author of large parts of the Glasgow HaskellCompiler, including in particular its highly regarded mulitcoreruntime system, along with many of the libraries and tools thatHaskell programmers take for granted. Simon also contributes to thefunctional programming research community, and has a string of paperson subjects ranging from garbage collection to language design. Inrecent years Simon's focus has been on making Haskell an idealprogramming language for parallel and concurrent applications, both bydeveloping new programming models and building a high-qualityimplementation.
Simon spent 14 years at Microsoft's Research laborotory in Cambridge,before taking a break in Spring 2013 to work on this book. Hecurrently works at Facebook UK.
原文摘录
· · · · · ·
A program that has a sequential portion like this can never achieve perfect speedup, and in fact we can calculate the maximum achievable speedup for a given number of cores using Amdahl’s law. Amdahl’s law gives the maximum speedup as the ratio:
1 / ((1 - P) + P/N)
where P is the portion of the runtime that can be parallelized, and N is the number of processors available. In our case, P is (0.76 - 0.0167)/0.76 = 0.978, and the maximum speedup is 1.96. The sequential fraction here is too small to make a significant impact on the theoretical maximum speedup with two processors, but when we have more processors, say 64, it becomes much more important: 1 / ((1-0.978) + 0.978/64) = 26.8. So no matter what we do, this tiny sequential part of our program will limit the maximum speedup we can o... (查看原文)
0 有用 will 2014-10-06 15:11:08
Long overdue...
0 有用 寒栗 2022-11-21 07:25:15 荷兰
所有的技术书都应该如此写
0 有用 布丁補丁 2017-10-07 01:02:19
此书虽小，可以谕大
0 有用 amadeoh 2014-10-02 00:53:08
Very useful. Not just for Haskell.
0 有用 Tonn 2013-09-05 17:04:49
本书分为并行与并发两部分：前一部分主要介绍了Par Monad/Strategy/Repa/Accelerate等，非常漂亮的并行抽象；后一部分从MVar/STM/Channel/等底层开始逐渐实现更高级的的并发方式。书中的例子显然是精心挑选的，从能够并行的kmeans/sudoku/mandelbrot到支撑海量连接的分布式chat server，仅冲着GHC核心大神Simon Marlow的名... 本书分为并行与并发两部分：前一部分主要介绍了Par Monad/Strategy/Repa/Accelerate等，非常漂亮的并行抽象；后一部分从MVar/STM/Channel/等底层开始逐渐实现更高级的的并发方式。书中的例子显然是精心挑选的，从能够并行的kmeans/sudoku/mandelbrot到支撑海量连接的分布式chat server，仅冲着GHC核心大神Simon Marlow的名号就值得一读。 (展开)