Cart (Loading....) | Create Account
Close category search window
 

A parallel algorithm to solve tridiagonal systems on distributed memory multiprocessors

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Badia, J.M. ; Dept. de Sistemas Inf. y Comput., Univ. Politecnica de Valencia, Spain ; Vidal, A.M.

The authors design and implement an efficient algorithm that uses the cyclic odd-even reduction method to solve large tridiagonal systems on a distributed memory multiprocessor. The algorithm works on a bidirectional array of transputers, and the code has been written in Occam2. The algorithm performs a parallel cyclic reduction of the original system, solves the reduced system using Gaussian elimination and obtains the remaining solutions with a cyclic backward substitution phase. They present both a theoretical and an experimental study of its performance on the Parsys SN-1000. Results reflect a real efficiency close to the theoretical maximum

Published in:

Parallel and Distributed Processing, 1993. Proceedings. Euromicro Workshop on

Date of Conference:

27-29 Jan 1993

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.