http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
이차원 메쉬 상호 연결 망에 대한 효율적인 태스크할당 알고리즘
추현승(Choo Hyun Seung),박경린(Park Gyung Leen),유성무(Yoo Seong Moo) 한국정보처리학회 1999 정보처리학회논문지 Vol.6 No.6
An effective allocation of requested number of processors to newly incoming tasks in two-dimensional (2D) mesh interconnection networks is very important for achieving the desired high performance and resource utilization. It also needs to guarantee the complete recognition of the free submeshes based on contiguous and available processors with minimum overhead. An efficient task allocation algorithm for 2D meshes is presented in this paper. By employing a new approach for searching the one-dimensional array, the proposed algorithm can find the available submesh without the scanning of the entire 2D array unlike earlier designs. As a result, the new algorithm can significantly reduce the task allocation time. Comprehensive computer simulation shows that the average allocation time and waiting delay are much smaller than earlier designs irrespective of the size of meshes. The hardware overhead is comparable to other algorithms.