Processor allocation in mesh multiprocessors using the leapfrog method

The mesh-connected multiprocessor has become popular because of its simple and regular structure. A new data structure, the R-array, is proposed to represent the mesh at first. The element in the R-array stores statistical information about occupied conditions of the mesh. Statistical information of the R-array can direct the allocation process to jump to the processes that can serve as a base of a free submesh. Based on a simple and reasonable assumption, we develop a stochastic process to analyze behaviors of the proposed scheme. The proposed scheme is the first whose probabilities of locating free submeshes under different workloads are precisely computed. These results can be applied to each full-recognition scheme. In addition, the execution costs of the proposed scheme can also be accurately calculated. Finally, simulations are performed which show that the proposed schemes are faster than most.