.png){kind=icon}
返回
An efficient task allocation scheme for 2D mesh architectures
.png){kind=icon}
PRE
AI
DOI：10.1109/71.615439.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Efficient allocation of processors to incoming tasks in parallel computer systems is very important for achieving the desired high performance. It requires recognizing the free available processors with minimum overhead. In this paper, we present an efficient task allocation scheme for 2D mesh architectures. By employing a new approach for searching the mesh, our scheme can find the available submesh without scanning the entire mesh, unlike earlier designs. Comprehensive computer simulation reveals that the average allocation time and waiting delay are much smaller than earlier schemes of comparable performances, irrespective of the size of meshes and distribution of the shape of the incoming tasks.
Keyword:
complete submesh recognition
coverage submesh
meshes
task allocation
waiting delay
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
5.2K
被引数:
1.1W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏分享收藏Recognizing Human Actions by Using the Evolving Remote Supervised Method of Spiking Neural Networks
PREAI
分享收藏 没有更多内容
没有更多内容