Processor allocation in the mesh multiprocessors using the leapfrog method

被引:0
|
作者
Wu, F [1 ]
Hsu, CC [1 ]
机构
[1] Natl Taiwan Univ, Dept Comp Sci & Informat Engn, Taipei 10764, Taiwan
关键词
allocation mesh; first-fit; Marcov chain; random walk;
D O I
暂无
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
A statistical data structure-the R-array is proposed to represent the mesh at first. With the statistical data, the allocation process can skip (or leapfrog) the impossible processors when finding the free base. A method based on the theory of stochastic process is devised to analyze the behavior of the allocation process The leapfrog scheme is the first one whose execution costs can be precisely calculated Simulations are carried out. The experimental results show that the leapfrog scheme is the fastest one in the allocation time in comparison with most of the famous schemes.
引用
收藏
页码:1020 / 1027
页数:8
相关论文
共 50 条