-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
hi,
i'm new to the list and was following your caching discussion with some
interest, as i was just implementing something similar for an
open-source interactive photo-development software and was thinking
about using GEGL instead.
for this
On Tue, Jun 16, 2009 at 8:58 AM, johannes hanikahana...@gmail.com wrote:
this is handled well because changing the last operation in the graph
will need the output of the previous one, thus incrementing the ``more
recently used'' value of this one, preventing the important previous
cache line
Another thing worth mentioning is that caches on every node doesn't
scale well to concurrent evaluation of the graph since the evaluators
would need to all the time synchronize usage of the caches, preventing
nice scaling of performance as you use more CPU cores/CPUs.
In most instances, this
On Tue, Jun 16, 2009 at 11:11 AM, jcup...@gmail.com wrote:
Another thing worth mentioning is that caches on every node doesn't
scale well to concurrent evaluation of the graph since the evaluators
would need to all the time synchronize usage of the caches, preventing
nice scaling of
Hi,
on July 6, the midterm evaluations open - and the mentors will have
until July 12 to evaluate the progress of their students, and decide
whether this is enough to
- let them continue in GSoC
- make Google pay the first half of the SoC stipends
Mentors and students, please do agree on the
Eric Daoust's GSoC midterm deliverables:
1) Sped up nohalo level 1 code.
2) New fast resampling method targeted for downsampling (without
the affine transformation info passed from above, and
without variable size buffers, which will be implemented later
in the
6 matches
Mail list logo
