From mboxrd@z Thu Jan 1 00:00:00 1970 Return-Path: X-Original-To: caml-list@sympa.inria.fr Delivered-To: caml-list@sympa.inria.fr Received: from mail3-relais-sop.national.inria.fr (mail3-relais-sop.national.inria.fr [192.134.164.104]) by sympa.inria.fr (Postfix) with ESMTPS id 9663A7EC6E for ; Wed, 15 Jan 2014 19:38:46 +0100 (CET) Received-SPF: None (mail3-smtp-sop.national.inria.fr: no sender authenticity information available from domain of jon@ffconsultancy.com) identity=pra; client-ip=84.93.230.227; receiver=mail3-smtp-sop.national.inria.fr; envelope-from="jon@ffconsultancy.com"; x-sender="jon@ffconsultancy.com"; x-conformance=sidf_compatible Received-SPF: None (mail3-smtp-sop.national.inria.fr: no sender authenticity information available from domain of jon@ffconsultancy.com) identity=mailfrom; client-ip=84.93.230.227; receiver=mail3-smtp-sop.national.inria.fr; envelope-from="jon@ffconsultancy.com"; x-sender="jon@ffconsultancy.com"; x-conformance=sidf_compatible Received-SPF: None (mail3-smtp-sop.national.inria.fr: no sender authenticity information available from domain of postmaster@avasout01.plus.net) identity=helo; client-ip=84.93.230.227; receiver=mail3-smtp-sop.national.inria.fr; envelope-from="jon@ffconsultancy.com"; x-sender="postmaster@avasout01.plus.net"; x-conformance=sidf_compatible X-IronPort-Anti-Spam-Filtered: true X-IronPort-Anti-Spam-Result: AkIFAI3U1lJUXebjemdsb2JhbABZgkd8qWWJGIhbgRUWDgEBCQ0KCBIqgiUBAQEECAIjQQsNAwIJEQQBAQEnBxkjCgkIAgQBEgsFh3gJw0oXjn8GAYIvgggEiQ+GFYosiyyIZg X-IPAS-Result: AkIFAI3U1lJUXebjemdsb2JhbABZgkd8qWWJGIhbgRUWDgEBCQ0KCBIqgiUBAQEECAIjQQsNAwIJEQQBAQEnBxkjCgkIAgQBEgsFh3gJw0oXjn8GAYIvgggEiQ+GFYosiyyIZg X-IronPort-AV: E=Sophos;i="4.95,664,1384297200"; d="scan'208,217";a="44931933" Received: from avasout01.plus.net ([84.93.230.227]) by mail3-smtp-sop.national.inria.fr with ESMTP; 15 Jan 2014 19:38:45 +0100 Received: from XPS ([37.152.200.7]) by avasout01 with smtp id EJei1n0020A4a4M01Jejra; Wed, 15 Jan 2014 18:38:44 +0000 X-CM-Score: 0.00 X-CNFS-Analysis: v=2.1 cv=dYa5gxne c=1 sm=1 tr=0 a=zD7QsnFCsN1Ffr3W2pehDw==:117 a=zD7QsnFCsN1Ffr3W2pehDw==:17 a=0Bzu9jTXAAAA:8 a=-qbKOtGX5joA:10 a=Xub9RBUEA-sA:10 a=Kvk-SOs2Z7YA:10 a=r2vSxAw-AAAA:8 a=A4DONW8dBGYA:10 a=DAwyPP_o2Byb1YXLmDAA:9 a=Zr7miEi8wWIA:10 a=cKsnjEOsciEA:10 a=9QZAvFrwAAAA:8 a=YG86fJyiAAAA:8 a=5_Zo8iftAAAA:8 a=nhLz-WcFGEPIeR18DyUA:9 a=8lAvldO4xJ32qVfX:21 a=ZhTQU0gIPYbLpZ_p:21 a=wPNLvfGTeEIA:10 a=rJk57Y98B0kA:10 a=xvxq4vxhNPoA:10 a=yMhMjlubAAAA:8 a=SSmOFEACAAAA:8 a=Kd9AtGWg1y0fj8Sz8rMA:9 a=opZI-vgXkrjsu7Ah:21 a=VmjqKgxLr_lk17Ti:21 a=6LA3ESnl4OofyIJz:21 a=gKO2Hq4RSVkA:10 a=UiCQ7L4-1S4A:10 a=hTZeC7Yk6K0A:10 a=frz4AuCg-hUA:10 a=tXsnliwV7b4A:10 a=m3LrWqsvsPQA:10 X-AUTH: jdh302:2500 Reply-To: From: "Jon Harrop" To: "'Yotam Barnoy'" , "'Adrien Nader'" Cc: "'Ocaml Mailing List'" References: <20140115090434.GA10113@notk.org> In-Reply-To: Date: Wed, 15 Jan 2014 18:38:46 -0000 Organization: Flying Frog Consultancy Ltd. Message-ID: <21c401cf1221$07484030$15d8c090$@ffconsultancy.com> MIME-Version: 1.0 Content-Type: multipart/alternative; boundary="----=_NextPart_000_21C5_01CF1221.07555F90" X-Mailer: Microsoft Outlook 14.0 Thread-Index: AQE+DUFOpZF8xNnuTiBqBDAeMuYqLAHFoOY7AtkSh52bgy2RQA== Content-Language: en-gb Subject: RE: [Caml-list] Google summer of code This is a multipart message in MIME format. ------=_NextPart_000_21C5_01CF1221.07555F90 Content-Type: text/plain; charset="iso-8859-1" Content-Transfer-Encoding: quoted-printable =D8 I can say that the main part is coming up with a webpage full of ideas for projects. =20 If anyone wants to pursue anything like HLVM, please do get in touch with me. =20 I=92ve been discussing student projects recently and a couple of ideas I=92= ve had are: =20 1. Merge core (stdlib) collections with the GC. For example, mutable stacks and queues are currently represented as arrays filled with NULL pointers whereas a collection-aware GC could skip the unreachable pointers and the collection wouldn=92t have to NULL out its elements. Collections co= uld also be shrunk by the GC. 2. Allow objects to morph their representation as they go from one generation to another. For example, long-lived immutable sets could morph from a tree of heap-allocated blocks into a sorted array. =20 I also think it would be interesting to study how fast purely functional data structures could be if their representation was optimized (within the confines of a memory-safe VM) for the performance characteristics of a na= =EFve mark-sweep GC. For example, list cons in OCaml currently heap allocates a new block based on the assumption that the GC can do this quickly (which OCaml can) but the list implementation could pre-allocate a block of cons cells in an array and use a CAS to claim the next one, amortising allocations and greatly reducing the stress on the GC. I=92ve implemented t= his for lists in F# where it is about as fast as the generational GC. I don=92t know if the same can be done effectively for trees like Set and Map. The motivation is avoiding the pathological performance for programs that violate the generational hypothesis. =20 Cheers, Jon. =20 From: caml-list-request@inria.fr [mailto:caml-list-request@inria.fr] On Behalf Of Yotam Barnoy Sent: 15 January 2014 15:24 To: Adrien Nader Cc: Ocaml Mailing List Subject: Re: [Caml-list] Google summer of code =20 I actually don't think it's very hard to apply (in general). The requirements page is here (http://www.google-melange.com/gsoc/document/show/gsoc_program/google/gsoc20 14/help_page?ModPagespeed=3Dnoscript#1._How_does_a_mentoring_organization). It's certainly much easier than applying for a grant. Having participated as a mentor in another organization, and having seen the application process every year, I can say that the main part is coming up with a webpage full of ideas for projects. I think that already exists partially on the ocamllabs wiki. I'd really like to see that wiki be centralized and available from the ocaml.org site. The key thing is to figure out which projects are doable by people in one summer. The next step is that people need to volunteer for mentorship. Even 2 people are enough for a start, but 3-4 are better. Finally, one person takes on the process of filling out the application and submitting it. One of the things that concern google, as can be seen in the webpage, is that there's enough effort from the mentors to=20 a. weed out the poor candidates and=20 b. be in touch with/demand enough from the candidates to make sure that they're actually working and not just slacking off for the summer. In my old organization, the participants had to post blog updates every week or so about their progress. Other than that, there's not much to it. -Yotam =20 =20 On Wed, Jan 15, 2014 at 4:04 AM, Adrien Nader wrote: Hi, On Tue, Jan 14, 2014, Yotam Barnoy wrote: > Dear List > > Are there plans to apply for GSOC mentorship this year? Searching online > yielded only a rejected application from 2011. Applications for mentor > organizations are due February 14th. Then, if nothing has been started yet, it's probably already too late. GSoC is fairly constraining and time-consuming. Nowadays, projects which manage to do it have actually gotten experienced at it and this makes it more difficult for new participants: they don't only have to do things well, they have to do things better than projects which have been doing it for 10 years. There's also a feeling that Google doesn't care about what happens in OCaml-land (that's mostly speculation). I believe it might be worth trying again. Many things have changed and the projects that could be worked on now might appeal more to the GSoC organizers. That would be for 2015 in my opinion though. Regards, Adrien Nader =20 ------=_NextPart_000_21C5_01CF1221.07555F90 Content-Type: text/html; charset="iso-8859-1" Content-Transfer-Encoding: quoted-printable

=D8  I can say that the main part is coming up with = a webpage full of ideas for projects.

 

If anyone wants to pursue anything like HLVM, please do get in touch with = me.

 

I’ve been discussing student projec= ts recently and a couple of ideas I’ve had are:

=

 

1.       Merge core (stdlib) collections with the GC. For exampl= e, mutable stacks and queues are currently represented as arrays filled wit= h NULL pointers whereas a collection-aware GC could skip the unreachable po= inters and the collection wouldn’t have to NULL out its elements. Col= lections could also be shrunk by the GC.

2.       Allow objects to morph their representation as th= ey go from one generation to another. For example, long-lived immutable set= s could morph from a tree of heap-allocated blocks into a sorted array.

 

<= p class=3DMsoNormal>I also think it would be interesting to study ho= w fast purely functional data structures could be if their representation w= as optimized (within the confines of a memory-safe VM) for the performance = characteristics of a na=EFve mark-sweep GC. For example, list cons in OCaml= currently heap allocates a new block based on the assumption that the GC c= an do this quickly (which OCaml can) but the list implementation could pre-= allocate a block of cons cells in an array and use a CAS to claim the next = one, amortising allocations and greatly reducing the stress on the GC. I= 217;ve implemented this for lists in F# where it is about as fast as the ge= nerational GC. I don’t know if the same can be done effectively for t= rees like Set and Map. The motivation is avoiding the pathological performa= nce for programs that violate the generational hypothesis.

 

Cheers,

Jon.=

 <= /p>

From: caml-list-request@inr= ia.fr [mailto:caml-list-request@inria.fr] On Behalf Of Yotam Barnoy<= br>Sent: 15 January 2014 15:24
To: Adrien Nader
Cc:<= /b> Ocaml Mailing List
Subject: Re: [Caml-list] Google summer of = code

 

I act= ually don't think it's very hard to apply (in general). The requirements pa= ge is here (http://www.google-melange.com/gsoc/document/show/gso= c_program/google/gsoc2014/help_page?ModPagespeed=3Dnoscript#1._How_does_a_m= entoring_organization). It's certainly much easier than applying for a = grant.

Having participated as a mentor in another organization, and having see= n the application process every year, I can say that the main part is comin= g up with a webpage full of ideas for projects. I think that already exists= partially on the ocamllabs wiki. I'd really like to see that wiki be centr= alized and available from the ocaml.org si= te. The key thing is to figure out which projects are doable by people in o= ne summer. The next step is that people need to volunteer for mentorship. E= ven 2 people are enough for a start, but 3-4 are better. Finally, one perso= n takes on the process of filling out the application and submitting it.

One o= f the things that concern google, as can be seen in the webpage, is that th= ere's enough effort from the mentors to
a. weed out the poor candidates= and
b. be in touch with/demand enough from the candidates to make sure= that they're actually working and not just slacking off for the summer. In= my old organization, the participants had to post blog updates every week = or so about their progress.

Other than that, there's not much to it.

-Yotam

 

 

On Wed, Jan 15, 2014 at 4:04 AM, Adrien Nader <adrien@notk.org> wrote:

Hi,


On Tue, Jan 14, 2014, Yotam Barnoy wrote:> Dear List
>
> Are there plans to apply for GSOC mentorshi= p this year? Searching online
> yielded only a rejected application f= rom 2011. Applications for mentor
> organizations are due February 14= th.

Then, if nothing has been started yet, it's probably already too lat= e.
GSoC is fairly constraining and time-consuming. Nowadays, projects wh= ich
manage to do it have actually gotten experienced at it and this make= s it
more difficult for new participants: they don't only have to do thi= ngs
well, they have to do things better than projects which have been do= ing
it for 10 years.

There's also a feeling that Google doesn't c= are about what happens in
OCaml-land (that's mostly speculation).
I believe it might be worth trying again. Many things have changed and
= the projects that could be worked on now might appeal more to the GSoC
o= rganizers. That would be for 2015 in my opinion though.

Regards,
= Adrien Nader

 

= ------=_NextPart_000_21C5_01CF1221.07555F90--