Presentation 2000/11/15
Job-scheduling algorithm for global computing system
Tiecheng Wu, Yukio Kosugi,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) The rapid progress in network technology makes sharing computing power over global network be possible. For the system consists of a very large number of geographically distributed computers, an efficient job-scheduling policy is very important. This paper discusses the job-scheduling algorithm for global computing systems. In the proposed algorithm, the system is regarded as a set of clusters(each cluster represents a set of computing resources), in which jobs flow into the appropriate cluster autonomously. We have evaluated the performance with computer simulation and load-sharing experiment over the real network.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Load-Balancing / Global computing system / Job-Scheduling / Systematization / Cooperation
Paper # IN2000-146,CQ2000-70
Date of Issue

Conference Information
Committee IN
Conference Date 2000/11/15(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Information Networks (IN)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Job-scheduling algorithm for global computing system
Sub Title (in English)
Keyword(1) Load-Balancing
Keyword(2) Global computing system
Keyword(3) Job-Scheduling
Keyword(4) Systematization
Keyword(5) Cooperation
1st Author's Name Tiecheng Wu
1st Author's Affiliation Frontier Collaborative Research Center of Tokyo Institute of Technology()
2nd Author's Name Yukio Kosugi
2nd Author's Affiliation Frontier Collaborative Research Center of Tokyo Institute of Technology
Date 2000/11/15
Paper # IN2000-146,CQ2000-70
Volume (vol) vol.100
Number (no) 456
Page pp.pp.-
#Pages 6
Date of Issue