Utilizing multi-networks task scheduler for streaming applications

Kazumi Yoshinaga, Yoshiyuki Uratani, Hiroshi Koide

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

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.

Original languageEnglish
Title of host publicationProceedings - 37th International Conference on Parallel Processing Workshops, ICPP 2008
Pages25-30
Number of pages6
DOIs
Publication statusPublished - 2008
Externally publishedYes
Event37th International Conference on Parallel Processing Workshops, ICPP 2008 - Portland, OR, United States
Duration: Sept 8 2008Sept 12 2008

Publication series

NameProceedings of the International Conference on Parallel Processing Workshops
ISSN (Print)1530-2016

Other

Other37th International Conference on Parallel Processing Workshops, ICPP 2008
Country/TerritoryUnited States
CityPortland, OR
Period9/8/089/12/08

All Science Journal Classification (ASJC) codes

  • Software
  • Mathematics(all)
  • Hardware and Architecture

Fingerprint

Dive into the research topics of 'Utilizing multi-networks task scheduler for streaming applications'. Together they form a unique fingerprint.

Cite this