Achieving scalable locality with time skewing

DOI10.1023/A:1015460304860zbMATH Open1019.68024OpenAlexW1561247983MaRDI QIDQ698134FDOQ698134

Authors: David Wonnacott 

Publication date: 18 September 2002

Published in: International Journal of Parallel Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1015460304860

Recommendations

• The Effect of Time Constraints on Scaled Speedup
• Locality approximation using time
• scientific article; zbMATH DE number 2060813
• Exploiting locality in LT-RAM computations
• scientific article; zbMATH DE number 1756010

zbMATH Keywords

compute balancemachine balancememory localityscalable localitystorage transformation

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19)

Cited In (2)

• Out-of-core computations of high-resolution level sets by means of code transformation
• Heterogeneous LBM Simulation Code with LRnLA Algorithms

This page was built for publication: Achieving scalable locality with time skewing

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