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 - Nov 14 2008
Externally publishedYes
Event37th International Conference on Parallel Processing Workshops, ICPP 2008 - Portland, OR, United States
Duration: Sep 8 2008Sep 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
CountryUnited States
CityPortland, OR
Period9/8/089/12/08

Fingerprint

Scheduler
Streaming
Task Scheduling
Scheduling
Execution Time
Parallel Applications
Distributed Applications
Bandwidth
Schedule
Communication
Evaluate
Experimental Results

All Science Journal Classification (ASJC) codes

  • Software
  • Mathematics(all)
  • Hardware and Architecture

Cite this

Yoshinaga, K., Uratani, Y., & Koide, H. (2008). Utilizing multi-networks task scheduler for streaming applications. In Proceedings - 37th International Conference on Parallel Processing Workshops, ICPP 2008 (pp. 25-30). [4626776] (Proceedings of the International Conference on Parallel Processing Workshops). https://doi.org/10.1109/ICPP-W.2008.16

Utilizing multi-networks task scheduler for streaming applications. / Yoshinaga, Kazumi; Uratani, Yoshiyuki; Koide, Hiroshi.

Proceedings - 37th International Conference on Parallel Processing Workshops, ICPP 2008. 2008. p. 25-30 4626776 (Proceedings of the International Conference on Parallel Processing Workshops).

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

Yoshinaga, K, Uratani, Y & Koide, H 2008, Utilizing multi-networks task scheduler for streaming applications. in Proceedings - 37th International Conference on Parallel Processing Workshops, ICPP 2008., 4626776, Proceedings of the International Conference on Parallel Processing Workshops, pp. 25-30, 37th International Conference on Parallel Processing Workshops, ICPP 2008, Portland, OR, United States, 9/8/08. https://doi.org/10.1109/ICPP-W.2008.16
Yoshinaga K, Uratani Y, Koide H. Utilizing multi-networks task scheduler for streaming applications. In Proceedings - 37th International Conference on Parallel Processing Workshops, ICPP 2008. 2008. p. 25-30. 4626776. (Proceedings of the International Conference on Parallel Processing Workshops). https://doi.org/10.1109/ICPP-W.2008.16
Yoshinaga, Kazumi ; Uratani, Yoshiyuki ; Koide, Hiroshi. / Utilizing multi-networks task scheduler for streaming applications. Proceedings - 37th International Conference on Parallel Processing Workshops, ICPP 2008. 2008. pp. 25-30 (Proceedings of the International Conference on Parallel Processing Workshops).
@inproceedings{85c124f72c284328bc263f937eda6db4,
title = "Utilizing multi-networks task scheduler for streaming applications",
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.",
author = "Kazumi Yoshinaga and Yoshiyuki Uratani and Hiroshi Koide",
year = "2008",
month = "11",
day = "14",
doi = "10.1109/ICPP-W.2008.16",
language = "English",
isbn = "9780769533759",
series = "Proceedings of the International Conference on Parallel Processing Workshops",
pages = "25--30",
booktitle = "Proceedings - 37th International Conference on Parallel Processing Workshops, ICPP 2008",

}

TY - GEN

T1 - Utilizing multi-networks task scheduler for streaming applications

AU - Yoshinaga, Kazumi

AU - Uratani, Yoshiyuki

AU - Koide, Hiroshi

PY - 2008/11/14

Y1 - 2008/11/14

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=55749107847&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=55749107847&partnerID=8YFLogxK

U2 - 10.1109/ICPP-W.2008.16

DO - 10.1109/ICPP-W.2008.16

M3 - Conference contribution

AN - SCOPUS:55749107847

SN - 9780769533759

T3 - Proceedings of the International Conference on Parallel Processing Workshops

SP - 25

EP - 30

BT - Proceedings - 37th International Conference on Parallel Processing Workshops, ICPP 2008

ER -