Pre-fetching tree-structured data in distributed memory

Details Pre-fetching tree-structured data in distributed memory Pre-fetching tree-structured data in distributed memory

1998-10-02

arxiv.org/abs/cs/9810002v1

Proceedings of the Third Fujitsu Parallel Computing Workshop, pages P1-J-1 to P1-J-8, Kawasaki, Japan, November 1994. Fujitsu

Computer Science

Distributed, Parallel, and Cluster Computing

8 pages; added PDF version

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Pre-fetching tree-structured data in distributed memory does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Pre-fetching tree-structured data in distributed memory, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Pre-fetching tree-structured data in distributed memory will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-341613