Exploiting locality in LT-RAM computations

DOI10.1007/3-540-58218-5_31MaRDI QIDQ5054773zbMATH OpenOpenAlexFDO

Authors Tim Harris, Jop F. Sibeyn

Publication date 9 December 2022

Published in Algorithm Theory — SWAT '94 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-58218-5_31

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Analysis of algorithms (68W40)

Recommendations

• A new model for large memories
• scientific article; zbMATH DE number 512978
• A model of sequential computation with Pipelined access to memory
• Computing with pipelined block transfer
• On approximating the ideal random access machine by physical machines

Cites work

• An \(O(IVI^3)\) algorithm for finding maximum flows in networks
• scientific article; zbMATH DE number 1003300 (Why is no real title available?)
• scientific article; zbMATH DE number 52113 (Why is no real title available?)
• scientific article; zbMATH DE number 3475221 (Why is no real title available?)

Cited in

(11)

• A new model for large memories
• Computing with pipelined block transfer
• Translating submachine locality into locality of reference
• On a model of virtual address translation
• A model of sequential computation with Pipelined access to memory
• Delegating RAM Computations
• On approximating the ideal random access machine by physical machines
• scientific article; zbMATH DE number 1756010 (Why is no real title available?)
• Memory-Link Compression Schemes: A Value Locality Perspective
• The cost of address translation
• Achieving scalable locality with time skewing

This page was built for publication: Exploiting locality in LT-RAM computations

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