Pipelined Linear Equation Solvers and VLSI
1982 (English)Conference paper (Refereed)
Many of the commonly used methods for solution of linear systems of equations on sequential machines can be given a concurrent formulation. The concurrent algorithms take advantage of independence of operations in order to reduce the time complexity of the methods. During the course of computations specified by the algorithm data has to be routed to the various places of computation. Pipelining can be used to avoid broadcasting in VLSI arrays for computation. Pipelining will in general allow for a reduced cycle time but may force data to be spread out in time, as is the case for Gaussian elimination. What the required spacing is depends on the pipelining and the data flow.
Place, publisher, year, edition, pages
1982. 42-47 p.
Computer and Information Science
IdentifiersURN: urn:nbn:se:kth:diva-65767OAI: oai:DiVA.org:kth-65767DiVA: diva2:483668
NR 201408052012-01-252012-01-25Bibliographically approved