algoritma pemrograman parallel graph coloring

Manne, F., Boman, E.: Balanced Greedy colorings of sparse random graphs. In: Kågström, B., Dongarra, J., Elmroth, E., Waśniewski, J. Manne, F.: A parallel algorithm for computing the extremal eigenvalues of very large sparse matrices. Lu, H., Halappanavar, M., Chavarría-Miranda, D., Gebremedhin, A.H., Panyala, A., Kalyanaraman, A.: Algorithms for balanced graph colorings with applications in parallel computing. In: Proceedings of the International Conference on Parallel Computing Technologies, pp. Khorasani, F., Gupta, R., Bhuyan, L.N.: Scalable SIMD-efficient graph processing on GPUs. In: Proceedings of the International Meshing Roundtable (2016)

Ibanez, D., Shephard, M.: Mesh adaptation for moving objects on shared memory hardware. Hawick, K., Leist, A., Playne, D.: Parallel graph component labelling with GPUs and CUDA. Gyárfás, A., Lehel, J.: On-line and first fit colorings of graphs. Gebremedhin, A.H., Manne, F.: Scalable parallel graph coloring algorithms. 38(10), 576–594 (2012)ĭavis, T.A., Hu, Y.: The University of Florida sparse matrix collection. Çatalyürek, Ü.V., Feo, J., Gebremedhin, A.H., Halappanavar, M., Pothen, A.: Graph coloring algorithms for multi-core and massively multithreaded architectures. It is shown that the parallel approaches produce similar results as the serial methods, but for specific cases the serial algorithms still remain a good option, when certain properties (e.g., balancing) are of major importance. An overview on speedup, used number of colors, and their respective population for different test graphs is provided. Our investigation covers well established as well as recent algorithms and their support for balanced and unbalanced approaches.

We compare several serial as well as parallel shared-memory graph coloring algorithms for the standard graph coloring problem based on reference graphs. As graph coloring is an active field of research, various algorithms are available, each offering advantages and disadvantages. Within the scope of computational science and engineering, the standard graph coloring problem, the distance-1 coloring, is typically used to select independent sets on which subsequent parallel computations can be guaranteed.

Algoritma pemrograman parallel graph coloring