استخدام خوارزمية (Memetic) لجدولة مهام نظام متعدد المعالجات

Abstract

Tasks scheduling plays a very big role in minimizing waiting time, which is required for tasks or jobs in queuing for processing in the computer's (Central Processing Unit (CPU)), where these task are scheduled before they enter one of the processors with the ability to shear existing data in the sheared memory, and this is more important when an (n) tasks are scheduled (bunch of tasks) in parallel processing. Memetic Algorithm (MA) used to solve the scheduling problem in parallel processing, which is a form of genetic algorithm (GA) that are combined with other forms of local search simulated annealing (SA).MA was introduced an effective results and a best solution for assigning the tasks to the homogeneous parallel multiprocessor system, which dependent on Tlevel and Blevel and they have minimum value when computed the parameters (Make span & Flow time), during the comparison between many of multiprocessors scheduling algorithms.