Giraph以顶点为主进行数据表示
- 数据类型
public class xxx extends BasicComputation
< ID类型, value类型, weight类型, message类型> {
public void compute(
Vertex<ID类型, value类型, weight类型> vertex,
Iterable<message类型> messages){
……
}
}
- 对于每一个超步,各个处理器对每个“活跃”顶点调用 用户自定义的函数Compute()
- SendMessageTo()
Compute()函数的计算过程中可以将更新 后的计算值以消息形式发送给邻居顶点,SendMessageTo() 表示消息传递给指定顶点。 - sendMessageToAllEdges(vertex, vertex.getValue());
把Vertex的值发给所有相邻的边 - vertex.setValue(new IntWritable(1))设置节点值
vertex.setValue(new IntWritable(1));
- vertex.voteToHalt();
Compute()函数中调用.voteToHalt()可将该顶点在下一个(s+1)超步设为非活跃,否则它会一直保持活跃状态。但若收到别的点的消息,它会变为活跃。在当前(第s)超步它仍会继续计算。 - 当顶点在超步s收到消息,那么它在s+1步中将变为活跃,参与计算。
- 如果Master收集到所有Worker中活跃顶点数量之和为0,意味着迭代过程可以结束
- Aggregator
//Master
public static class yyy extends DefaultMasterCompute {
registerAggregator(......, IntSumAggregator.class) //注册aggregator,并处理
}
//worker
public class xxx extends BasicComputation
< ID类型, value类型, weight类型, message类型> {
public void compute(
Vertex<ID类型, value类型, weight类型> vertex, Iterable<message类型> messages){
......
aggregate(......) //向master汇报
} }
- vertex.getEdges()
获得所有相邻边 - vertex.getNumEdges() 获取相邻边个数
- edge/vertex.getValue().get() 获得边/顶点的值
- ((IntWritable)getAggregatedValue(XXX)).get() 获取aggregator的值
- getTotalNumVertices() 获取总顶点个数
- 计算图中共有几个顶点
//worker
public class CountVertexImpl extends CountVertex {
public static final String COUNT_VERTEX = "countVertex";
public void compute(Vertex<IntWritable, IntWritable, NullWritable> vertex, Iterable<IntWritable> iterable) throws IOException{
long superstep = getSuperstep();
if(superstep==0){
aggregate(COUNT_VERTEX, new IntWritable(1));
}
else{
vertex.setValue(new IntWritable( ((IntWritable)getAggregatedValue(COUNT_VERTEX)).get()));
vertex.setValue(new IntWritable(1));
vertex.voteToHalt();
}
}
}
//master
public class CountVertexMasterCompute extends DefaultMasterCompute {
public static final String COUNT_VERTEX = "countVertex";
@Override
public void initialize() throws InstantiationException, IllegalAccessException {
registerAggregator(COUNT_VERTEX, IntSumAggregator.class);
}
}
- 最短路径
public void compute(Vertex<LongWritable, DoubleWritable, FloatWritable>
vertex, Iterable<DoubleWritable> messages){
double minDist = isSource(vertex) ? 0d : Double.MAX_VALUE;
for (DoubleWritable message : messages) {
minDist = Math.min(minDist, message.get());
}
if (minDist < vertex.getValue().get()) {
vertex.setValue(new DoubleWritable(minDist));
for (Edge<LongWritable, FloatWritable> edge : vertex.getEdges()) {
double distance = minDist + edge.getValue().get();
sendMessage(edge.getTargetVertexId(), new DoubleWritable(distance));
}
}
vertex.voteToHalt();
}