FAST, EFFICIENT MUTUAL AND SELF SIMULATIONS FOR SHARED MEMORY AND RECONFIGURABLE MESH

DOI10.1080/10637199608915553MaRDI QIDQ4820153zbMATHOpenAlexFDO

Authors Y. Matias, Assaf Schuster

Publication date 6 October 2004

Published in Parallel Algorithms and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/10637199608915553

Mathematics Subject Classification ID

Cites work

• scientific article; zbMATH DE number 5542185 (Why is no real title available?)
• scientific article; zbMATH DE number 3767009 (Why is no real title available?)
• scientific article; zbMATH DE number 107951 (Why is no real title available?)
• A complexity theory of efficient parallel algorithms
• A note on Graham's bound
• An Optimal Randomized Parallel Algorithm for Finding Connected Components in a Graph
• Complexity of Sub-Bus Mesh Computations
• Efficient Schemes for Parallel Communication
• Exact lower time bounds for computing Boolean functions on CREW PRAMs
• On Finding Lowest Common Ancestors: Simplification and Parallelization
• Optimal bounds for decision problems on the CRCW PRAM
• Optimal simulation of multidimensional reconfigurable meshes by two- dimensional reconfigurable meshes
• Parallel hashing
• Parallelism in Comparison Problems
• Recursive Star-Tree Parallel Data Structure
• Sorting on PRAMs with reconfigurable buses
• The Parallel Simplicity of Compaction and Chaining
• Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes

Cited in

(1)

• Simulating shared memory in real time: On the computation power of reconfigurable architectures

This page was built for publication: FAST, EFFICIENT MUTUAL AND SELF SIMULATIONS FOR SHARED MEMORY AND RECONFIGURABLE MESH

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