Toward a universal mapping algorithm for accessing trees in parallel memory systems (original) (raw)

Multiple Templates Access of Trees in Parallel Memory Systems

Vincenzo Auletta

Journal of Parallel and Distributed Computing, 1998

View PDFchevron_right

Optimal tree access by elementary and composite templates in parallel memory systems

Vincenzo Auletta

IEEE Transactions on Parallel and Distributed Systems, 2002

View PDFchevron_right

Efficient implementation of tree skeletons on distributed-memory parallel computers

Zhenjiang Hu

2006

View PDFchevron_right

Parallel linear conflict-tree subtree access

Reiner Creutzburg

Lecture Notes in Computer Science, 1987

View PDFchevron_right

Creating a Concurrent In-Memory B-Tree Optimized for NUMA Systems

Marlon McKenzie

2015

View PDFchevron_right

Parallel pointer-based join algorithms in memory mapped environments

N. Nishimura

Proceedings of the Twelfth International Conference on Data Engineering, 1996

View PDFchevron_right

Global Trees: A framework for linked data structures on distributed memory parallel systems

Brian Larkins, Ponnuswamy Sadayappan

2008 SC - International Conference for High Performance Computing, Networking, Storage and Analysis, 2008

View PDFchevron_right

Processing M-trees with parallel resources

Paolo Ciaccia

Proceedings Eighth International Workshop on Research Issues in Data Engineering. Continuous-Media Databases and Applications, 1998

View PDFchevron_right

Efficient parallel algorithms for tree accumulations

Jeremy Gibbons

1994

View PDFchevron_right

Implementation of Parallel Tree Skeletons

Zhenjiang Hu

2002

View PDFchevron_right

Efficient mapping of hierarchical trees on coarse-grain reconfigurable architectures

Marcos Sanchez

2004

View PDFchevron_right

Storage Mapping Optimization for Parallel Programs

VINCENT LEFEBVRE

Lecture Notes in Computer Science, 1999

View PDFchevron_right

Implementation of parallel tree skeletons on distributed systems

Zhenjiang Hu

2002

View PDFchevron_right

Star-coloring of graphs for conflict-free access to parallel memory systems

Irene Finocchi

18th International Parallel and Distributed Processing Symposium, 2004. Proceedings., 2004

View PDFchevron_right

Processing Tree-like Data Structures in Different Computing Platforms

Valery Sklyarov

View PDFchevron_right

Unstructured tree search on SIMD parallel computers

vipin Kumar

1994

View PDFchevron_right

Virtual Cache Line: A New Technique to Improve Cache Exploitation for Recursive Data Structures

Michael Rodeh

Lecture Notes in Computer Science, 1999

View PDFchevron_right

Conflict-free star-access in parallel memory systems

Irene Finocchi

2006

View PDFchevron_right

Concurrent Operations of O2-Tree on Shared Memory Multicore Architectures

Daniel Ohene-Kwofie

ICST Transactions on Scalable Information Systems, 2014

View PDFchevron_right

On a general property of memory mapping tables

Karl Reed

ACM SIGPLAN Notices, 1982

View PDFchevron_right

Redundant memory mappings for fast access to large memories

FURKAN AYAR

Proceedings of the 42nd Annual International Symposium on Computer Architecture, 2015

View PDFchevron_right

Algorithms for Parallel Memory, I: Two-Level Memories

Jeffrey Vitter

View PDFchevron_right

Construction of Tree-Based Indexes for Level-Contiguous Buffering Support

David Hoksza

Proceedings of the 12th …, 2007

View PDFchevron_right

Buffer Trees - Utility and Applications for External Memory Data Processing

Milind Gokhale

View PDFchevron_right

Parallelization with Tree Skeletons

Zhenjiang Hu

Lecture Notes in Computer Science, 2003

View PDFchevron_right

Compile-time techniques for improving scalar access performance in parallel memories

Mary Lou Soffa

IEEE Transactions on Parallel and Distributed Systems, 1991

View PDFchevron_right

Parallel tree building on a range of shared address space multiprocessors: algorithms and application performance

hongzhang shan

2002

View PDFchevron_right