arXiv (All)
open access
Topology Survives Shuffling: Robust Long-Context Memory Access Prediction for Graph Analytics
Graph analytics generates irregular, topology-dependent memory-access streams via indirect traversals, limiting data prefetching. Accurate prediction enables timely prefetches that hide memory latency. However, ML predictors couple short histories with fixed horizons, fitting the training trace's no
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Hybrid Graph-Machine Learning Framework for Accurate and Interpretable Band Gap Prediction.#14952
- Reproducibility Challenges in Computational Network Science: Evidence, Causes, and Recommendations#1037597
- Federated Community Detection in Bipartite Networks#1401183
- OpenRTAG: A Comprehensive Benchmark for Robust Text-Attributed Graph Learning under Data Quality Degradation#386919
- Execution-Feasible Dispatch of LLM Pre-training Loads for Renewable-Dominant AI Data Centers#1297399
Record · ID 1490872
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive