Pre-fetching tree-structured data in distributed memory
Lex Weaver, Chris Johnson
Abstract
A distributed heap storage manager has been implemented on the Fujitsu AP1000 multicomputer. The performance of various pre-fetching strategies is experimentally compared. Subjective programming benefits and objective performance benefits of up to 10% in pre-fetching are found for certain applications, but not for all. The performance benefits of pre-fetching depend on the specific data structure and access patterns. We suggest that control of pre-fetching strategy be dynamically under the control of the application.
Create a lesson
Related papers
Consensus with Stochastic Broadcast
Pierre Fraigniaud, Boaz Patt-Shamir, Sergio Rajsbaum
Decoupled I/O-Dominant Pipelines for Large-Scale Whole-Slide Image Embedding Extraction
Mayanka Chandrashekar, Xi Zhang, Ethan Seefried et al.
Sintr: Safe Interactive Transactions in the Presence of Byzantine Clients
Austin T. Li, Daniel H. Lee, Lorenzo Alvisi et al.
Benchmarking Confidential Computing Performance on NVIDIA Blackwell GPUs
Daniyal Khan, Amean Asad, Ansgar Grunseid
Optimizing API Gateway Placement in Multi-Cloud Kubernetes
Vinoth Punniyamoorthy, Murali Shankar Dulam, Aswathnarayan Muthukrishnan Kirubakaran et al.
VPP: Virtual Pipeline Parallelism for Efficient Chunked Prefill in Long-Context LLM Inference
Yan Shi, Xiaochao Wang, Jingchun Gao et al.