You are viewing a plain text version of this content. The canonical link for it is here.
Posted to issues@spark.apache.org by "Josh Rosen (JIRA)" <ji...@apache.org> on 2015/05/05 02:12:07 UTC

[jira] [Updated] (SPARK-7078) Cache-aware binary processing in-memory sort

     [ https://issues.apache.org/jira/browse/SPARK-7078?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel ]

Josh Rosen updated SPARK-7078:
------------------------------

Based on some discussion over at SPARK-7075, I think that it makes sense to separate the design of a general-purpose record sort from sort-based shuffle's more specialized sorter.  As a result, I'm stopping progress on this issue for now and will revisit after finishing the shuffle sorter.

> Cache-aware binary processing in-memory sort
> --------------------------------------------
>
>                 Key: SPARK-7078
>                 URL: https://issues.apache.org/jira/browse/SPARK-7078
>             Project: Spark
>          Issue Type: New Feature
>          Components: Shuffle
>            Reporter: Reynold Xin
>            Assignee: Josh Rosen
>
> A cache-friendly sort algorithm that can be used eventually for:
> * sort-merge join
> * shuffle
> See the old alpha sort paper: http://research.microsoft.com/pubs/68249/alphasort.doc
> Note that state-of-the-art for sorting has improved quite a bit, but we can easily optimize the sorting algorithm itself later.



--
This message was sent by Atlassian JIRA
(v6.3.4#6332)

---------------------------------------------------------------------
To unsubscribe, e-mail: issues-unsubscribe@spark.apache.org
For additional commands, e-mail: issues-help@spark.apache.org