Layouts for improved hierarchical parallel computations

DOI10.1016/J.JDA.2014.06.002zbMATH Open1305.68087OpenAlexW2083617241MaRDI QIDQ405569FDOQ405569

Authors Michael J. Hirsch, Shmuel T. Klein, Yair Toaff

Publication date 5 September 2014

Published in Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jda.2014.06.002

zbMATH Keywords

data compressionmodular arithmeticparallel processors

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Parallel algorithms in computer science (68W10) Algorithms on strings (68W32)

Recommendations

• Efficient parallel computations on the reduced mesh of trees organization
• An approach to parallel algorithm design
• Applying Parallel Computation Algorithms in the Design of Serial Algorithms
• Efficient algorithms for mapping and partitioning a class of parallel computations
• Bit serial addition trees and their applications

Cites work

• scientific article; zbMATH DE number 4061138 (Why is no real title available?)
• A method for obtaining digital signatures and public-key cryptosystems
• A public key cryptosystem and a signature scheme based on discrete logarithms
• Efficient randomized pattern-matching algorithms
• Improving deduplication techniques by accelerating remainder calculations
• Parallel Prefix Computation

Cited in

(2)

• Modifying CLJP to select grid hierarchies with lower operator complexities and better performance
• Hierarchical parallel evaluation of a Hamming code

This page was built for publication: Layouts for improved hierarchical parallel computations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q405569)