You are viewing a plain text version of this content. The canonical link for it is here.
Posted to issues@arrow.apache.org by "Antoine Pitrou (Jira)" <ji...@apache.org> on 2019/08/29 13:20:00 UTC

[jira] [Commented] (ARROW-3406) [C++] Create a caching memory pool implementation

    [ https://issues.apache.org/jira/browse/ARROW-3406?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=16918622#comment-16918622 ] 

Antoine Pitrou commented on ARROW-3406:
---------------------------------------

Modern allocators actually have their own internal freelists or other memory block reuse schemes. So I'm not sure this is really necessary, unless perhaps if we know which sizes we're gonna reuse exactly.

> [C++] Create a caching memory pool implementation
> -------------------------------------------------
>
>                 Key: ARROW-3406
>                 URL: https://issues.apache.org/jira/browse/ARROW-3406
>             Project: Apache Arrow
>          Issue Type: Improvement
>          Components: C++
>    Affects Versions: 0.11.0
>            Reporter: Antoine Pitrou
>            Priority: Minor
>             Fix For: 1.0.0
>
>
> A caching memory pool implementation would be able to recycle freed memory blocks instead of returning them to the system immediately. Two different policies may be chosen:
> * either an unbounded cache
> * or a size-limited cache, perhaps with some kind of LRU mechanism
> Such a feature might help e.g. for CSV parsing, when reading and parsing data into temporary memory buffers.



--
This message was sent by Atlassian Jira
(v8.3.2#803003)