ANALYSIS OF PRAM INSTRUCTION SETS FROM A LOG COST PERSPECTIVE

DOI10.1142/S0129054194000128MaRDI QIDQ4853322zbMATH OpenOpenAlexFDO

Authors Sundararajan Vedantham, Jerry L. Trahan

Publication date 29 October 1995

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

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

zbMATH Keywords

time complexityparallel complexity classeslog cost measure

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Recommendations

• On the performance and cost of some PRAM models on CMP hardware
• An insight on PRAM computational bounds
• PRAM processor allocation: a hidden bottleneck in sublogarithmic algorithms
• Processor-time tradeoffs in PRAM simulations
• A general framework for static cost analysis of parallel logic programs
• scientific article; zbMATH DE number 1998328
• Analysis of an asynchronous PRAM algorithm
• The complexity of deterministic PRAM simulation on distributed memory machines
• scientific article; zbMATH DE number 1848398
• Improved memory utilization in deterministic PRAM simulation

Cited in

(1)

• Imperative process algebra and models of parallel computation

This page was built for publication: ANALYSIS OF PRAM INSTRUCTION SETS FROM A LOG COST PERSPECTIVE

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