Pre-fetching tree-structured data in distributed memory
| dc.creator | Weaver, Lex | |
| dc.creator | Johnson, Chris | |
| dc.date | 1998-10-02 | |
| dc.date.accessioned | 2026-07-07T03:23:43Z | |
| dc.date.available | 2026-07-07T03:23:43Z | |
| dc.description | 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. | |
| dc.description | 8 pages; added PDF version | |
| dc.identifier | https://arxiv.org/abs/cs/9810002 | |
| dc.identifier | http://arxiv.org/abs/cs/9810002 | |
| dc.identifier | Proceedings of the Third Fujitsu Parallel Computing Workshop, pages P1-J-1 to P1-J-8, Kawasaki, Japan, November 1994. Fujitsu Laboratories Ltd | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/33054 | |
| dc.subject | Distributed, Parallel, and Cluster Computing | |
| dc.subject | Databases | |
| dc.subject | H.3.4 | |
| dc.title | Pre-fetching tree-structured data in distributed memory | |
| dc.type | text |