loading...
Peer-to-Peer Scheduling System with Scalable Information Sharing Protocol
Hiroshima, Japan January 15-January 19
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/SAINT-W.2007.852007 International Symposium on Appli ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Norihiro Umeda, Tokyo Institute of Technology, Japan
Hidemoto Nakada, National Institute of Advanced Industrial Science and Technology, Japan
Satoshi Matsuoka, Tokyo Institute of Technology & NII, Japan
In traditional job scheduling systems for the Grid, a single or a few machines handle information of all computing resources and scheduling tasks. This centralized approach is not scalable, since it introduces single point of failure and bottleneck. Some decentralized scheduling systems have been proposed to improve scalability. They avoid concentration of scheduling costs by broadcasting job execution requests in a peer-to-peer style. However, resource utilization tends to be low, because most of them are not aware of the dynamic states of computing resources before throwing execution requests. This paper introduces a decentralized scheduling system that improves resource utilization by using a Gossip-based multicast protocol. With this protocol, peers can gather information of each other efficiently and schedule jobs individually. The simulation shows that our system is scalable and it handles many jobs efficiently in large scale Grid environments.
Citation:
Norihiro Umeda, Hidemoto Nakada, Satoshi Matsuoka, "Peer-to-Peer Scheduling System with Scalable Information Sharing Protocol," saint-w, pp.34, 2007 International Symposium on Applications and the Internet Workshops (SAINTW'07), 2007
Usage of this product signifies your acceptance of the Terms of Use.


Suggestions