Using PRAM algorithms on a uniform-memory-access shared-memory architecture
From MaRDI portal
Recommendations
- A fast, parallel spanning tree algorithm for symmetric multiprocessors (SMPs)
- Evaluating arithmetic expressions using tree contraction: A fast and scalable parallel implementation for symmetric multiprocessors (SMPs) (Extended abstract)
- On the cost-effectiveness of PRAMs
- scientific article; zbMATH DE number 4128411
- How to share memory in a distributed system
Cited in
(4)- Evaluating arithmetic expressions using tree contraction: A fast and scalable parallel implementation for symmetric multiprocessors (SMPs) (Extended abstract)
- Parallel Algorithms for Colouring Vertices of Graph Using Bit Manipulation
- ANALYSIS OF PRAM INSTRUCTION SETS FROM A LOG COST PERSPECTIVE
- Fast rehashing in PRAM emulations
This page was built for publication: Using PRAM algorithms on a uniform-memory-access shared-memory architecture
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4785578)