awesome-repositories.com
Blog
awesome-repositories.com

Descoperă cele mai bune repository-uri open source cu căutare AI.

ExploreazăCăutări recomandateAlternative open-sourceSoftware self-hostedBlogHartă site
ProiectDespreCum realizăm clasamentulPresăServer MCP
LegalConfidențialitateTermeni
© 2026 Bringes Technology SRL·VAT RO45896025·hello@awesome-repositories.com
·

6 repository-uri

Awesome GitHub RepositoriesGraph Partitioning Utilities

Tools for segmenting large graph structures into smaller subgraphs for memory-efficient processing.

Distinct from Graph Processing: Distinct from general graph processing: focuses specifically on memory-efficient partitioning for mini-batch training.

Explore 6 awesome GitHub repositories matching data & databases · Graph Partitioning Utilities. Refine with filters or upvote what's useful.

Awesome Graph Partitioning Utilities GitHub Repositories

Găsește cele mai bune repo-uri cu AI.Vom căuta cele mai potrivite repository-uri folosind AI.
  • pyg-team/pytorch_geometricAvatar pyg-team

    pyg-team/pytorch_geometric

    23,838Vezi pe GitHub↗

    This project is a deep learning library designed for training neural networks on irregular data structures, including graphs, 3D meshes, and point clouds. It functions as an extension to the PyTorch framework, providing specialized layers and kernels that enable the processing of complex, non-Euclidean information. The library distinguishes itself through a geometric deep learning toolkit that manages the unique requirements of graph-based data. It utilizes sparse matrix-based message passing to aggregate information across nodes and employs dynamic computational graph construction to accommo

    Segments large graph structures into smaller subgraphs to allow memory-efficient processing of datasets that exceed single-device capacity.

    Pythondeep-learninggeometric-deep-learninggraph-convolutional-networks
    Vezi pe GitHub↗23,838
  • dmlc/dglAvatar dmlc

    dmlc/dgl

    14,283Vezi pe GitHub↗

    DGL is a Python library for building and training graph neural networks. It functions as a graph message passing framework and a geometric deep learning tool, enabling the development of models that analyze graph-structured data. The library is designed for large-scale graph processing, utilizing distributed training and neighbor sampling to handle datasets with billions of edges. It provides specialized support for heterogeneous graph modeling, allowing for the representation of complex real-world entities with multiple node and edge types. Its capabilities cover a wide range of graph tasks

    Implements utilities for splitting large-scale graphs across multiple machines to enable training on massive datasets.

    Pythondeep-learninggraph-neural-networks
    Vezi pe GitHub↗14,283
  • thinkaurelius/titanAvatar thinkaurelius

    thinkaurelius/titan

    5,228Vezi pe GitHub↗

    Titan este o bază de date graf distribuită și un motor de calcul conceput pentru stocarea și interogarea seturilor masive de date de noduri și muchii interconectate în clustere multi-mașină. Funcționează ca un strat de stocare graf scalabil și un magazin tranzacțional, oferind un framework pentru executarea sarcinilor de procesare graf la scară largă și a traversărilor profunde. Sistemul se distinge prin backend-ul său de stocare pluggable, care decuplează motorul graf de stratul de persistență fizică. Utilizează partiționarea datelor de tip vertex-cut pentru a echilibra sarcinile de procesare și un model de proprietăți set-cardinality care permite proprietăților unice să stocheze mai multe valori. Platforma acoperă o gamă largă de capabilități, inclusiv indexarea graf multi-model pentru căutări geografice și full-text, gestionarea globală a schemei pentru re-indexarea seturilor de date și operațiuni tranzacționale asigurate prin write-ahead logging. De asemenea, încorporează expirarea elementelor prin setări de tip time-to-live și monitorizarea performanței sistemului pentru urmărirea activității de interogare și a latenței tranzacțiilor.

    Balances cluster load by segmenting large graph structures into smaller subgraphs using vertex or edge cuts.

    Java
    Vezi pe GitHub↗5,228
  • facebookincubator/aitemplateAvatar facebookincubator

    facebookincubator/AITemplate

    4,720Vezi pe GitHub↗

    AITemplate is an ahead-of-time deep learning compiler that translates PyTorch neural networks into standalone C++ source code. It functions as a PyTorch to C++ compiler and a GPU kernel fusion engine, producing self-contained executable binaries that run inference without requiring a Python interpreter or deep learning framework runtime. The project generates optimized CUDA and HIP C++ code specifically for NVIDIA TensorCores and AMD MatrixCores. It focuses on maximizing throughput for half-precision floating-point operations through a system that combines multiple neural network operators in

    Handles unsupported operators by delegating specific graph segments to an external engine while accelerating the rest.

    Python
    Vezi pe GitHub↗4,720
  • mapillary/opensfmAvatar mapillary

    mapillary/OpenSfM

    3,786Vezi pe GitHub↗

    OpenSfM is a computer vision library and structure-from-motion pipeline designed to reconstruct three-dimensional scenes and camera trajectories from overlapping images. It functions as a 3D reconstruction engine and photogrammetry toolkit, utilizing automated feature-based image matching and incremental bundle adjustment to derive spatial geometry. The system distinguishes itself as a geospatial alignment tool, integrating GPS and inertial sensor data to align reconstructed 3D models with real-world geographic coordinates. It employs a hybrid Python and C++ execution model to manage large-sc

    Organizes large image collections into manageable sub-graphs to reduce the computational complexity of reconstruction.

    Python
    Vezi pe GitHub↗3,786
  • pythonot/potAvatar PythonOT

    PythonOT/POT

    2,751Vezi pe GitHub↗

    POT is an optimal transport library providing a collection of solvers for computing Wasserstein, Gromov-Wasserstein, and Fused Gromov-Wasserstein distances between probability distributions. It functions as a differentiable tensor framework that integrates with various tensor libraries to enable automatic differentiation and GPU acceleration. The project is distinguished by its ability to align data distributions across different metric spaces by comparing internal relational structures rather than coordinates. It implements mathematical optimization algorithms as differentiable layers, allow

    Divides graphs into clusters and selects representative nodes to optimize the performance of quantized transport solvers.

    Pythondomain-adaptationemdgromov-wasserstein
    Vezi pe GitHub↗2,751
  1. Home
  2. Data & Databases
  3. Graph Computing Systems
  4. Graph Processing
  5. Graph Partitioning Utilities

Explorează sub-etichetele

  • Accelerator Graph Delegation1 sub-tagThe process of offloading partitioned model subgraphs to specialized hardware accelerators. **Distinct from Graph Partitioning Utilities:** Distinct from Graph Partitioning Utilities: focuses on the delegation of operations to hardware rather than general memory-efficient segmentation.