A Method for Scheduling Multi Processing Systems with FCM Algorithm

Distributed and parallel systems nowadays play an important role in computing, with the increasing volume of computing the need for more multiprocessor systems. Therefore, the best solution for scheduling in CPUs should be designed in order to easily schedule high volume issues. Specially to solve NP problems that require high execution time. Recently, many algorithms have been developed, such as genetic or ant-based algorithms that are based on intelligent (mostly nonlinear) methods, or heuristic algorithms such as MAXMIN, MINMIN, OLB and LJFR-SJFR can be named. Regarding the importance of the subject, the purpose of this paper is to compare FCM phase clustering algorithm with genetic algorithm and intelligent algorithms in multiprocessor scheduling. The data were collected through the study of articles, books and reports related to the subject. In this method, the MATLAB Content Simulation Tool was used for comparison and review with other methods. The results showed that the proposed method has better efficiency than other methods.

Keywords:

Scheduling , Multiprocessor System , phase Clustering , FCM