On Partitioning Problems with Complex Objectives
Hypergraph and graph partitioning tools are used to partition work for efficient parallelization of many sparse matrix computations. Most of the time, the objective function that is reduced by these tools relates to reducing the communication requirements, and the balancing constraints satisfied by these tools relate to balancing the work or memory requirements. Sometimes, the objective sought for having balance is a complex function of a partition. We mention some important class of parallel sparse matrix computations that have such balance objectives. For these cases, the current state of the art partitioning tools fall short of being adequate. To the best of our knowledge, there is only a single algorithmic framework in the literature to address such balance objectives. We propose another algorithmic framework to tackle complex objectives and experimentally investigate the proposed framework.
KeywordsHypergraph partitioning graph partitioning sparse matrix partitioning parallel sparse matrix computations
Unable to display preview. Download preview PDF.
- 5.Boman, E., Devine, K., Fisk, L.A., Heaphy, R., Hendrickson, B., Vaughan, C., Catalyurek, U., Bozdag, D., Mitchell, W., Teresco, J.: Zoltan 3.0: Parallel Partitioning, Load-balancing, and Data Management Services; User’s Guide. Sandia National Laboratories, Albuquerque, NM (2007)Google Scholar
- 6.Çatalyürek, Ü.V., Aykanat, C.: PaToH: A multilevel hypergraph partitioning tool, ver. 3.0. Tech. Rep. BU-CE-9915, Bilkent Univ., Dept. Computer Eng. (1999)Google Scholar
- 9.Karypis, G., Kumar, V.: MeTiS: A software package for partitioning unstructured graphs, partitioning meshes, and computing fill-reducing orderings of sparse matrices, version 4.0. Univ. Minnesota, Dept. Comp. Sci. Eng. (1998)Google Scholar
- 10.Karypis, G., Kumar, V.: Multilevel algorithms for multi-constraint graph partitioning. Tech. Rep. 98-019, Univ. Minnesota, Dept. Comp. Sci. Eng. (1998)Google Scholar
- 11.Kaya, K., Rouet, F.H., Uçar, B.: On partitioning problems with complex objectives. Tech. Rep. RR-7546, INRIA, France (2011)Google Scholar
- 13.Moulitsas, I., Karypis, G.: Partitioning algorithms for simultaneously balancing iterative and direct methods. Tech. Rep. 04-014, Univ. Minnesota, Dept. Comp. Sci. Eng. (2004)Google Scholar
- 14.Pellegrini, F.: SCOTCH 5.1 User’s Guide. Laboratoire Bordelais de Recherche en Informatique (LaBRI) (2008)Google Scholar
- 15.Pınar, A., Hendrickson, B.: Partitioning for complex objectives. In: IPDPS 2001, CDROM, p. 121. IEEE Computer Society, Washington, DC (2001)Google Scholar
- 20.Yamazaki, I., Li, X.S., Rouet, F.H., Uçar, B.: Combinatorial problems in a parallel hybrid linear solver. In: Becker, M., Lotz, J., Mosenkis, V., Naumann, U. (eds.) Abstracts of 5th SIAM Workshop on Combinatorial Scientific Computing. pp. 87–89. RWTH Aachen University (2011)Google Scholar