.png){kind=icon}
Return
An efficient task allocation scheme for 2D mesh architectures
.png){kind=icon}
PRE
AI
DOI：10.1109/71.615439.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
complete submesh recognition
coverage submesh
meshes
task allocation
waiting delay
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
5.2K
Citations:
1.1W
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSaveShareSaveRecognizing Human Actions by Using the Evolving Remote Supervised Method of Spiking Neural Networks
PREAI
ShareSave no more
no more