论文信息 - Parallel algorithm and architectures for two-step division-free Gaussian elimination

Parallel algorithm and architectures for two-step division-free Gaussian elimination

The design of optimal array processors for solving linear systems using two-step division-free Gaussian elimination method is considered. The two-step method circumvents the one-step one in terms of numerical stability. In spite of the rather complicated computations needed at each iteration of the two-step method, we develop an innovative parallel algorithm whose data dependency graph meets the requirements for regularity and locality. Then we derive two-dimensional array processors by adopting a systematic approach to investigate the set of all admissible solutions and obtain the optimal array processors under linear time-space scheduling. The array processors is optimal in terms of the number of processing elements used.

Shietung Peng | Stanislav G. Sedukhin

[1] L. Fox. An introduction to numerical linear algebra , 1964 .

[2] E. Bareiss. Sylvester’s identity and multistep integer-preserving Gaussian elimination , 1968 .

[3] Stanislav G. Sedukhin,et al. Systematic Approach and Software Tool for Systolic Design , 1994, CONPAR.

[4] S. Kung,et al. VLSI Array processors , 1985, IEEE ASSP Magazine.

[5] Graham M. Megson,et al. A General Methodology of Partitioning and Mapping for Given Regular Arrays , 1995, IEEE Trans. Parallel Distributed Syst..

[6] Shietung Peng,et al. Array Processors Design for Division-free Linear System Solving , 1996, Comput. J..

[7] Stanislav G. Sedukhin. An Algorithm and Array Processor for Solving the Systems of Linear Equations , 1995, PDPTA.

[8] Uwe Schwiegelshohn,et al. A Square Root and Division Free Givens Rotation for Solving Least Squares Problems on Systolic Arrays , 1991, SIAM J. Sci. Comput..

[9] K. J. Ray Liu,et al. A class of square root and division free algorithms and architectures for QRD-based adaptive signal processing , 1994, IEEE Trans. Signal Process..