Paper Title:
P2P Technology Application and Research of Grid Computing
  Abstract

Grid computing is a new type of network computing platform emerged after the World Wide Web, which objective is to provide a kind of infrastructure that shares all kinds of information for user. This paper brings forward a Grid-P2P model based on Peer-to-Peer computing, and designs a peer-to-peer genetic scheduling algorithm. The simulation results show that this model increased validity and accuracy of grid computing. It can be applied to the optimization of task scheduling successfully.

  Info
Periodical
Edited by
Shengyi Li, Yingchun Liu, Rongbo Zhu, Hongguang Li, Wensi Ding
Pages
937-941
DOI
10.4028/www.scientific.net/AMM.34-35.937
Citation
G. H. Gao, L. J. Xu, X. F. Yang, "P2P Technology Application and Research of Grid Computing", Applied Mechanics and Materials, Vols. 34-35, pp. 937-941, 2010
Online since
October 2010
Export
Price
$32.00
Share

In order to see related information, you need to Login.

In order to see related information, you need to Login.

Authors: Yue Zhang, Yun Xia Pei
Abstract:Resource management model was presented based on cloud computing using virtualization technologies. According to this strategy, a resource...
358
Authors: Xiao Bo Gao
Abstract:From the perspective of resource sharing, grid computing is a system ranging from small kind of network system for home using to large-scale...
526
Authors: Yun Xia Pei, Yue Zhang
Abstract:As a rapid developing infrastructure, the grid can share widely distributed computing, storage, data and human resources. In order to improve...
111
Authors: Hong Wei Zhao
Chapter 3: Material Science, Chemistry and Information Technology
Abstract:Cloud computing technology is an efficient way to resolve the resource sharing and cooperative work in distributed environments. The resource...
433
Authors: Guan Wang, Hai Cun Yu
Chapter 10: Applied Computing and Information Technologies
Abstract:Task schedule algorithms directly related to the speed and quality of schedule. Min-Min algorithm always completes the shortest total...
2429