Efficientand Quick Algorithm for Processor Allocation in Mesh Multi-Computers Network
Rahmat Zolfaghari, Islamic Azad University, Hashtgerd Branch, Department of Computer Engineering, Tehran, Iran.
Manuscript received on May 12, 2013. | Revised Manuscript received on June 17, 2013. | Manuscript published on June 30, 2013. | PP: 517-523 | Volume-2, Issue-5, June 2013. | Retrieval Number: E1762062513/2013©BEIESP
Open Access | Ethics and Policies | Cite
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: Until now, several continuous and discontinuous techniques have been given for processor allocation in mesh multicomputers networks. Continuous allocation methods always try to allocate a free continuous sub-mesh with the same requested dimensional structure to the parallel input job. For this reason, it produces the internal fragmentation in the processors network. Discontinuous allocation algorithms were produced with the aim of removing processors fragmentation. In discontinuous allocation algorithms, message interference between different jobs and struggle to get communication resources increases network communication overheads due to the increase in path length passed by the message. This communication overhead is highly dependent on to the manner of free sub-meshes allocation and the manner of recording by the algorithm. my paper, a discontinuous allocation algorithm called Quick Non-Contiguous Allocation (QNA) has been presented for a two-dimensional mesh network with C programming language. The efficiency of this algorithm and continuous and discontinuous allocation algorithms is determined and compared via simulator tool Proc Simity . Simulation results indicate improved performance parameters in the given algorithm.
Keywords: Multi-computers network, Allocation processor, Fragmentation, Continuous and Discontinuous algorithms.