Multiple processor scheduling with optimum execution time and processor utilization based on the SOSA

1Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The multiple processor scheduling problem characterizes that different processor comprises of an arrangement of jobs or tasks designate proficient utilizing a limited number of processors. Herein development a multi-objective algorithm utilizing Symbiotic Organisms Search algorithm (SOSA) for scheduling an arrangement of reliant on tasks on obtainable resources in a multiple processor environment which minimizes the execution time and maximize the processor utilization. SOSA is a nature-inspired meta-heuristic algorithm utilized to compare with other meta-heuristic algorithms such as Water cycle algorithm (WCA), Genetic algorithm based Bacteria foraging optimization (GBF), Bacteria Foraging Optimization (BFO) and Genetic Algorithm (GA). SOSA reproduces the advantageous association methodologies received by life forms to survive and engender in the biological-community (ecosystem). Based on experimental results, we find the execution time as well as processor utilization using SOSA technique and then compare with the other mentioned algorithms. Acquired outcomes affirm the incredible execution of the SOSA in solving the multiple processor scheduling problems.

Cite

CITATION STYLE

APA

Nayak, S. K., & Panda, C. S. (2019). Multiple processor scheduling with optimum execution time and processor utilization based on the SOSA. International Journal of Recent Technology and Engineering, 8(2), 5463–5471. https://doi.org/10.35940/ijrte.B3756.078219

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free