-
### 🚀 The feature, motivation and pitch
CUDAGraphs has limitations on what it can support. We fallback for:
- unsupported operators: operators which trigger d->h, h->d, or which have syncs.
- cp…
-
What is the graph partitioning that is used in this source code? Does every run of a certain s-t query, return the same shortest (fastest) path, or it might be slightly different because of having a d…
-
There's an option named 'num_partitions' in [pytorch-biggraph](https://github.com/facebookresearch/PyTorch-BigGraph) that can reduce the peak memory usage, Can Cleora provide that option too? is it po…
-
Hi, I'm particularly interested in BGL's graph partitioning module for my own research. I would love to see BGL's implementation of it if possible. Any chance it can be released soon?
-
... as a first step for divide&conquer version of Brandes algorithm
-
Idea for a future enhancement: visualization of graph partitioning algorithms. There are many algorithms that could be considered, but this data and mapping functionality is appropriate to support vis…
-
@Zainab-Abbas has developed several streaming partitioning algorithms in [her fork](https://github.com/Zainab-Abbas/gelly-streaming/tree/zainabl/src/main/java/org/apache/flink/graph/streaming/partitio…
vasia updated
5 years ago
-
## 🔨Work Item
**IMPORTANT:**
* This template is only for dev team to track project progress. For feature request or bug report, please use the corresponding issue templates.
* DO NOT create a new…
-
When I run the `backward_facing_step_3d` example and set `NPROCS` to a value greater than 128 and run the program on two nodes using `make run`, I encounter empty partitions, which cause the program t…
-
It seems that an exception is thrown if a layered, partitioned graph has a not-partitioned node with:
- a source with high partition
- a target with low partition
- a second target with highest par…