DocumentCode
2852286
Title
Utilizing Multi-Networks Task Scheduler for Streaming Applications
Author
Yoshinaga, Kazumi ; Urantani, Y. ; Koide, Hiroshi
Author_Institution
Grad. Sch. of Comput. Sci. & Syst. Eng., Kyushu Inst. of Technol., Kitakyushu
fYear
2008
fDate
8-12 Sept. 2008
Firstpage
25
Lastpage
30
Abstract
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.
Keywords
parallel processing; scheduling; task analysis; distributed applications; multinetworks task scheduling; parallel applications; practical streaming; Application software; Bandwidth; Computer science; Data analysis; Distributed computing; Parallel processing; Processor scheduling; Routing; Streaming media; Systems engineering and theory; streaming application; task migration; task scheduling;
fLanguage
English
Publisher
ieee
Conference_Titel
Parallel Processing - Workshops, 2008. ICPP-W '08. International Conference on
Conference_Location
Portland, OR
ISSN
1530-2016
Print_ISBN
978-0-7695-3375-9
Electronic_ISBN
1530-2016
Type
conf
DOI
10.1109/ICPP-W.2008.16
Filename
4626776
Link To Document