Upper and lower I/O bounds for pebbling \(r\)-pyramids

DOI10.1016/j.jda.2011.12.005zbMath1247.68036OpenAlexW1997947415MaRDI QIDQ450538

Desh Ranjan, Mohammad Zubair, John E. Savage

Publication date: 13 September 2012

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2011.12.005

zbMATH Keywords

lower boundsmemory hierarchyI/O

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Uses Software

• LAPACK
• GEMM
• BLAS

Cites Work

• An observation on time-storage trade off
• Cache-optimal algorithms for option pricing
• Anatomy of high-performance matrix multiplication
• LAPACK Users' Guide
• The design, implementation, and evaluation of a symmetric banded linear solver for distributed-memory parallel computers
• GEMM-based level 3 BLAS
• A set of level 3 basic linear algebra subprograms
• Option pricing: A simplified approach
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Upper and lower I/O bounds for pebbling \(r\)-pyramids