earticle

논문검색

Meshlization of Irregular Grid Resource Topologies by Heuristic Square-Packing Methods

초록

영어

Traditionally, the assignment problem between tasks and processors is worked out by scheduling methods. In this paper, we have an innovative idea to construct a problem-solving environment for computational grids. To bridge the gap between the parallel processing technology and the heterogeneous computing environment, the grid computing resources are reorganized architecturally to form a virtual regular topology. In this research, we put emphasis on finding a heuristic algorithm of transferring an irregular grid resource topology into a mesh virtually.

목차

Abstract
 1. Introduction
 2. Proposed Algorithms
 3. Experiment Results
 4. Conclusions
 References

저자정보

  • Uei-Ren Chen Department of Electronic Engineering, Hsiuping Institute of Technology
  • Chin-Chi Wu Department of Information Management, Nan-Kai University of Technology
  • Woei Lin Department of Computer Science, National Chung Hsing University

참고문헌

자료제공 : 네이버학술정보

    함께 이용한 논문

      ※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

      0개의 논문이 장바구니에 담겼습니다.