惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

博客园_首页
B
Blog RSS Feed
Microsoft Azure Blog
Microsoft Azure Blog
J
Java Code Geeks
Cyber Security Advisories - MS-ISAC
Cyber Security Advisories - MS-ISAC
Google DeepMind News
Google DeepMind News
F
Fortinet All Blogs
V
V2EX
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
Engineering at Meta
Engineering at Meta
月光博客
月光博客
阮一峰的网络日志
阮一峰的网络日志
M
MIT News - Artificial intelligence
IT之家
IT之家
博客园 - 【当耐特】
U
Unit 42
云风的 BLOG
云风的 BLOG
L
LangChain Blog
小众软件
小众软件
Microsoft Security Blog
Microsoft Security Blog
B
Blog
H
Hackread – Cybersecurity News, Data Breaches, AI and More
宝玉的分享
宝玉的分享
N
Netflix TechBlog - Medium

cs.DC updates on arXiv.org

DUAL-BLADE: Dual-Path NVMe-Direct KV-Cache Offloading for Edge LLM Inference Progressive Semantic Communication for Efficient Edge-Cloud Vision-Language Models Efficient, VRAM-Constrained xLM Inference on Clients Folding Tensor and Sequence Parallelism for Memory-Efficient Transformer Training & Inference DORA: A Scalable Asynchronous Reinforcement Learning System for Language Model Training AMMA: A Multi-Chiplet Memory-Centric Architecture for Low-Latency 1M Context Attention Serving RaMP: Runtime-Aware Megakernel Polymorphism for Mixture-of-Experts Spark Policy Toolkit: Semantic Contracts and Scalable Execution for Policy Learning in Spark Internet of Everything in the 6G Era: Paradigms, Enablers, Potentials and Future Directions PolyKV: A Shared Asymmetrically-Compressed KV Cache Pool for Multi-Agent LLM Inference A Survey on Split Learning for LLM Fine-Tuning: Models, Systems, and Privacy Optimizations ITAS: A Multi-Agent Architecture for LLM-Based Intelligent Tutoring Latency and Cost of Multi-Agent Intelligent Tutoring at Scale TACO: Efficient Communication Compression of Intermediate Tensors for Scalable Tensor-Parallel LLM Training FreeScale: Distributed Training for Sequence Recommendation Models with Minimal Scaling Cost CommFuse: Hiding Tail Latency via Communication Decomposition and Fusion for Distributed LLM Training A Taxonomy and Resolution Strategy for Client-Level Disagreements in Federated Learning Usable Agent Discovery for Decentralized AI Systems Cloud to Edge: Benchmarking LLM Inference On Hardware-Accelerated Single-Board Computers Data-Free Contribution Estimation in Federated Learning using Gradient von Neumann Entropy Shard the Gradient, Scale the Model: Serverless Federated Aggregation via Gradient Partitioning Promoting Simple Agents: Ensemble Methods for Event-Log Prediction GraphLeap: Decoupling Graph Construction and Convolution for Vision GNN Acceleration on FPGA AGNT2: Autonomous Agent Economies on Interaction-Optimized Layer 2 Infrastructure FedSIR: Spectral Client Identification and Relabeling for Federated Learning with Noisy Labels Stream-CQSA: Avoiding Out-of-Memory in Attention Computation via Flexible Workload Scheduling A Delta-Aware Orchestration Framework for Scalable Multi-Agent Edge Computing Federated Learning over Blockchain-Enabled Cloud Infrastructure Optimal Routing for Federated Learning over Dynamic Satellite Networks: Tractable or Not? Sherpa.ai Privacy-Preserving Multi-Party Entity Alignment without Intersection Disclosure for Noisy Identifiers
Views: A Hardware-Aware Recursively Labeled Graph Databas...
[Submitted on 25 Aug 2025 (v1), last revised 17 Sep 2026 (this v · 2025-08-25 · via cs.DC updates on arXiv.org

View PDF HTML (experimental)

Abstract:Knowledge representation remains a central challenge for reasoning-centered artificial intelligence, particularly when semantic structures involve relations over relations, contextual annotations, and recursively nested descriptions. This paper introduces Views, a recursively labeled graph database (GDB) model designed to represent such graph-structured knowledge within a uniform graph abstraction while retaining a hardware-aware organization for associative search and traversal. The model refactors directed labeled graphs into linked-list-like chains of linknodes, supports recursive labeling of vertices and edges, and admits mappings from RDF- and LPG-style graph representations. We describe the data structure, its hardware-oriented memory mappings under the Associative Chip Architecture (ASOCA), and selected associative operations for retrieval over Views-based GDBs. We then evaluate storage footprint under stated mapping and store boundaries using three scales of the Social Network Benchmark published by the Linked Data Benchmark Council, and characterize directed K-hop traversal on an Associative Memory Chip III (ASOCA3) FPGA implementation. The storage results show that allocation and entry width materially affect the reported footprints rather than establishing an intrinsic advantage for Views, while the K-hop measurements show increasing mean returned-vertex count and mean latency with hop bound over the fixed resident graph image. Worked semantic-reasoning and Copycat-inspired examples further illustrate how retrieval operations can be composed over the model, rather than providing application-level reasoning or cognitive validation. Taken together, these results position Views as a model-architecture co-design for associative storage and selected graph traversal under the stated conditions; broader database workloads and end-to-end reasoning applications remain to be evaluated.

Submission history

From: Yanjun Yang [view email]
[v1] Mon, 25 Aug 2025 15:30:33 UTC (123 KB)
[v2] Thu, 13 Nov 2025 20:02:56 UTC (146 KB)
[v3] Thu, 17 Sep 2026 13:37:11 UTC (66 KB)