algorithms have two costs: arithmetic and communication, i.e. moving data between levels of a memory hierarchy or processors over a network. communication costs (measured in time or energy per operation) already greatly exceed arithmetic costs, and the gap is growing over time following technological trends. thus our goal is to design algorithms that minimize communication. we present algorithms that attain provable lower bounds on communication, and show large speedups compared to their conventional counterparts. these algorithms are for direct and iterative linear algebra, for dense and sparse matrices, as well as direct n-body simulations. several of these algorithms exhibit perfect strong scaling, in both time and energy: run time (resp. energy) for a fixed problem size drops proportionally to the number of processors p (resp. is independent of p). finally, we describe extensions to algorithms involving arbitrary loop nests and array accesses, assuming only that array subscripts are affine functions of the loop indices.