The Research of Submesh Searching Scheme for Torus-Connected Multicomputers
Li Yin · Microcomputer Information · 2009
Efficient processor allocation is crucial for obtaining high performance in multicomputers. A good processor allocation algorithm should find available proceesors for incoming jobs, if they exist, with minimum overhead. In this paper, we propose such an efficient submesh search scheme for torus-connected multicomputers. By using simple coordinate calculation, the proposed scheme reduces the search space drastically and ,hence ,can find a free submesh very quickly. Simulation results show that the algorithm is efficient and feasible.