WestminsterResearch will not be accepting deposits until 9th March 2015. This is to allow for a system upgrade and server migration.

Rank annihilation on a ring of processors

Megson, Graham M. (1990) Rank annihilation on a ring of processors. Parallel Computing, 13 (1). pp. 85-94. ISSN 0167-8191

Full text not available from this repository.

Official URL: http://dx.doi.org/10.1016/0167-8191(90)90121-O


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.

Item Type:Article
Research Community:University of Westminster > Electronics and Computer Science, School of
ID Code:5751
Deposited On:29 Jan 2009 14:05
Last Modified:19 Oct 2009 16:28

Repository Staff Only: item control page