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

DOI10.1142/S0129054110007325zbMATH Open1192.68276OpenAlexW2000022682MaRDI QIDQ3569283FDOQ3569283

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

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

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)

Cites Work

• Title not available (Why is that?)
• Dynamic Perfect Hashing: Upper and Lower Bounds
• How to emulate shared memory
• Ultracomputers
• Fast algorithms for a class of temporal range queries.
• On the performance and cost of some PRAM models on CMP hardware

Cited In (4)

• Mathematical Foundations of Computer Science 2004
• Title not available (Why is that?)
• 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)