Parallel Computing - A Case Study on Coarse-Grained Parallelism Nur Asmida Ahmad Shokree #1, Mohamed Faidz Mohamed Said #2 # Faculty of Computer &Mathematical Science, Universiti Teknologi MARA 70300, Seremban, Negeri Sembilan, MALAYSIA 1 asmidashokree95@gmail.com 2 mohdfaidz@uitm.edu.my Abstract—There are three types of parallelism in parallel computing. There are known as fine-grained parallelism, coarse-grained parallelism, and medium-grained parallelism. Granularity can be validated based on the number of tasks into which problem is decomposed. The results for decomposition into a small number of tasks is in a coarse grained decomposition. There are few problems that can solve using coarse-grained parallelism. In this research, the objective is to study different types of method use based on coarse-grained parallelism to solve the different problem in the different cases. Besides, this research is to identify different method were used based on the situation needed or the problem occur. There are few method has been discovered such as basic programming paradigm and sparse matrix Cholesky factorization algorithm. These techniques involve in coarse-grained parallel programming in Jade language. Within a sequential exploitation of imperative programming paradigm, the result is Jade language that supports the exploitation of the coarse-grained concurrency. In conclusion, there are many methods in coarse-grained parallelism has been used to solve different problem. Further research on this coarse-grained parallelism method may be further understanding about this. Keywords: coarse-grained parallelism, BSP-like model, EM algorithm REFERENCES [1] W.-m. Hwu, "What is ahead for parallel computing," Journal of Parallel and Distributed Computing, vol. 74, no. 7, pp. 2574-2581, 2014. [2] S. Bae and S. Ranka, "PACK\UNPACK on Coarse-Grained Distributed Memory Parallel Machines," Journal of Parallel and Distributed Computing, vol. 38, no. 2, p. 204, 1996. [3] T. A. Funkhouser, "Coarse-grained parallelism for hierarchical radiosity using group iterative methods," presented at the Proceedings of the 23rd annual conference on Computer graphics and interactive techniques, 1996. [4] S. Ryoo, S.-Z. Ueng, C. I. Rodrigues, R. E. Kidd, M. I. Frank, and W. M. W. Hwu, "Automatic Discovery of Coarse-Grained Parallelism in Media Applications," Lecture Notes in Computer Science Transactions on High-Performance Embedded Architectures and Compilers I, pp. 194-213, 2007. [5] M. Daga and M. Nutter, "Exploiting Coarse-Grained Parallelism in B+ Tree Searches on an APU," 2012 SC Companion: High Performance Computing, Networking Storage and Analysis, 2012. [6] V. Voloshinov, S. Smirnov, and O. Sukhoroslov, "Implementation and Use of Coarse-grained Parallel Branch-and-bound in Everest Distributed Environmental," Procedia Computer Science, vol. 108, pp. 1532-1541, 2017. [7] X. Lu, B. Han, M. Hori, C. Xiong, and Z. Xu, "A coarse-grained parallel approach for seismic damage simulations of urban areas based on refined models and GPU/CPU cooperative computing," Advances in Engineering Software, vol. 70, pp. 90-103, 2014. [8] M. S. Lam and M. C. Rinard, "Coarse-grain parallel programming in Jade," SIGPLAN Not., vol. 26, no. 7, pp. 94-105, 1991. [9] J. Xu, J. Jiang, Y. Dou, X. Shen, and Z. Liu, "Coarse-Grained Architecture for Fingerprint Matching," ACM Trans. Reconfigurable Technol. Syst., vol. 9, no. 2, pp. 1-15, 2015. [10] K. Sakai, P. Sajda, S.-C. Yen, and L. H. Finkel, "Coarse-grain parallel computing for very large scale neural simulations in the NEXUS simulation environment," Computers in Biology and Medicine, vol. 27, no. 4, pp. 257-266, 1997. [11] H. K. Pyla, C. Ribbens, and S. Varadarajan, "Exploiting coarse-grain speculative parallelism," SIGPLAN Not., vol. 46, no. 10, pp. 555-574, 2011. [12] M. I. Gordon, W. Thies, and S. Amarasinghe, "Exploiting coarse-grained task, data, and pipeline parallelism in stream programs," SIGARCH Comput. Archit. News, vol. 34, no. 5, pp. 151-162, 2006. [13] A. Chan, F. Dehne, and A. Rau-Chaplin, "Coarse-Grained Parallel Geometric Search," Journal of Parallel and Distributed Computing, vol. 57, no. 2, pp. 224-235, 1999. [14] F. Dehne, W. Dittrich, and D. Hutchinson, "Efficient external memory algorithms by simulating coarse-grained parallel algorithms," presented at the Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures, Newport, Rhode Island, USA, 1997. [15] N. A. A. Shokree. (2017). Parallel Computing - A Case Study on Coarse-Grained Parallelism. Available: https://www.youtube.com/watch?v=sF2Xm6f09aA&rel=0 [Accessed: 28-Nov-2017].