You are viewing a plain text version of this content. The canonical link for it is here.
Posted to common-dev@hadoop.apache.org by "Hong Tang (JIRA)" <ji...@apache.org> on 2009/05/02 13:19:30 UTC
[jira] Commented: (HADOOP-3799) Design a pluggable interface to
place replicas of blocks in HDFS
[ https://issues.apache.org/jira/browse/HADOOP-3799?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=12705258#action_12705258 ]
Hong Tang commented on HADOOP-3799:
-----------------------------------
@dhruba
any specific block replication policies you might be interested in experimenting with?
additionally, Ben Reed pointed me to this paper in NSDI 09 where the authors described a scheme on how to allow applications to express storage cues (some of them can be replication policies):
Flexible, Wide-Area Storage for Distributed Systems with WheelFS
Jeremy Stribling, MIT CSAIL; Yair Sovran, New York University; Irene Zhang and Xavid Pretzer, MIT CSAIL; Jinyang Li, New York University; M. Frans Kaashoek and Robert Morris, MIT CSAIL http://www.usenix.org/events/nsdi09/tech/full_papers/stribling/stribling.pdf
> Design a pluggable interface to place replicas of blocks in HDFS
> ----------------------------------------------------------------
>
> Key: HADOOP-3799
> URL: https://issues.apache.org/jira/browse/HADOOP-3799
> Project: Hadoop Core
> Issue Type: Improvement
> Components: dfs
> Reporter: dhruba borthakur
> Assignee: dhruba borthakur
> Attachments: BlockPlacementPluggable.txt
>
>
> The current HDFS code typically places one replica on local rack, the second replica on remote random rack and the third replica on a random node of that remote rack. This algorithm is baked in the NameNode's code. It would be nice to make the block placement algorithm a pluggable interface. This will allow experimentation of different placement algorithms based on workloads, availability guarantees and failure models.
--
This message is automatically generated by JIRA.
-
You can reply to this email to add a comment to the issue online.