Pre-fetching tree-structured data in distributed memory

10/02/1998
by   Lex Weaver, et al.
0

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 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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/25/2021

Revisiting Pre-analysis Information Based Rate Control in x265

Due to the excellent compression and high real-time performance, x265 is...
research
12/13/2017

Persistent Memory Programming Abstractions in Context of Concurrent Applications

The advent of non-volatile memory (NVM) technologies like PCM, STT, memr...
research
01/07/2021

Neural Storage: A New Paradigm of Elastic Memory

Storage and retrieval of data in a computer memory plays a major role in...
research
07/16/2018

Tiered Object Storage using Persistent Memory

Most data intensive applications often access only a few fields of the o...
research
01/22/2018

ACGreGate: A Framework for Practical Access Control for Applications using Weakly Consistent Databases

Scalable and highly available systems often require data stores that off...
research
01/16/2018

Debugging Framework Applications: Benefits and Challenges

Aspects of frameworks, such as inversion of control and the structure of...
research
02/18/2020

Mapping the Interplanetary Filesystem

The Interplanetary Filesystem (IPFS) is a distributed data storage servi...

Please sign up or login with your details

Forgot password? Click here to reset