From mboxrd@z Thu Jan 1 00:00:00 1970 Return-Path: X-Spam-Checker-Version: SpamAssassin 3.1.3 (2006-06-01) on yquem.inria.fr X-Spam-Level: X-Spam-Status: No, score=0.0 required=5.0 tests=AWL autolearn=disabled version=3.1.3 X-Original-To: caml-list@yquem.inria.fr Delivered-To: caml-list@yquem.inria.fr Received: from mail4-relais-sop.national.inria.fr (mail4-relais-sop.national.inria.fr [192.134.164.105]) by yquem.inria.fr (Postfix) with ESMTP id 21B31BC6D for ; Sat, 10 May 2008 00:24:06 +0200 (CEST) X-IronPort-Anti-Spam-Filtered: true X-IronPort-Anti-Spam-Result: AhoBAKRrJEjCpx6wo2dsb2JhbACSBgEBAQEBAQcFCAcRmSQ X-IronPort-AV: E=Sophos;i="4.27,462,1204498800"; d="scan'208";a="26015099" Received: from smtpmin.univ-orleans.fr (HELO min.univ-orleans.fr) ([194.167.30.176]) by mail4-smtp-sop.national.inria.fr with ESMTP; 10 May 2008 00:24:05 +0200 Received: from smtps.univ-orleans.fr (localhost [127.0.0.1]) by min.univ-orleans.fr (Postfix) with ESMTP id 9CDE912B40A; Sat, 10 May 2008 00:24:05 +0200 (CEST) Received: from [192.168.0.12] (ras75-4-82-235-58-110.fbx.proxad.net [82.235.58.110]) by smtps.univ-orleans.fr (Postfix) with ESMTP id 125B836E5B; Sat, 10 May 2008 00:24:10 +0200 (CEST) Subject: Re: [Caml-list] Re: Why OCaml rocks From: David Teller To: Jon Harrop Cc: Gerd Stolpmann , caml-list@yquem.inria.fr In-Reply-To: <200805091910.41381.jon@ffconsultancy.com> References: <200805090139.54870.jon@ffconsultancy.com> <200805090609.36123.jon@ffconsultancy.com> <1210331526.17578.32.camel@flake.lan.gerd-stolpmann.de> <200805091910.41381.jon@ffconsultancy.com> Content-Type: text/plain Date: Sat, 10 May 2008 00:25:49 +0200 Message-Id: <1210371949.6399.62.camel@Blefuscu> Mime-Version: 1.0 X-Mailer: Evolution 2.12.1 Content-Transfer-Encoding: 7bit X-Spam: no; 0.00; ocaml:01 univ-orleans:01 0100,:01 parallelism:01 cheers:01 cheers:01 univ-orleans:01 lifo:01 liquidations:98 wrote:01 caml-list:01 data:02 theoretical:03 algorithms:03 algorithms:03 On Fri, 2008-05-09 at 19:10 +0100, Jon Harrop wrote: > Parallelism is easy in F#. Now, that's a cliffhanger. Could you elaborate ? Cheers, David > > I think that the cost of copying data is totally overrated. We are doing > > this often, and even over the network, and hey, we are breaking every > > speed limit. > > You cannot afford to pay that price for parallel implementations of most > numerical algorithms. Er... Not being a specialist, I may be wrong, but I seem to remember that you can afford that, as long as you're also doing something else during that copy. > On the contrary, that is not a theoretical statement at all: it > already > happened. F# already makes it much easier to write high performance > parallel > algorithms and its concurrent GC is the crux of that capability. Examples ? Pretty please ? Cheers, David -- David Teller Security of Distributed Systems http://www.univ-orleans.fr/lifo/Members/David.Teller Angry researcher: French Universities need reforms, but the LRU act brings liquidations.