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

Authors:
Desh Ranjan;John Savage;Mohammad Zubair
Affiliations:
Old Dominion University, Norfolk, VA 23529, United States;Brown University, Providence, RI 02912, United States;Old Dominion University, Norfolk, VA 23529, United States
Venue:
Journal of Discrete Algorithms
Year:
2012

Citing 13
Cited 0

A set of level 3 basic linear algebra subprograms

ACM Transactions on Mathematical Software (TOMS)
Exploiting functional parallelism of POWER2 to design high-performance numerical algorithms

IBM Journal of Research and Development
The design, implementation, and evaluation of a symmetric banded linear solver for distributed-memory parallel computers

ACM Transactions on Mathematical Software (TOMS)
GEMM-based level 3 BLAS: high-performance model implementations and performance evaluation benchmark

ACM Transactions on Mathematical Software (TOMS)
Models of Computation: Exploring the Power of Computing

Models of Computation: Exploring the Power of Computing
Extending the Hong-Kung Model to Memory Hierarchies

COCOON '95 Proceedings of the First Annual International Conference on Computing and Combinatorics
Architecture, algorithms and applications for future generation supercomputers

FRONTIERS '96 Proceedings of the 6th Symposium on the Frontiers of Massively Parallel Computation
I/O complexity: The red-blue pebble game

STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Computer Architecture, Fourth Edition: A Quantitative Approach

Computer Architecture, Fourth Edition: A Quantitative Approach
Anatomy of high-performance matrix multiplication

ACM Transactions on Mathematical Software (TOMS)
Cache-optimal algorithms for option pricing

ACM Transactions on Mathematical Software (TOMS)
Evaluating multicore algorithms on the unified memory model

Scientific Programming - Software Development for Multi-core Computing Systems
An observation on time-storage trade off

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

Modern computers have several levels of memory hierarchy. To obtain good performance on these processors it is necessary to design algorithms that minimize I/O traffic to slower memories in the hierarchy. In this paper, we present I/O efficient algorithms to pebble r-pyramids and derive lower bounds on the number of I/O operations to do so. The r-pyramid graph models financial applications which are of practical interest and where minimizing memory traffic can have a significant impact on cost saving.