Skip to main content
SpringerLink
Log in

Processor allocation and task scheduling to minimize distributed sparse cholesky factorization time

  • Posters
  • Conference paper
  • First Online:
High-Performance Computing and Networking (HPCN-Europe 1999)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1593))

Included in the following conference series:

  • 108 Accesses

Abstract

In this paper, we discuss the parallel sparse Cholesky factorization problem for distributed memory multiprocessor systems. Although there are already several articles for this problem, most of them only focus on the processor allocation. We discuss the processor allocation and the task scheduling issues simultaneously to minimize the overall parallel execution time. Several existing methods are compared with ours, and experiments conducted show that our method provides the minimum parallel execution time.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. George, J. A., Heath, M. T., Liu, J. W. H., Ng, E. G.: Sparse Cholesky factorization on a local-memory multiprocessor. SIAM J. Sci. Stat. Comput., vol. 9 (1988) 327–340.

    Article  MathSciNet  Google Scholar 

  2. George, J. A., Liu, J. W., Ng, E. G.: Communication results for parallel sparse Cholesky factorization. Parallel Computing, vol. 10 (1989) 289–297.

    Article  MathSciNet  Google Scholar 

  3. Geist, G. A., Ng, E. G.: Task scheduling for parallel sparse Cholesky factorization. International Journal of Parallel Programming, vol. 18, no. 4 (1989) 291–314.

    Article  MathSciNet  Google Scholar 

  4. Pothen, A., Sun, C.: A mapping algorithm for parallel sparse Cholesky factorization. SIAM J. Sci. Stat. Comput. vol. 14, no. 5, Sep. (1993) 1253–1257.

    Article  MathSciNet  Google Scholar 

  5. Liu, J. W. H.: Modification of the minimum degree algorithm by multiple elimination. ACM Trans. Math. Software, vol. 11 (1985) 141–153.

    Article  MathSciNet  Google Scholar 

  6. Duff, I. S., Reid, J. K.: The multifrontal solution of indefinite sparse linear equations. ACM Trans. Math. Software, vol. 9, Sep. (1983) 302–325.

    Article  MathSciNet  Google Scholar 

  7. Lin, W. Y.: Reorderings of sparse matrices for parallel Cholesky factorization. Ph.D. Thesis, Department of Computer Science and Information Engineering, National Taiwan University, June (1994).

    Google Scholar 

  8. Duff, I. S., Grimes, R., Lewis, J.: Sparse matrix test problems. ACM Trans. on Math. Software, vol. 15 (1989) 1–14.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Information Engineering, National Taiwan University, 10617, Taipei, Taiwan

    Tsung-Tso Kan & Chuen-Liang Chen

Authors
  1. Tsung-Tso Kan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Chuen-Liang Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Peter Sloot Marian Bubak Alfons Hoekstra Bob Hertzberger

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag

About this paper

Cite this paper

Kan, TT., Chen, CL. (1999). Processor allocation and task scheduling to minimize distributed sparse cholesky factorization time. In: Sloot, P., Bubak, M., Hoekstra, A., Hertzberger, B. (eds) High-Performance Computing and Networking. HPCN-Europe 1999. Lecture Notes in Computer Science, vol 1593. Springer, Berlin, Heidelberg . https://doi.org/10.1007/BFb0100711

Download citation

  • DOI: https://doi.org/10.1007/BFb0100711

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65821-4

  • Online ISBN: 978-3-540-48933-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation