CGCL-codes / RGraphLinks
RGraph is an RDMA-assisted asynchronous distributed graph processing system. RGraph distributes edges into two parts to isolate master and mirror vertices. RGraph exploits the asymmetry of RDMA to accelerate the one-to-many communication between master and mirror vertices. The results in comprehensive experiments show that compared to existing …
☆14Updated 4 years ago
Alternatives and similar repositories for RGraph
Users that are interested in RGraph are comparing it to the libraries listed below
Sorting:
- Argus is a novel RDMA-assisted job scheduler which achieves high resource utilization by fully exploiting the structure feature of stage …☆10Updated 4 years ago
- A scalable distributed stream join system☆14Updated 3 years ago
- Pensieve is a skewness-aware multi-version graph processing system that exploits the time locality of graph version access and leverages …☆21Updated 4 years ago
- ☆34Updated last year
- Article: GPU-accelerated Proximity Graph Approximate Nearest Neighbor Search and Construction by Authors Yuanhang Yu, Dong Wen, Ying Zhan…☆22Updated 6 months ago
- "GraphOne: A Data Store for Real-time Analytics on Evolving Graphs", Usenix FAST'19☆60Updated 4 years ago
- ☆31Updated 5 years ago
- ☆21Updated last year
- ☆12Updated last year
- HyTGraph: GPU-Accelerated Graph Processing with Hybrid Transfer Management☆34Updated 3 years ago
- A SSD-based graph processing engine for billion-node graphs☆12Updated 10 years ago
- ☆77Updated last year
- A low-latency, billion-scale, and updatable graph-based vector store on SSD.☆84Updated 2 weeks ago
- RisGraph: A Real-Time Streaming System for Evolving Graphs to Support Sub-millisecond Per-update Analysis at Millions Ops/s☆36Updated 3 years ago
- ☆42Updated 4 years ago
- Experimental Code for "Unleashing Graph Partitioning for Large-Scale Nearest Neighbor Search"☆25Updated last year
- A computation-centric distributed graph processing system.☆328Updated 4 years ago
- Experimental Setup for Performance Analysis of Streaming Algorithms☆32Updated 4 years ago
- ☆39Updated 6 years ago
- LDCF is a novel efficient approximate set representation structure for large-scale dynamic data sets. LDCF uses a novel multi-level tree …☆14Updated 4 years ago
- GPU-accelerated vector query processing system that supports large vector datasets beyond GPU memory.☆38Updated last year
- FlashMob is a shared-memory random walk system.☆32Updated 2 years ago
- Source code for the paper: "Accelerating Graph Indexing for ANNS on Modern CPUs"☆29Updated last month
- ☆15Updated 8 months ago
- Graphene: Fine-Grained IO Management for Graph Computing. FAST'17☆20Updated 8 years ago
- Transforming Graphs for Efficient Irregular Graph Processing on GPUs☆51Updated 3 years ago
- ☆12Updated 3 years ago
- Terrace: A Hierarchical Graph Container for Skewed Dynamic Graphs☆28Updated 2 years ago
- ☆26Updated 3 years ago
- Simois is a scalable distributed stream join system, which supports efficient join operations in two streams with highly skewed data dist…☆13Updated 3 years ago