X-Git-Url: http://git.megacz.com/?a=blobdiff_plain;f=ghc%2Fdocs%2Fusers_guide%2Fparallel.sgml;h=9a6502ac4165c4d8468d20c107b6a0b980637692;hb=73641e01ee9dfbe83f8c6225c1f6ae2e7d621b63;hp=ef90b8c38c92a4b0c8e96fce8fec841cd2cc7244;hpb=7d55139b431f0ae67d041910812e7c2f38c0e09d;p=ghc-hetmet.git diff --git a/ghc/docs/users_guide/parallel.sgml b/ghc/docs/users_guide/parallel.sgml index ef90b8c..9a6502a 100644 --- a/ghc/docs/users_guide/parallel.sgml +++ b/ghc/docs/users_guide/parallel.sgml @@ -43,6 +43,7 @@ sequential execution, then fine. A Parallel Haskell program implies multiple processes running on multiple processors, under a PVM (Parallel Virtual Machine) framework. +An MPI interface is under development but not fully functional, yet. @@ -51,13 +52,18 @@ fun” than about “speed.” That will change. -Again, check Simon's Web page for publications about Parallel Haskell -(including “GUM”, the key bits of the runtime system). +Check the GPH Page +for more information on “GPH” (Haskell98 with extensions for +parallel execution), the latest version of “GUM” (the runtime +system to enable parallel executions) and papers on research issues. A +list of publications about GPH and about GUM is also available from Simon's +Web Page. Some details about Parallel Haskell follow. For more information -about concurrent Haskell, see . +about concurrent Haskell, see the module +Control.Concurrent in the library documentation. @@ -152,9 +158,9 @@ you'd like to see this with your very own eyes, just run GHC with the -Scheduling policy for concurrent/parallel threads -<IndexTerm><Primary>Scheduling—concurrent/parallel</Primary></IndexTerm> -<IndexTerm><Primary>Concurrent/parallel scheduling</Primary></IndexTerm> +Scheduling policy for concurrent threads +<IndexTerm><Primary>Scheduling—concurrent</Primary></IndexTerm> +<IndexTerm><Primary>Concurrent scheduling</Primary></IndexTerm> Runnable threads are scheduled in round-robin fashion. Context @@ -179,6 +185,19 @@ of the currently active threads are completed. + +Scheduling policy for parallel threads +<IndexTerm><Primary>Scheduling—parallel</Primary></IndexTerm> +<IndexTerm><Primary>Parallel scheduling</Primary></IndexTerm> + + +In GUM we use an unfair scheduler, which means that a thread continues to +perform graph reduction until it blocks on a closure under evaluation, on a +remote closure or until the thread finishes. + + + +