On the performance and cost of some PRAM models on CMP hardware

DOI10.1142/S0129054110007325MaRDI QIDQ3569283zbMATH OpenOpenAlexFDO

Authors Martti Forsell

Publication date 18 June 2010

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0129054110007325

zbMATH Keywords

performanceparallel computingPRAMpower consumptionsilicon area

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Recommendations

• On the cost-effectiveness of PRAMs
• PRAMs with variable word-size
• A practical hierarchical model of parallel computation. I: The model
• scientific article; zbMATH DE number 1337740
• ON THE POWER OF SOME PRAM MODELS

Cites work

• scientific article; zbMATH DE number 4039251 (Why is no real title available?)
• Dynamic Perfect Hashing: Upper and Lower Bounds
• Fast algorithms for a class of temporal range queries.
• How to emulate shared memory
• On the performance and cost of some PRAM models on CMP hardware
• Ultracomputers

Cited in

(4)

• Mathematical Foundations of Computer Science 2004
• scientific article; zbMATH DE number 2090574 (Why is no real title available?)
• On the performance and cost of some PRAM models on CMP hardware
• ANALYSIS OF PRAM INSTRUCTION SETS FROM A LOG COST PERSPECTIVE

This page was built for publication: On the performance and cost of some PRAM models on CMP hardware

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