College of Engineering >
Computer Science >
Computer Science Technical Reports >
Please use this identifier to cite or link to this item:
|Title: ||A Parallel Triangular Solver for a Hypercube Multiprocessor|
|Authors: ||Li, Guangye|
Coleman, Thomas F.
|Keywords: ||computer science|
|Issue Date: ||Oct-1986|
|Publisher: ||Cornell University|
|Abstract: ||We consider solving triangular systems of linear equations on a hypercube multiprocessor. Specifically, we propose a fast parallel algorithm, applicable when the triangular matrix is distributed around the cube by column in a wrap fashion. Numerical experiments indicate that the new algorithm is very efficient. A theoretical analysis confirms that the total running time varies linearly, with respect to the matrix order, up to a threshold value of the matrix order, after which the dependence is quadratic. Moreover, we show that total message traffic is essentially the minimum possible. Finally, we describe an analogous row-oriented algorithm.|
|Appears in Collections:||Computer Science Technical Reports|
Items in eCommons are protected by copyright, with all rights reserved, unless otherwise indicated.