Abstract
In this paper we summarize our work on development of parallel algorithms for searching large unstructured trees, and for finding solution of large sparse systems of linear equations. Search of large unstructured trees is at the core of many important algorithms for solving discrete optimization problems. Solution of large sparse systems of equations is required for solving many important scientific computing problems. For both of these domains, we show that highly scalable parallel algorithms can be developed, and these algorithms can obtain high speedup on a large number of processors.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
S. Arvindam, Vipin Kumar, and V. Nageshwara Rao. Floorplan optimization on multiprocessors. In Proceedings of the 1989 International Conference on Computer Design,1989. Also published as Technical Report ACT-OODS-241–89, Microelectornics and Computer Corporation, Austin,TX.
S. Arvindam, Vipin Kumar, and V. Nageshwara Rao. Efficient parallel algorithms for search problems: Applications in VLSI CAD. In Proceedings of the Frontiers 90 Conference on Massively Parallel Computation, 1990.
S. Arvindam, Vipin Kumar, V. Nageshwara Rao, and Vineet Singh. Automatic test pattern generation on multiprocessors. Parallel Computing, 17 (12): 1323–1342, December 1991.
Cleve Ashcraft, S. C. Eisenstat, J. W.-H. Liu, and A. H. Sherman. A comparison of three column based distributed sparse factorization schemes. Technical Report YALEU DCS RR-810, Yale University, New Haven, CT, 1990. Also appears in Proceedings of the Fifth SIAM Conference on Parallel Processing for Scientific Computing, 1991.
lain S. Duff and J. K. Reid. The multifrontal solution of indefinite sparse symmetric linear equations. ACM Transactions on Mathematical Software, 9: 302–325, 1983.
Iain S. Duff and J. K. Reid. The multifrontal solution of unsymmetric sets of linear equations. SIAM Journal on Scientific and Statistical Computing, 5 (3): 633–641, 1984.
G. A. Geist and E. G.-Y. Ng. Task scheduling for parallel sparse Cholesky factorization. International Journal of Parallel Programming,18(4):291314, 1989.
A. George, M. T. Heath, J. W.-H. Liu, and E. G.-Y. Ng. Sparse Cholesky factorization on a local memory multiprocessor. SIAM Journal on Scientific and Statistical Computing, 9: 327–340, 1988.
A. George and J. W.-H. Liu. Computer Solution of Large Sparse Positive Definite Systems. Prentice-Hall, Englewood Cliffs, NJ, 1981.
A. George, J. W.-H. Liu, and E. G.-Y. Ng. Communication results for parallel sparse Cholesky factorization on a hypercube. Parallel Computing, 10 (3): 287–298, May 1989.
Ananth Grama, Vipin Kumar, and V. Nageshwara Rao. Experimental evaluation of load balancing techniques for the hypercube. In Proceedings of the Parallel Computing ‘81 Conference, pages 497–514, 1991.
Anshul Gupta and Vipin Kumar. A scalable parallel algorithm for sparse matrix factorization. Technical Report 94–19, Department of Computer Science, University of Minnesota, Minneapolis, MN, 1994. A short version appears in Supercomputing ‘84 Proceedings. TR available in users kumar at anonymous FTP site ftp.cs.umn.edu.
M. T. Heath, E. G.-Y. Ng, and Barry W. Peyton. Parallel algorithms for sparse linear systems. SIAM Review, 33:420–460, 1991. Also appears in K. A. Gallivan et al. Parallel Algorithms for Matrix Computations. SIAM, Philadelphia, PA, 1990.
George Karypis and Vipin Kumar. Unstructured Tree Search on SIMD Parallel Computers. Technical Report 92–21, Computer Science Department, University of Minnesota, 1992. Appears in IEEE Transactions on Parallel and Distributed Systems, Volume 5, Number 10, pp. 1057–1072, October 1994. A short version appears in Supercomputing ‘82 Proceedings, pages 453–462, 1992. Available via anonymous ftp from ftp.cs.umn.edu at users kumar lb-SIMD.ps.
George Karypis and Vipin Kumar. A high performance sparse Cholesky factorization algorithm for scalable parallel computers. Technical Report TR 94–41, Department of Computer Science, University of Minnesota, Minneapolis, MN, 1994. Submitted to the Eighth Symposium on the Frontiers of Massively Parallel Computation, 1995.
V. Kumar and L. N. Kanal. Parallel branch-and-bound formulations for and or tree search. IEEE Transactions Pattern Analysis and Machine Intelligence, PAMI-6: 768–778, 1984.
Vipin Kumar. Depth-first search. In Stuart C. Shapiro, editor, Encyclopaedia of Artificial Intelligence: Vol 2, pages 1004–1005. John Wiley and Sons, New York, NY, 1987. Revised version appears in the second edition of the encyclopedia to be published in 1992.
Vipin Kumar, Ananth Grama, Anshul Gupta, and George Karypis. Introduction to Parallel Computing: Design and Analysis of Algorithms. Benjamin Cummings, Redwood City, CA, 1994.
Vipin Kumar, Ananth Grama, and V. Nageshwara Rao. Scalable load balancing techniques for parallel computers. Journal of Parallel and Distributed Computing,22(1):60–79, July 1994. Also available as Technical Report 91–55 (November 1991), Department of Computer Science, University of Minnesota, Minneapolis, MN. Available via anonymous ftp from ftp.cs.umn.edu at users kumar lb-MIMD.ps.
Vipin Kumar and Anshul Gupta. Analyzing the scalability of parallel algorithms and architectures: A survey. In Proceedings of the 1991 International Conference on Supercomputing,1991. Also appears in September 1994 issue of JPDC. Available via anonymous ftp from ftp.cs.umn.edu at users kumar survey-scalability.ps.
Vipin Kumar and Anshul Gupta. Analyzing scalability of parallel algorithms and architectures. Journal of Parallel and Distributed Computing (special issue on scalability),22(3):379–391, September 1994. A short version of the paper appears in the Proceedings of the 1991 International Conference on Supercomputing. Available via anonymous ftp from ftp.cs.umn.edu at users kumar survey-scalability.ps.
Vipin Kumar, K. Ramesh, and V. Nageshwara Rao. Parallel best-first search of state-space graphs: A summary of results. In Proceedings of the 1988 National Conference on Artificial Intelligence, pages 122–126, August 1988.
Vipin Kumar and V. N. Rao. Scalable parallel formulations of depth-first search. In Vipin Kumar, P. S. Gopalakrishnan, and L. N. Kanal, editors, Parallel Algorithms for Machine Intelligence and Vision. Springer-Verlag, New York, NY, 1990.
Vipin Kumar and V. Nageshwara Rao. Parallel depth-first search, part II: Analysis. International Journal of Parallel Programming, 16 (6): 501–519, December 1987.
Vipin Kumar and Vineet Singh. Scalability of Parallel Algorithms for the All-Pairs Shortest Path Problem: A Summary of Results. In Proceedings of the International Conference on Parallel Processing,1990. An extended version appears in Journal of Parallel and Distributed Processing,13:124–138, 1991. Available via anonymous ftp from ftp.cs.umn.edu at users kumar shortest-path.ps.
J. W.-H. Liu. The multifrontal method for sparse matrix solution: Theory and practice. Technical Report CS-90–04, York University, Ontario, Canada, 1990. Also appears in SIAM Review, 34: 82–109, 1992.
Robert F. Lucas, Tom Blank, and Jerome J. Tiemann. A parallel solution method for large sparse systems of equations. IEEE Transactions on Computer Aided Design, CAD-6(6): 981–991, November 1987.
Pontus Matstoms. The multifrontal solution of sparse linear least squares problems. PhD thesis, Department of Mathematics, Linkoping University, S-581 83 Linkoping, Sweden, March 1992.
Dianne P. O’Leary and G. W. Stewart. Assignment and scheduling in parallel matrix factorization. Linear Algebra and its Applications, 77: 275299, 1986.
Alex Pothen, H. D. Simon, and K.-P. Liou. Partioning sparce matrices with eigenvectors of graphs. SIAM Journal of Mathematical Analysis and Applications, 11 (3): 430–452, 1990.
V. Nageshwara Rao and V. Kumar. Parallel depth-first search, part I: Implementation. International Journal of Parallel Programming, 16 (6): 479–499, December 1987.
V. Nageshwara Rao and Vipin Kumar. On the efficicency of parallel backtracking. IEEE Transactions on Parallel and Distributed Systems,4(4):427–437, April 1993. Also available as Technical Report TR 9055, Department of Computer Science, University of Minnesota, Minneapolis, MN. Available via anonymous ftp from ftp.cs.umn.edu at users kumar suplin.ps.
Edward Rothberg. Performance of panel and block approaches to sparse Cholesky factorization on the iPSC 860 and Paragon multicomputers. In Proceedings of the 1994 Scalable High Performance Computing Conference, May 1994.
Robert Schreiber. Scalability of sparse direct solvers. Technical Report RIACS TR 92.13, NASA Ames Research Center, Moffet Field, CA, May 1992. Also appears in A. George, John R. Gilbert, and J. W.-H. Liu, editors, Sparse Matrix Computations: Graph Theory Issues and Algorithms (An IMA Workshop Volume). Springer-Verlag, New York, NY, 1993.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1995 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Kumar, V., Grama, A., Gupta, A., Karypis, G. (1995). Scalable Parallel Algorithms for Unstructured Problems. In: Ferreira, A., Rolim, J.D.P. (eds) Parallel Algorithms for Irregular Problems: State of the Art. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-6130-6_5
Download citation
DOI: https://doi.org/10.1007/978-1-4757-6130-6_5
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-4747-5
Online ISBN: 978-1-4757-6130-6
eBook Packages: Springer Book Archive