This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2008 International Conference on Parallel Processing - Workshops
Utilizing Multi-Networks Task Scheduler for Streaming Applications
September 08-September 12
ISBN: 978-0-7695-3375-9
This paper proposes and evaluates a new task scheduling method for parallel and distributed applications in an environment consisting of multiple networks having different characteristics. The proposed method can schedule both streaming applications and non-streaming applications effectively at the same time, since it selects the most suitable networks for the communications of tasks and considers the changing loads of the networks. The experimental results show the proposed method reduced the total execution time of a practical streaming application. The dispersion of the execution time was also suppressed even if the network bandwidth was dynamically changing. This characteristic is very important when this method is applied to more complicated task scheduling methods.
Index Terms:
task scheduling, task migration, streaming application
Citation:
Kazumi Yoshinaga, Yoshiyuki Urantani, Hiroshi Koide, "Utilizing Multi-Networks Task Scheduler for Streaming Applications," icppw, pp.25-30, 2008 International Conference on Parallel Processing - Workshops, 2008
Usage of this product signifies your acceptance of the Terms of Use.