research-article

Communication-aware scheduling of data-parallel tasks: work-in-progress

Authors:

Kana Shimada,

Ittetsu Taniguchi,

Hiroyuki TomiyamaAuthors Info & Claims

CASES '18: Proceedings of the International Conference on Compilers, Architecture and Synthesis for Embedded Systems

Article No.: 8, Pages 1 - 2

Published: 30 September 2018 Publication History

Get Access

Abstract

This paper studies scheduling of data-parallel tasks on multicore architectures. Unlike traditional task scheduling, this work allows individual tasks to run on multiple cores in a data-parallel fashion. Our scheduling method finds shortest schedules considering communication overhead.

References

[1]

M. Drozdowski, "Scheduling multiprocessor tasks: An overview," European Journal of Operational Research, vol. 94, 1996.

Crossref

Google Scholar

[2]

Y. Liu, L. Meng, I. Taniguchi, and H. Tomiyama, "A dual-mode scheduling approach for task graphs with data parallelism," International Journal of Embedded Systems, vol. 9, no. 2, pp. 147--156, April 2017.

Google Scholar

[3]

H. Yang and S. Ha "ILP based data parallel multi-task mapping/scheduling technique for MPSoC," International SoC Design Conference, 2008.

Google Scholar

[4]

J. Roel, S. Firew, S. Sander, K. Akash, and C. Henk "An automated flow to map throughput constrained applications to a MPSoC," Bringing Theory to Practice : Predictability and Performance in Embedded Systems, 2011.

Google Scholar

[5]

R.P. Dick, D.L. Rhodes, W.H. Wolf, "TGFF: task graph for free," International Workshop on Hardwere/Software Codesign, 1998.

Digital Library

Google Scholar

Communication-aware scheduling of data-parallel tasks: work-in-progress
1. Theory of computation
  1. Design and analysis of algorithms
    1. Approximation algorithms analysis
    2. Online algorithms
      1. Online learning algorithms
  2. Theory and algorithms for application domains
    1. Machine learning theory
      1. Reinforcement learning

Recommendations

ILP-based scheduling for malleable fork-join tasks
Special Issue on Embedded Operating Systems Workshops (EWiLi'17 and EWiLi'18)

This paper studies scheduling of malleable fork-join tasks. In our scheduling problem, each task can be partitioned into multiple sub-tasks, and the sub-tasks are scheduled independently. The optimal number of sub-tasks is determined during scheduling ...
Efficient task scheduling for hard real-time tasks in asymmetric multicore processors
ICA3PP'12: Proceedings of the 12th international conference on Algorithms and Architectures for Parallel Processing - Volume Part II

In the future it is very likely that asymmetric multi-core processors (AMP) will be used because of their proposed power efficiency and higher performance. In order to use the device intelligently and efficiently, it is essential to exploit the ...
Scheduling tasks with AND/OR precedence constraints
SPDP '90: Proceedings of the 1990 IEEE Second Symposium on Parallel and Distributed Processing

In traditional precedence-constrained scheduling a task is ready to execute when all its predecessors are complete. Such a task is called an AND task. The authors allow certain tasks, known as OR tasks, to be ready when just one of their predecessors is ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

CASES '18: Proceedings of the International Conference on Compilers, Architecture and Synthesis for Embedded Systems

September 2018

70 pages

ISBN:9781538655641

Program Chairs:
Tulika Mitra
National University of Singapore
,
Akash Kumar
TU Dresden

In-Cooperation

CEDA
IEEE CAS

Publisher

IEEE Press

Publication History

Published: 30 September 2018

Check for updates

Author Tags

Qualifiers

Research-article

Conference

ESWEEK '18

Sponsor:

ESWEEK '18: Fourteenth Embedded Systems Week

September 30 - October 5, 2018

Turin, Italy

Acceptance Rates

Overall Acceptance Rate 52 of 230 submissions, 23%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

0
Total Citations
69
Total Downloads

Downloads (Last 12 months)4
Downloads (Last 6 weeks)0

Reflects downloads up to 28 Sep 2024

Other Metrics

View Author Metrics

Citations

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Recommendations

ILP-based scheduling for malleable fork-join tasks

Efficient task scheduling for hard real-time tasks in asymmetric multicore processors

Scheduling tasks with AND/OR precedence constraints