Reducing reverse-mode memory requirements by using profile-driven checkpointing

Authors:
Mike Fagan;Alan Carle
Affiliations:
Rice University, Department of Computational and Applied Mathematics, Houston, TX;Rice University, Department of Computational and Applied Mathematics, Houston, TX
Venue:
Future Generation Computer Systems
Year:
2005

Citing 8
Cited 1

More programming pearls: confessions of a coder

More programming pearls: confessions of a coder
Algorithm 755: ADOL-C: a package for the automatic differentiation of algorithms written in C/C++

ACM Transactions on Mathematical Software (TOMS)
Recipes for adjoint code construction

ACM Transactions on Mathematical Software (TOMS)
Programming pearls (2nd ed.)

Programming pearls (2nd ed.)
Evaluating derivatives: principles and techniques of algorithmic differentiation

Evaluating derivatives: principles and techniques of algorithmic differentiation
Writing efficient programs

Writing efficient programs
CFL3D: Its History and Some Recent Applications

CFL3D: Its History and Some Recent Applications
Comparing global strategies for coding adjoints

Scientific Programming

A methodology for the development of discrete adjoint solvers using automatic differentiation tools

International Journal of Computational Fluid Dynamics

Quantified Score

Hi-index	0.00

Visualization

Abstract

As deployed Grids increase from tens to thousands of nodes, peer-to-peer (P2P) techniques and protocols can be used to implement scalable services and applications. The super-peer model is a novel approach that helps the convergence of P2P models and ...