’s the posix-semaphore egg.
>
>
>
> -Dan
>
>
>
> *From:* Chicken-users [mailto:chicken-users-bounces+dan=
> ironoxide...@nongnu.org] *On Behalf Of *Arthur Maciel
> *Sent:* December 28, 2016 7:47 AM
> *To:* Kooda <ko...@upyum.com>
> *Cc:* chicken-users <
;ko...@upyum.com>
Cc: chicken-users <chicken-users@nongnu.org>
Subject: Re: [Chicken-users] Parallel procedures in CHICKEN
Hi Kooda!
Em 24 de dez de 2016 07:00, "Kooda" <ko...@upyum.com <mailto:ko...@upyum.com> >
escreveu:
On Sat, 24 Dec 2016 02:11:37 -0200
Art
Hi Matt! Thank you very much for the code! If I have any success I'll
report here. Have a Happy New Year!
Cheers,
Arthur
Em 28 de dez de 2016 15:29, "Matt Welland"
escreveu:
> Hi Arthur,
>
> You might find this bit of exploratory code useful:
>
Hi Arthur,
You might find this bit of exploratory code useful:
http://www.kiatoa.com/cgi-bin/fossils/megatest/artifact/50100144d4ed2b54.
It is an example of spawning off dozens of sub-processes and using nanomsg
to communicate the data back. We needed to find changed files in gigs of
data where
Hi Kooda!
Em 24 de dez de 2016 07:00, "Kooda" escreveu:
On Sat, 24 Dec 2016 02:11:37 -0200
Arthur Maciel wrote:
> Is there a way to implement map, for-each and other procedures in a
> parallel way so
>
> (use srfi-1)
> (map (lambda (x) (+ x 1)) (iota
On Sat, 24 Dec 2016 02:11:37 -0200
Arthur Maciel wrote:
> Is there a way to implement map, for-each and other procedures in a
> parallel way so
>
> (use srfi-1)
> (map (lambda (x) (+ x 1)) (iota 100)
>
> would automatically split the list into smaller lists according
Hi!
Is there a way to implement map, for-each and other procedures in a
parallel way so
(use srfi-1)
(map (lambda (x) (+ x 1)) (iota 100)
would automatically split the list into smaller lists according to the
number of CPU cores and then gather the results back?
Thanks in advance.
Cheers,