Abstract

The Task Scheduling Problem (TSP) in Multiprocessor Systems (MPS) is an emerging research area in heterogeneous distributed computing environments. Managing complex tasks and achieving optimal efficiency while scheduling tasks in MPS presents challenges. Although adding more processors to a single system greatly increases its processing power, the energy these processors produce is the main drawback. Here, we employed a multi-objective optimization strategy to reduce the makespan and Energy Consumption (EC). To reduce processor EC, we considered an effective Dynamic Voltage and Frequency Scaling (DVFS) technique. Three distinct energy sources are considered, originating from the processors' communication, idle, and active states. The scheduling sequence of tasks and the assignment of tasks to processors are two vital aspects of TSP. Here, the tasks are arranged based on priority using the Upward Rank technique. To minimize the makespan and EC while allocating tasks to processors, we use the population-based metaheuristic method called Enhanced Honey Badger Optimisation (EHBO). We proposed three improvements to the HBO algorithm in EHBO. Initially, we addressed opposite learning-based population initialization to exclude the least suitable candidates and generate a candidate scheduling population that adheres to task precedence. Subsequently, the levy-flight technique is employed to improve the local and global search and preserve their ideal healthy balance. Finally, using dynamic values rather than constant value improves the ability to obtain maximum food. Several experiments are conducted on random task graphs and real-life data sets. Additionally, the results are compared with other upgraded meta-heuristic algorithms, demonstrating the superiority of EHBO.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.