S-Space: Seoul National University
metadata only
FlexiWalker: Extensible GPU Framework for Efficient Dynamic Random Walks with Runtime Adaptation
Dynamic random walks are fundamental to various graph analysis applications, offering advantages by adapting to evolving graph properties. Their runtime-dependent transition probabilities break down the pre-computation strategy that underpins most existing CPU and GPU static random walk optimization
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
- Accelerating Dynamic Graph Clustering on GPU Architectures with cuGraph#429327
- Exploiting Dependency and Parallelism: Real-Time Scheduling and Analysis for GPU Tasks#2742
- Agentic CPU-GPU Scheduling for Heterogeneous AI Workloads#405626
- Graph Traversal on Tensor Cores: A BFS Framework for Modern GPUs#259426
- SAGA: Workflow-Atomic Scheduling for AI Agent Inference on GPU Clusters#151760
Record · ID 1428309
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