Efficient Parallel Tree Reductions on Distributed Memory Environments

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-540-72586-2_88
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

A Space-Efficient Parallel Algorithm for Computing Betweenness Centrality in Distributed Memory

2010English

Distributed, Shared-Memory Parallel Triangle Counting

2018English

Spatial Partitioning for Parallel Hierarchical Radiosity on Distributed Memory Architectures

2001English

Efficient Support for Irregular Applications on Distributed-Memory Machines

ACM SIGPLAN Notices
1995English

Partitioning B+-Tree in Parallel and Distributed Computing Environment.

English

Interactive-Rate Animation Generation by Parallel Progressive Ray-Tracing on Distributed-Memory Machines

Journal of Parallel and Distributed Computing
Computer NetworksHardwareCommunicationsArchitectureTheoretical Computer ScienceArtificial IntelligenceSoftware
2000English

Willows: A Memory Efficient Tree and Forest Construction Package

BMC Bioinformatics
BiochemistryApplied MathematicsComputer Science ApplicationsStructural BiologyMolecular Biology
2009English

Efficient Monte Carlo Decision Tree Solution in Dynamic Purchasing Environments

2003English

Implementation of a Fully Balanced Periodic Tridiagonal Solver on a Parallel Distributed Memory Architecture

Concurrency: Practice and Experience
1995English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy