Megson, Graham M. (1990) Rank annihilation on a ring of processors. Parallel Computing, 13 (1). pp. 85-94. ISSN 0167-8191Full text not available from this repository.
A wavefront algorithm for computing the Sherman-Morrison Rank-1 update to an n × n matrix inverse on a ring of processors is discussed. A ring of n z > 0 processing elements computes a single update in O(n(3k + 2)) inner product equivalent steps where k = (n/z) is the partition size of data for each processor. This is in contrast to the O(n2) demanded by the sequential method. The algorithm is implemented on a network of T800 transputers and the results of timing analysis presented.
|Subjects:||University of Westminster > Science and Technology > Electronics and Computer Science, School of (No longer in use)|
|Depositing User:||Miss Nina Watts|
|Date Deposited:||29 Jan 2009 14:05|
|Last Modified:||19 Oct 2009 15:28|
Actions (login required)
|Edit Item (Repository staff only)|