Task scheduling algorithm to give a reasonable number of processors taking account of communication overhead

Kai, Munenori

doi:10.1109/pacrim.1997.620417

Cited by 2 publications

(2 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Formula (11) can be replaced with Eqs. (22), (23) and (24) as follows. Let y i1,i2, j be a 0-1 variable, being 0 if main-threads of two tasks, i1 and i2, are mapped to the core j.…”

Section: ∀I1 I2mentioning

confidence: 99%

See 1 more Smart Citation

Communication-Aware Scheduling of Data-Parallel Tasks on Multicore Architectures

Shimada

Taniguchi

Tomiyama

2019

IPSJ Transactions on System LSI Design Methodology

View full text Add to dashboard Cite

Task scheduling has a significant impact on multicore computing systems. 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. In this paper, the inter-task communication overhead is taken into account during scheduling. The communication happens if main threads of two tasks with data-dependencies are mapped onto the different processors. This paper proposes two methods for data-parallel task scheduling with communication overhead. One is two-step method, which schedules tasks without communication and then assigns threads in the task on cores. The other is integrated method, which performs task scheduling and thread assignment simultaneously. Both of the two methods are based on integer linear programming. The proposed methods are evaluated through experiments and encouraging results are obtained.

show abstract

“…Formula (11) can be replaced with Eqs. (22), (23) and (24) as follows. Let y i1,i2, j be a 0-1 variable, being 0 if main-threads of two tasks, i1 and i2, are mapped to the core j.…”

Section: ∀I1 I2mentioning

confidence: 99%

“…The work in Ref. [22] proposes the list scheduling algorithm taking into account communication overhead in distributed memory machine. A task is executed on a processor, and communication time is required if two task which have dependent relation between them are assigned on the different processors.…”

Section: Introductionmentioning

confidence: 99%

Communication-Aware Scheduling of Data-Parallel Tasks on Multicore Architectures

Shimada

Taniguchi

Tomiyama

2019

IPSJ Transactions on System LSI Design Methodology

View full text Add to dashboard Cite

show abstract

Task scheduling algorithms based on heuristic search taking account of communication overhead

Kai

Shimada²

1999 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM 1999). Conference Proceedings (Cat.

View full text Add to dashboard Cite

Task scheduling algorithm to give a reasonable number of processors taking account of communication overhead

Cited by 2 publications

References 0 publications

Communication-Aware Scheduling of Data-Parallel Tasks on Multicore Architectures

Communication-Aware Scheduling of Data-Parallel Tasks on Multicore Architectures

Task scheduling algorithms based on heuristic search taking account of communication overhead

Contact Info

Product

Resources

About