Package | Description |
---|---|
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.
|
Modifier and Type | Method and Description |
---|---|
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) |
Modifier and Type | Method and Description |
---|---|
Collection<Node> |
JobTracker.getNodesAtMaxLevel()
Returns a collection of nodes at the max level
|
Modifier and Type | Method and Description |
---|---|
static Node |
JobTracker.getParentNode(Node node,
int level) |
Modifier and Type | Class and Description |
---|---|
class |
NodeBase
A base class that implements interface Node
|
Modifier and Type | Field and Description |
---|---|
protected Node |
NodeBase.parent |
Modifier and Type | Method and Description |
---|---|
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
|
Node |
NodeBase.getParent()
Return this node's parent
|
Node |
Node.getParent()
Return this node's parent
|
Modifier and Type | Method and Description |
---|---|
void |
NetworkTopology.add(Node node)
Add a leaf node
Update node counter & rack counter if neccessary
|
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.
|
static String |
NodeBase.getPath(Node node)
Return this node's path
|
boolean |
NetworkTopology.isOnSameRack(Node node1,
Node node2)
Check if two nodes are on the same rack
|
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 |
NetworkTopology.remove(Node node)
Remove a node
Update node counter & rack counter if neccessary
|
void |
NodeBase.setParent(Node parent)
Set this node's parent
|
void |
Node.setParent(Node parent)
Set this node's parent
|
Modifier and Type | Method and Description |
---|---|
int |
NetworkTopology.countNumOfAvailableNodes(String scope,
List<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;
|
Constructor and Description |
---|
NodeBase(String name,
String location,
Node parent,
int level)
Construct a node from its name and its location
|
Copyright © 2010 The Apache Software Foundation