1 2 static char help[] = "Partition tiny grid.\n\n"; 3 4 /* 5 Include "petscmat.h" so that we can use matrices. Note that this file 6 automatically includes: 7 petscsys.h - base PETSc routines petscvec.h - vectors 8 petscmat.h - matrices 9 petscis.h - index sets 10 petscviewer.h - viewers 11 */ 12 #include <petscmat.h> 13 14 int main(int argc,char **args) 15 { 16 Mat A,At; 17 PetscMPIInt rank,size; 18 PetscInt *ia,*ja,row; 19 MatPartitioning part; 20 IS is,isn; 21 PetscBool equal; 22 23 PetscCall(PetscInitialize(&argc,&args,(char*)0,help)); 24 PetscCallMPI(MPI_Comm_size(PETSC_COMM_WORLD,&size)); 25 PetscCheck(size == 4,PETSC_COMM_WORLD,PETSC_ERR_WRONG_MPI_SIZE,"Must run with 4 processors"); 26 PetscCallMPI(MPI_Comm_rank(PETSC_COMM_WORLD,&rank)); 27 28 PetscCall(PetscMalloc1(5,&ia)); 29 PetscCall(PetscMalloc1(16,&ja)); 30 if (rank == 0) { 31 ja[0] = 1; ja[1] = 4; ja[2] = 0; ja[3] = 2; ja[4] = 5; ja[5] = 1; ja[6] = 3; ja[7] = 6; 32 ja[8] = 2; ja[9] = 7; 33 ia[0] = 0; ia[1] = 2; ia[2] = 5; ia[3] = 8; ia[4] = 10; 34 } else if (rank == 1) { 35 ja[0] = 0; ja[1] = 5; ja[2] = 8; ja[3] = 1; ja[4] = 4; ja[5] = 6; ja[6] = 9; ja[7] = 2; 36 ja[8] = 5; ja[9] = 7; ja[10] = 10; ja[11] = 3; ja[12] = 6; ja[13] = 11; 37 ia[0] = 0; ia[1] = 3; ia[2] = 7; ia[3] = 11; ia[4] = 14; 38 } else if (rank == 2) { 39 ja[0] = 4; ja[1] = 9; ja[2] = 12; ja[3] = 5; ja[4] = 8; ja[5] = 10; ja[6] = 13; ja[7] = 6; 40 ja[8] = 9; ja[9] = 11; ja[10] = 14; ja[11] = 7; ja[12] = 10; ja[13] = 15; 41 ia[0] = 0; ia[1] = 3; ia[2] = 7; ia[3] = 11; ia[4] = 14; 42 } else { 43 ja[0] = 8; ja[1] = 13; ja[2] = 9; ja[3] = 12; ja[4] = 14; ja[5] = 10; ja[6] = 13; ja[7] = 15; 44 ja[8] = 11; ja[9] = 14; 45 ia[0] = 0; ia[1] = 2; ia[2] = 5; ia[3] = 8; ia[4] = 10; 46 } 47 48 PetscCall(MatCreateMPIAdj(PETSC_COMM_WORLD,4,16,ia,ja,NULL,&A)); 49 PetscCall(MatView(A,PETSC_VIEWER_STDOUT_WORLD)); 50 51 /* Create the same matrix but using MatSetValues() */ 52 PetscCall(MatCreate(PETSC_COMM_WORLD,&At)); 53 PetscCall(MatSetSizes(At,4,4,16,16)); 54 PetscCall(MatSetType(At,MATMPIADJ)); 55 for (PetscInt i=0; i<4; i++) { 56 row = i + 4*rank; 57 PetscCall(MatSetValues(At,1,&row,ia[i+1]-ia[i],ja + ia[i],NULL,INSERT_VALUES)); 58 } 59 PetscCall(MatAssemblyBegin(At,MAT_FINAL_ASSEMBLY)); 60 PetscCall(MatAssemblyEnd(At,MAT_FINAL_ASSEMBLY)); 61 PetscCall(MatEqual(A,At,&equal)); 62 PetscCheck(equal,PETSC_COMM_WORLD,PETSC_ERR_PLIB,"Matrices are not equal that should be equal"); 63 PetscCall(MatDestroy(&At)); 64 65 /* 66 Partition the graph of the matrix 67 */ 68 PetscCall(MatPartitioningCreate(PETSC_COMM_WORLD,&part)); 69 PetscCall(MatPartitioningSetAdjacency(part,A)); 70 PetscCall(MatPartitioningSetFromOptions(part)); 71 /* get new processor owner number of each vertex */ 72 PetscCall(MatPartitioningApply(part,&is)); 73 /* get new global number of each old global number */ 74 PetscCall(ISPartitioningToNumbering(is,&isn)); 75 PetscCall(ISView(isn,PETSC_VIEWER_STDOUT_WORLD)); 76 PetscCall(ISDestroy(&is)); 77 78 PetscCall(ISDestroy(&isn)); 79 PetscCall(MatPartitioningDestroy(&part)); 80 81 /* 82 Free work space. All PETSc objects should be destroyed when they 83 are no longer needed. 84 */ 85 PetscCall(MatDestroy(&A)); 86 87 PetscCall(PetscFinalize()); 88 return 0; 89 } 90 /* 91 test: 92 requires: parmetis 93 args: -mat_view 94 nsize: 4 95 */ 96