ON THE POWER OF SOME PRAM MODELS

DOI10.1080/01495739908947372MaRDI QIDQ4242705zbMATH OpenOpenAlexFDO

Authors Selim G. Akl, Lin Chen

Publication date 12 January 2000

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

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

zbMATH Keywords

PRAMsimulationsorting

Mathematics Subject Classification ID

Computer system organization (68M99) Nonnumerical algorithms (68W05)

Recommendations

• On separating the EREW and CREW PRAM models
• Sorting on PRAMs with reconfigurable buses
• On the power of concurrent-write PRAMs with read-only memory
• Processor-time tradeoffs in PRAM simulations

Cites work

• Efficient parallel recognition of some circular arc graphs. II
• Faster optimal parallel prefix sums and list ranking
• Finding the maximum, merging, and sorting in a parallel computation model
• Optimal bounds for decision problems on the CRCW PRAM
• Optimal parallel time bounds for the maximum clique problem on intervals
• Parallel Merge Sort
• Parallel Prefix Computation
• Simulations among concurrent-write PRAMs
• The Parallel Evaluation of General Arithmetic Expressions

Cited in

(8)

• On separating the EREW and CREW PRAM models
• Basic algorithms for the MRMW PRAM model
• A theorem on the relation between \(\text{BSR}_k\) and \(\text{BSR}^+\)
• Optimal computation of shortest paths on doubly convex bipartite graphs
• On the performance and cost of some PRAM models on CMP hardware
• scientific article; zbMATH DE number 1760030 (Why is no real title available?)
• Computing with spikes: the advantage of fine-grained timing
• An Improved Parallel Prefix Sums Algorithm

This page was built for publication: ON THE POWER OF SOME PRAM MODELS

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