Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Issue title: A New Overview of the Trilinos Project – Part 1
Article type: Research Article
Authors: Boman, Erik G. | Çatalyürek, Ümit V. | Chevalier, Cédric | Devine, Karen D.;
Affiliations: Department of Scalable Algorithms, Sandia National Laboratories, Albuquerque, NM, USA | Department of Biomedical Informatics and Department of Electrical and Computer Engineering, The Ohio State University, Columbus, OH, USA | Commissariat à l'Énergie Atomique et aux Énergies Alternatives, Direction des Applications Militaires, CEA, DAM, DIF, Arpajon, France
Note: [] Corresponding author: Karen D. Devine, Department of Scalable Algorithms, Sandia National Laboratories, Albuquerque, NM 87185-1318, USA. E-mail: [email protected].
Abstract: Partitioning and load balancing are important problems in scientific computing that can be modeled as combinatorial problems using graphs or hypergraphs. The Zoltan toolkit was developed primarily for partitioning and load balancing to support dynamic parallel applications, but has expanded to support other problems in combinatorial scientific computing, including matrix ordering and graph coloring. Zoltan is based on abstract user interfaces and uses callback functions. To simplify the use and integration of Zoltan with other matrix-based frameworks, such as the ones in Trilinos, we developed Isorropia as a Trilinos package, which supports most of Zoltan's features via a matrix-based interface. In addition to providing an easy-to-use matrix-based interface to Zoltan, Isorropia also serves as a platform for additional matrix algorithms. In this paper, we give an overview of the Zoltan and Isorropia toolkits, their design, capabilities and use. We also show how Zoltan and Isorropia enable large-scale, parallel scientific simulations, and describe current and future development in the next-generation package Zoltan2.
Keywords: Partitioning, load balancing, matrix ordering, fill-reducing ordering, graph coloring, parallel computing, combinatorial scientific computing
DOI: 10.3233/SPR-2012-0342
Journal: Scientific Programming, vol. 20, no. 2, pp. 129-150, 2012
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
[email protected]
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office [email protected]
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
如果您在出版方面需要帮助或有任何建, 件至: [email protected]