On approximating the ideal random access machine by physical machines

DOI10.1145/1552285.1552288MaRDI QIDQ3452223zbMATH OpenOpenAlexFDO

Authors Gianfranco Bilardi, Kattamuri Ekanadham, Pratap Pattnaik

Publication date 11 November 2015

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1552285.1552288

zbMATH Keywords

physical constraints on machinespipelined hierarchical memoryspeculative processors

Mathematics Subject Classification ID

Mathematical problems of computer architecture (68M07)

Recommendations

• scientific article; zbMATH DE number 3954278
• Parallelism in random access machines
• Exploiting locality in LT-RAM computations
• scientific article; zbMATH DE number 1339957
• scientific article; zbMATH DE number 4051005

Cited in

(3)

• Exploiting locality in LT-RAM computations
• scientific article; zbMATH DE number 3986645 (Why is no real title available?)
• Feasible real random access machines

This page was built for publication: On approximating the ideal random access machine by physical machines

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