Uses of Interface
org.apache.hadoop.net.Node

Packages that use Node

org.apache.hadoop.mapred	A software framework for easily writing applications which process vast amounts of data (multi-terabyte data-sets) parallelly on large clusters (thousands of nodes) built of commodity hardware in a reliable, fault-tolerant manner.
org.apache.hadoop.net	Network-related classes.

Uses of Node in org.apache.hadoop.mapred

Methods in org.apache.hadoop.mapred that return Node

Node	JobTracker.getNode(String name) Return the Node in the network topology that corresponds to the hostname
static Node	JobTracker.getParentNode(Node node, int level)
Node	JobTracker.resolveAndAddToTopology(String name)

Methods in org.apache.hadoop.mapred that return types with arguments of type Node

Collection<Node>

JobTracker.getNodesAtMaxLevel() Returns a collection of nodes at the max level

Methods in org.apache.hadoop.mapred with parameters of type Node

static Node

JobTracker.getParentNode(Node node, int level)

Uses of Node in org.apache.hadoop.net

Classes in org.apache.hadoop.net that implement Node

class

NodeBase A base class that implements interface Node

Fields in org.apache.hadoop.net declared as Node

protected Node

NodeBase.parent

Methods in org.apache.hadoop.net that return Node

Node	NetworkTopology.chooseRandom(String scope) randomly choose one node from scope if scope starts with ~, choose one from the all nodes except for the ones in scope; otherwise, choose one from scope
Node	NetworkTopology.getNode(String loc) Given a string representation of a node, return its reference
protected Node	NetworkTopology.getNodeForNetworkLocation(Node node) Return a reference to the node given its string representation.
protected Node	NetworkTopologyWithNodeGroup.getNodeForNetworkLocation(Node node)
Node	NodeBase.getParent() Return this node's parent
Node	Node.getParent() Return this node's parent

Methods in org.apache.hadoop.net that return types with arguments of type Node

List<Node>

NetworkTopology.getLeaves(String scope) return leaves in scope

Methods in org.apache.hadoop.net with parameters of type Node

void	NetworkTopology.add(Node node) Add a leaf node Update node counter & rack counter if neccessary
void	NetworkTopologyWithNodeGroup.add(Node node) Add a leaf node Update node counter & rack counter if necessary
boolean	NetworkTopology.contains(Node node) Check if the tree contains node node
int	NetworkTopology.getDistance(Node node1, Node node2) Return the distance between two nodes It is assumed that the distance from one node to its parent is 1 The distance between two nodes is calculated by summing up their distances to their closest common ancestor.
protected Node	NetworkTopology.getNodeForNetworkLocation(Node node) Return a reference to the node given its string representation.
protected Node	NetworkTopologyWithNodeGroup.getNodeForNetworkLocation(Node node)
static String	NodeBase.getPath(Node node) Return this node's path
boolean	NetworkTopology.isOnSameNodeGroup(Node node1, Node node2) Return false directly as not aware of NodeGroup, to be override in sub-class
boolean	NetworkTopologyWithNodeGroup.isOnSameNodeGroup(Node node1, Node node2) Check if two nodes are on the same node group (hypervisor) The assumption here is: each nodes are leaf nodes.
boolean	NetworkTopology.isOnSameRack(Node node1, Node node2) Check if two nodes are on the same rack
boolean	NetworkTopologyWithNodeGroup.isOnSameRack(Node node1, Node node2)
protected boolean	NetworkTopology.isSameParents(Node node1, Node node2) Compare the parents of each node for equality
void	NetworkTopology.pseudoSortByDistance(Node reader, Node[] nodes) Sort nodes array by their distances to reader It linearly scans the array, if a local node is found, swap it with the first element of the array.
void	NetworkTopology.pseudoSortByDistance(Node reader, Node[] nodes) Sort nodes array by their distances to reader It linearly scans the array, if a local node is found, swap it with the first element of the array.
void	NetworkTopologyWithNodeGroup.pseudoSortByDistance(Node reader, Node[] nodes) Sort nodes array by their distances to reader It linearly scans the array, if a local node is found, swap it with the first element of the array.
void	NetworkTopologyWithNodeGroup.pseudoSortByDistance(Node reader, Node[] nodes) Sort nodes array by their distances to reader It linearly scans the array, if a local node is found, swap it with the first element of the array.
void	NetworkTopology.remove(Node node) Remove a node Update node counter & rack counter if neccessary
void	NetworkTopologyWithNodeGroup.remove(Node node) Remove a node Update node counter and rack counter if necessary
void	NodeBase.setParent(Node parent) Set this node's parent
void	Node.setParent(Node parent) Set this node's parent
protected static void	NetworkTopology.swap(Node[] nodes, int i, int j)

Method parameters in org.apache.hadoop.net with type arguments of type Node

int	NetworkTopology.countNumOfAvailableNodes(String scope, Collection<Node> excludedNodes) return the number of leaves in scope but not in excludedNodes if scope starts with ~, return the number of nodes that are not in scope and excludedNodes;

Constructors in org.apache.hadoop.net with parameters of type Node

NodeBase(String name, String location, Node parent, int level)
Construct a node from its name and its location