Journal of applied mathematics & informatics

  • 제41권6호
  • /
  • Pages.1317-1326
  • /
  • 2023
  • /
  • 2734-1194(pISSN)
  • /
  • 2234-8417(eISSN)
한국전산응용수학회 (The Korean Society for Computational and Applied Mathematics)
권호 표지
DOI QR코드

DOI QR Code

PERFORMANCE OF A KNIGHT TOUR PARALLEL ALGORITHM ON MULTI-CORE SYSTEM USING OPENMP

  • Received : 2023.02.19
  • Accepted : 2023.09.12
  • Published : 2023.11.30
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

Abstract

Today's computers, desktops and laptops were build with multi-core architecture. Developing and running serial programs in this multi-core architecture fritters away the resources and time. Parallel programming is the only solution for proper utilization of resources available in the modern computers. The major challenge in the multi-core environment is the designing of parallel algorithm and performance analysis. This paper describes the design and performance analysis of parallel algorithm by taking the Knight Tour problem as an example using OpenMP interface. Comparison has been made with performance of serial and parallel algorithm. The comparison shows that the proposed parallel algorithm achieves good performance compared to serial algorithm.

Keywords

Acknowledgement

We gratefully acknowledge Periyar University for providing the resources and support.

References

  1. F. George, Artificial intelligence structures and strategies for complex problem solving, IV Edition, Pearson Education, 2007. 
  2. Vidyaathulasiraman, S. Vijayakumar, An Algorithm to Avoid Backtracking for a Generalized Knight Tour Problem with Parallel Approach, International Journal of Computational Intelligence and Informatics 9 (2019), 383-391. 
  3. Najem N. Sirhan, Sami I. Serhan, Multicore processors: concepts and implementations, International Journal of Computer Science & Information Technology (IJCSIT) 10 (2018), 1-10. 
  4. Musaev Muhammadjon Mahmudovich and Berdanov Ulug'bek Abdumurodovich, The Technology of Parallel Processing on Multicore Processors, International Journal of Signal Processing Systems 4 (2016), 252-257.  https://doi.org/10.18178/ijsps.4.3.252-257
  5. Balaji Venu, Multi core processors An overview, https://arxiv.org/ftp/arxiv/papers/1110/1110.3535.pdf, October 2011. 
  6. Norma Alias and Md. Rajibul Islam, A Review of the Parallel Algorithms for Solving Multidimensional PDE Problems, Journal of Applied Sciences 10 (2010), 2187-2197.  https://doi.org/10.3923/jas.2010.2187.2197
  7. Mohd Muzafar Ismail, Ezreen Farina Shair, A Preliminary Study on Solving Knight's Tour Problem Using Binary Magnetic Optimization Algorithm, Science & Engineering Technology National Conference, 2013. 
  8. Sanjay Kumar Sharma, Dr. Kusum Gupta, Performance Analysis of Parallel Algorithms on Multi-core System using OpenMP, International Journal of Computer Science, Engineering and Information Technology (IJCSEIT) 2 (2012), 55-64. 
  9. G. Chen, X. Wu, and Z. Zhou, A parallel algorithm for knight's tour problem on graphics processing unit, 2014 IEEE International Conference on High Performance Computing and Communications, 2014, 955-961. 
  10. H.K. Kim, K. Kim, and S. Lee, Parallelization of the Knight's Tour Problem Using CUDA, Journal of Computational Science Education 6 (2015), 32-38. 
  11. H. Chen, Y. Zhang, and J. Huang, Parallel Iterative Deepening Search Algorithm for Solving Knight's Tour Problem on GPU, 2019 18th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT), 2019, 111-116.