Classes in this File | Line Coverage | Branch Coverage | Complexity | ||||
RangePartitionerFactory |
|
| 0.0;0 |
1 | /* | |
2 | * Licensed to the Apache Software Foundation (ASF) under one | |
3 | * or more contributor license agreements. See the NOTICE file | |
4 | * distributed with this work for additional information | |
5 | * regarding copyright ownership. The ASF licenses this file | |
6 | * to you under the Apache License, Version 2.0 (the | |
7 | * "License"); you may not use this file except in compliance | |
8 | * with the License. You may obtain a copy of the License at | |
9 | * | |
10 | * http://www.apache.org/licenses/LICENSE-2.0 | |
11 | * | |
12 | * Unless required by applicable law or agreed to in writing, software | |
13 | * distributed under the License is distributed on an "AS IS" BASIS, | |
14 | * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. | |
15 | * See the License for the specific language governing permissions and | |
16 | * limitations under the License. | |
17 | */ | |
18 | ||
19 | package org.apache.giraph.graph.partition; | |
20 | ||
21 | import org.apache.hadoop.io.Writable; | |
22 | import org.apache.hadoop.io.WritableComparable; | |
23 | ||
24 | /** | |
25 | * Range partitioning will split the vertices by a key range based on a generic | |
26 | * type. This allows vertices that have some locality with the vertex ids | |
27 | * to reduce the amount of messages sent. The tradeoffs are that | |
28 | * range partitioning is more susceptible to hot spots if the keys | |
29 | * are not randomly distributed. Another negative is the user must implement | |
30 | * some of the functionality around how to split the key range. | |
31 | * | |
32 | * See {@link RangeWorkerPartitioner} | |
33 | * | |
34 | * @param <I> Vertex index value | |
35 | * @param <V> Vertex value | |
36 | * @param <E> Edge value | |
37 | * @param <M> Message value | |
38 | */ | |
39 | @SuppressWarnings("rawtypes") | |
40 | 0 | public abstract class RangePartitionerFactory<I extends WritableComparable, |
41 | V extends Writable, E extends Writable, M extends Writable> | |
42 | implements GraphPartitionerFactory<I, V, E, M> { | |
43 | } |