pith. sign in

arxiv: cs/9810002 · v1 · submitted 1998-10-02 · 💻 cs.DC · cs.DB

Pre-fetching tree-structured data in distributed memory

classification 💻 cs.DC cs.DB
keywords pre-fetchingbenefitsperformancecontroldatadistributedaccessap1000
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.