Abstract
modified bacterial foraging algorithm for allocation and scheduling tasks on processors and links with high reliability is proposed (MBFA). MBFA ensure high reliability without redundancy of processors or links by using an efficient and simple structure. MBFA is improved by adding an efficient model to deal with the weak solution (i.e., allocation with low reliability). Also a simulated annealing technique is integrated into MBFA in order to strengthen the search of best solution. The efficiency and effectiveness of MBFA are tested using random generated problems. MBFA is tested over the published approaches HPSO and GAA using density parameter (DS), number of nodes (N) and the communication to computation ratio parameter (CCR). The results show the superiority of MBFA over the published approaches in all test cases.
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 callMore From: International Journal of Communication Networks and Distributed Systems
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.
