- From: Jer Noble <jer.noble@apple.com>
- Date: Wed, 07 Aug 2013 20:56:08 -0700
- To: Noah Mendelsohn <nrm@arcanedomain.com>
- Cc: Srikumar Karaikudi Subramanian <srikumarks@gmail.com>, "robert@ocallahan.org" <robert@ocallahan.org>, "K. Gadd" <kg@luminance.org>, Chris Wilson <cwilso@google.com>, Marcus Geelnard <mage@opera.com>, Alex Russell <slightlyoff@google.com>, Anne van Kesteren <annevk@annevk.nl>, Olivier Thereaux <Olivier.Thereaux@bbc.co.uk>, "public-audio@w3.org" <public-audio@w3.org>, "www-tag@w3.org List" <www-tag@w3.org>
> On Aug 7, 2013, at 8:25 PM, Noah Mendelsohn <nrm@arcanedomain.com> wrote: > > Such a measurement sets a bound on the overhead from >copying<, which I thought was the question on the table? Copying, mallocing, and GC churn, actually. Solutions which require the former usually also require the latter two, which may explain why they've all been lumped together under "copying". -Jer
Received on Thursday, 8 August 2013 03:56:41 UTC