An Approach To Program Representation Of The R&F Systolic LU-factorization Algorithm
Price
Free (open access)
Volume
3
Pages
10
Published
1993
Size
580 kb
Paper DOI
10.2495/ASE930261
Copyright
WIT Press
Author(s)
M.P. Bekakos
Abstract
An approach to program representation of the R&F systolic LU-factorization algorithm M.P. Bekakos Department of Informatics, Athens University of Economics and Business, Athens, Greece ABSTRACT In this work, we view systolic algorithms as programs, each consisting of a multiple assignment statement that describes the algorithmic operation and the synchronous data movement between the nodes of the systolic architecture. We carry out the development of the LU-factorization algorithm for band matrices using the R&F technique (Bekakos and Evans [9], [2]) and applying for its design a traditional program development technique based on an invariant. INTRODUCTION One of the most significant fields in the area of parallel processing is that of systolic algorithms, which are usually illustrated by snapshots of nodes and lines, descriptions of processing at each node in the snapshot and data movement between nodes. A pictorial representation of an algorithm does not lead its
Keywords