Application of priority in grid calling

  • Authors:

  • Lixia Wang;Aimin Yang;Bin Hong;Liting Gao;Junping Wu;Wenxiang Zhang;Xianhong Kan

  • Affiliations:

  • Department of Computer Science, Hebei Institute of Architecture and Civil Engineering, China;Computer Science and Information Technology College, Zhejiang Wanli University, Ningbo, China;Department of Computer Science, Hebei Institute of Architecture and Civil Engineering, China;Department of Computer Science, Hebei Institute of Architecture and Civil Engineering, China;Computer Science and Information Technology College, Zhejiang Wanli University, Ningbo, China;Computer Science and Information Technology College, Zhejiang Wanli University, Ningbo, China;Computer Science and Information Technology College, Zhejiang Wanli University, Ningbo, China

  • Venue:
  • CEA'09 Proceedings of the 3rd WSEAS international conference on Computer engineering and applications
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

The grid is to integrate the whole Internet into one set of huge super computer, realizing overall share of various resources. Grid is a new network that can bring huge storage processing and storage capacity and other IT resources. The grid computing can link a great number of computers in different locations via share network and thus form a virtual super computer t which combines idle capacity processor in the computers in many locations and provide huge processing ability for the research and centralized application of other data. The high-efficient management of grid resources and high-efficient scheduling of tasks are the important contents in today's net grid research. In this article we divide the tasks into some small tasks assigned with scheduling priorities for each level, and then slice all resources in network into some time slices assigned with resource priorities according to trust mechanism. It promotes the effectiveness and high-efficiency by arranging task scheduling and resource scheduling in priority.