arXiv (All)
open access
Distributing Context-Aware Shared Memory Data Structures: A Case Study on Singly-Linked Lists
In this paper, we study the partitioning of a context-aware shared memory data structure so that it can be implemented as a distributed data structure running on multiple machines. By context-aware data structures, we mean that the result of an operation not only depends upon the value of the shared
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
- A Storage-Retrieval Gap in Parametric Knowledge Graph Memory#984235
- Radical Knowledge Minimalism#725402
- Integration of data management systems on a computer network#208876
- A Persistent Object Manager for HEP#640583
- Advanced Python Scripting for Storage Automation#85254
Record · ID 820143
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