Nala Ginrut skribis:
> And there're two possible applications:
> 1. handle the requests in a server
> 2. read files from disk (but how big file is proper for par-map)
Quoting the fine manual:
Note that futures are intended for the evaluation of purely
functional expressions. Expressions th
I'd like to include something like this in 2.0.8.
Comments and suggestions?
Mark
>From a36b1c48079803cf09753fc446825fcc2c64e6a8 Mon Sep 17 00:00:00 2001
From: Mark H Weaver
Date: Fri, 29 Mar 2013 12:28:49 -0400
Subject: [PATCH] Add -C command-line option to adjust %load-compiled-path.
*
I wrote:
> Nala Ginrut writes:
>> cut---
>> scheme@(guile-user)> ,time (define a (map (lambda (x) (expt x 5)) (iota
>> 1)))
>> ;; 0.008019s real time, 0.007979s run time. 0.00s spent in GC.
>> scheme@(guile-user)> ,time (define a (par-map (lambda (x) (
I agree. Do you have any idea what's causing the overhead?
I tried to benchmark it, but got a segmentation fault. I think we have
plenty of work to do here. :-)
Noah
On Fri, Mar 29, 2013 at 2:00 AM, Mark H Weaver wrote:
> I wrote:
>
> > Nala Ginrut writes:
> >> cut---
Oh, sorry to email twice so soon, but I have an idea for making par-map
usable in more cases: add a keyword argument called "block-size". Its value
should be a positive integer, and the meaning is to have each thread do
block-size iterations. That should make it easier to use par-map for cases
like
Hi Noah,
Noah Lavine writes:
> Oh, sorry to email twice so soon, but I have an idea for making
> par-map usable in more cases: add a keyword argument called
> "block-size". Its value should be a positive integer, and the meaning
> is to have each thread do block-size iterations.
IMO, we should a