Skip navigation
Skip navigation

A comparison of lookahead and algorithmic blocking techniques for parallel matrix factorization

Strazdins, Peter

Description

In this paper, we analyse and compare the techniques of algorithmic blocking and (storage blocking with) lookahead for distributed memory LU, LLT and QR factorizations. Concepts and some useful properties of a simplified model of lookahead are explored, including the minimal degree of lookahead required for optimal performance. Issues in the implementation of lookahead are discussed, which are more involved for the cases of LLT and QR factorizations. It is also explained how hybrid algorithmic...[Show more]

CollectionsANU Research Publications
Date published: 1998
Type: Working/Technical Paper
URI: http://hdl.handle.net/1885/40739
http://digitalcollections.anu.edu.au/handle/1885/40739

Download

File Description SizeFormat Image
1560-01.2003-07-02T04:04:50Z.xsh356 BEPrints MD5 Hash XML
TR-CS-98-07.pdf312.93 kBAdobe PDFThumbnail


Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  23 August 2018/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator