A Proposed Approach for Motif Finding Problem Solved on Heterogeneous Cluster with Best Scheduling Algorithm

The Motif Finding Problem (MFP) is the problem of finding patterns in sequences of DNA. This paper discusses and presents an enhanced scheduling approach to solve the motif problem on the Heterogeneous Cluster by making a comparison between exact algorithms. The method that was followed is to analyze several exact algorithms, compare them within specific points to measure, and improve performance by comparing the number of devices and peripheral units used in every situation and running time in every method. Our experimental results show that the use of the scheduling approach that use different algorithms on Heterogeneous Cluster make a significant difference in the speed of completing the problem and in a shorter record time with less resources, and that this proposed approach is more effective than the traditional method of distributing tasks to solve the motif problem.

@article{Barghash2023,
  title     = {A Proposed Approach for Motif Finding Problem Solved on Heterogeneous Cluster with Best Scheduling Algorithm},
  journal   = {International Journal of Advanced Computer Science and Applications},
  volume    = {14},
  number    = {5},
  year      = {2023},
  publisher = {The Science and Information Organization},
  author    = {Abdullah Barghash and Ahmed Harbaoui},
  doi       = {10.14569/IJACSA.2023.01405105},
  url       = {https://doi.org/10.14569/IJACSA.2023.01405105}
}