scientific article; zbMATH DE number 177541

MaRDI QIDQ4037410zbMATH OpenFDO

Authors Selim G. Akl

Publication date 18 May 1993

zbMATH Keywords

concurrent memory accessPRAMslowdown theoremspeedup theorem

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Distributed algorithms (68W15)

Recommendations

• Parallelism in random access machines
• Parallel random access machines with bounded memory wordsize
• PRAMs with variable word-size
• scientific article; zbMATH DE number 996551
• Relations between Concurrent-Write Models of Parallel Computation

Cited in

(12)

• On XRAM and PRAM models, and on data-movement-intensive problems
• PRAMs with variable word-size
• Can a shared-memory model serve as a bridging model for parallel computation?
• On the cost-effectiveness of PRAMs
• Bulk synchronous parallel algorithms for the external memory model
• The local memory access sequence of multiple induction variables on distributed memory machines
• The latency-of-data-access model for analyzing parallel computation
• A model of sequential computation with Pipelined access to memory
• scientific article; zbMATH DE number 3938524 (Why is no real title available?)
• From parallelism to nonuniversality: an unconventional trajectory
• Parallel random access machines with bounded memory wordsize
• Conflict-free star-access in parallel memory systems

This page was built for publication:

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