CGCL-codes / Argus
Argus is a novel RDMA-assisted job scheduler which achieves high resource utilization by fully exploiting the structure feature of stage dependency. Comprehensive experiments using large-scale traces collected from real world show that Argus reduces job completion time and job makespan by 21% and 20%, respectively, compared to RDMA-Spark.
☆10Updated 3 years ago
Alternatives and similar repositories for Argus:
Users that are interested in Argus are comparing it to the libraries listed below
- RGraph is an RDMA-assisted asynchronous distributed graph processing system. RGraph distributes edges into two parts to isolate master an…☆14Updated 3 years ago
- A scalable distributed stream join system☆14Updated 2 years ago
- Better Choice Cuckoo Filter (BCF) is an efficient approximate set representation data structure. Different from the standard Cuckoo Filte…☆12Updated 5 years ago
- Simois is a scalable distributed stream join system, which supports efficient join operations in two streams with highly skewed data dist…☆13Updated 2 years ago
- PStream is a popularity-aware differentiated distributed stream processing system, which identifies the popularity of keys in the stream …☆14Updated 2 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 3 years ago
- Horae is a graph stream summarization structure for efficient temporal range queries. Horae can deal with temporal queries with arbitrary…☆21Updated 2 years ago
- Pensieve is a skewness-aware multi-version graph processing system that exploits the time locality of graph version access and leverages …☆20Updated 3 years ago
- Dynamic Cuckoo Filter (DCF) is succinct data structure of approximate set representing and membership testing for large-scale dynamic dat…☆39Updated 7 years ago
- A persistent learned index for non-volatile memory with high read/write performance.☆15Updated 2 years ago
- ☆10Updated 8 months ago
- A SSD-based graph processing engine for billion-node graphs☆11Updated 9 years ago
- FINEdex: A Fine-grained Learned Index Scheme for Scalable and Concurrent Memory Systems☆30Updated 2 years ago
- Revisiting Secondary Indexing in LSM-based Storage Systems with Persistent Memory☆17Updated last year
- ☆16Updated 3 years ago
- [VLDB 2022] NFL: Robust Learned Index via Distribution Transformation☆19Updated last year
- Updatable Learned Index with Precise Positions☆53Updated 2 years ago
- High Performance Learned Index on Persistent Memory☆46Updated last year
- ☆14Updated last year
- Nap - NUMA-Aware Persistent Indexes☆41Updated 3 years ago
- GRE is a benchmark suite to compare learned indexes and traditional indexes.☆45Updated 2 years ago
- RisGraph: A Real-Time Streaming System for Evolving Graphs to Support Sub-millisecond Per-update Analysis at Millions Ops/s☆35Updated 2 years ago
- HyTGraph: GPU-Accelerated Graph Processing with Hybrid Transfer Management☆20Updated 2 years ago
- Range Optimized Adaptive Radix Tree☆22Updated last year
- This project aims at building a scalable transactional stream processing engine on modern hardware. It allows ACID transactions to be run…☆76Updated 2 weeks ago
- A Learned Index for Log-Structured Merge Trees☆45Updated last year
- MioDB: Devouring Data Byte-addressable LSM-based KV Stores for Hybrid Memory☆16Updated 2 years ago
- Official code of our work, VCSR: Mutable CSR Graph Format Using Vertex-Centric Packed Memory Array [CCGrid 2022].☆11Updated 2 years ago
- Source code for NVAlloc-ASPLOS'22☆31Updated 2 years ago
- A high-performance distributed graph database based on RDMA.☆16Updated 2 years ago