hadoop-hdfs-issues mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From "Hadoop QA (JIRA)" <j...@apache.org>
Subject [jira] [Commented] (HDFS-6659) Create a Block List
Date Sun, 03 May 2015 07:53:08 GMT

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

Hadoop QA commented on HDFS-6659:
---------------------------------

\\
\\
| (x) *{color:red}-1 overall{color}* |
\\
\\
|| Vote || Subsystem || Runtime || Comment ||
| {color:blue}0{color} | pre-patch |  14m 37s | Pre-patch trunk compilation is healthy. |
| {color:green}+1{color} | @author |   0m  0s | The patch does not contain any @author tags.
|
| {color:green}+1{color} | tests included |   0m  0s | The patch appears to include 1 new
or modified test files. |
| {color:red}-1{color} | javac |   1m 25s | The patch appears to cause the build to fail.
|
\\
\\
|| Subsystem || Report/Notes ||
| Patch URL | http://issues.apache.org/jira/secure/attachment/12666459/HDFS-6659.patch |
| Optional Tests | javadoc javac unit findbugs checkstyle |
| git revision | trunk / a319771 |
| Console output | https://builds.apache.org/job/PreCommit-HDFS-Build/10734/console |


This message was automatically generated.

> Create a Block List
> -------------------
>
>                 Key: HDFS-6659
>                 URL: https://issues.apache.org/jira/browse/HDFS-6659
>             Project: Hadoop HDFS
>          Issue Type: Sub-task
>          Components: namenode
>    Affects Versions: 2.4.1
>            Reporter: Amir Langer
>            Assignee: Amir Langer
>              Labels: perfomance
>         Attachments: HDFS-6659.patch
>
>
> BlockList - An efficient array based list that can extend its capacity with two main
features:
> 1. Gaps (result of remove operations) are managed internally without the need for extra
memory - We create a linked list of gaps by using the array index as references + An int to
the head of the gaps list. In every insert operation, we first use any available gap before
extending the array.
> 2. Array extension is done by chaining different arrays, not by allocating a larger array
and copying all its data across. This is a lot less heavy in terms of latency for that particular
call. It also avoids having large amount of contiguous heap space and so behaves nicer with
garbage collection.
>  



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

Mime
View raw message