Optimizing message passing programs based on task section duplication

Yin Ye, Zhihui Du, Song Hao

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

1 Citation (Scopus)

Abstract

The task scheduling model and algorithm is very important to achieve high performance for message passing programs. The SPG (Subtask Precedence Graph) model abstracts a task as a set of communication and computation sections so it can explore the dependence among subtasks precisely. The TSSF (Task Section based Scheduling Framework) is designed to show how to generate subtasks and how to schedule subtasks on to different processors. Based on the SPG model and the TSSF Framework, two TSD(Task Section Duplication based) algorithms, SMU(Searching-Marking- Unmarking) and Scalable SMU are described in detail to show how to get multiple parallel executing paths based on task section duplication. Compared with four typical traditional task scheduling algorithms,the simulation results show that our algorithms outperform other algorithms signifiantly.

Original languageEnglish
Title of host publicationProceedings - 2009 IEEE International Symposium on Parallel and Distributed Processing with Applications, ISPA 2009
Pages673-678
Number of pages6
DOIs
Publication statusPublished - 19 Nov 2009
Externally publishedYes
Event2009 IEEE International Symposium on Parallel and Distributed Processing with Applications, ISPA 2009 - Chengdu, Sichuan, China
Duration: 9 Aug 200912 Aug 2009

Other

Other2009 IEEE International Symposium on Parallel and Distributed Processing with Applications, ISPA 2009
CountryChina
CityChengdu, Sichuan
Period9/8/0912/8/09

Fingerprint

Message passing
Scheduling
Scheduling algorithms
Communication

Keywords

  • Message passing program
  • Task duplication algorithm
  • Task scheduling algorithm

ASJC Scopus subject areas

  • Computer Science Applications
  • Software

Cite this

Ye, Y., Du, Z., & Hao, S. (2009). Optimizing message passing programs based on task section duplication. In Proceedings - 2009 IEEE International Symposium on Parallel and Distributed Processing with Applications, ISPA 2009 (pp. 673-678). [5207862] https://doi.org/10.1109/ISPA.2009.98

Optimizing message passing programs based on task section duplication. / Ye, Yin; Du, Zhihui; Hao, Song.

Proceedings - 2009 IEEE International Symposium on Parallel and Distributed Processing with Applications, ISPA 2009. 2009. p. 673-678 5207862.

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

Ye, Y, Du, Z & Hao, S 2009, Optimizing message passing programs based on task section duplication. in Proceedings - 2009 IEEE International Symposium on Parallel and Distributed Processing with Applications, ISPA 2009., 5207862, pp. 673-678, 2009 IEEE International Symposium on Parallel and Distributed Processing with Applications, ISPA 2009, Chengdu, Sichuan, China, 9/8/09. https://doi.org/10.1109/ISPA.2009.98
Ye Y, Du Z, Hao S. Optimizing message passing programs based on task section duplication. In Proceedings - 2009 IEEE International Symposium on Parallel and Distributed Processing with Applications, ISPA 2009. 2009. p. 673-678. 5207862 https://doi.org/10.1109/ISPA.2009.98
Ye, Yin ; Du, Zhihui ; Hao, Song. / Optimizing message passing programs based on task section duplication. Proceedings - 2009 IEEE International Symposium on Parallel and Distributed Processing with Applications, ISPA 2009. 2009. pp. 673-678
@inproceedings{745ce5c7e8fb42f48246082b2e08c6c7,
title = "Optimizing message passing programs based on task section duplication",
abstract = "The task scheduling model and algorithm is very important to achieve high performance for message passing programs. The SPG (Subtask Precedence Graph) model abstracts a task as a set of communication and computation sections so it can explore the dependence among subtasks precisely. The TSSF (Task Section based Scheduling Framework) is designed to show how to generate subtasks and how to schedule subtasks on to different processors. Based on the SPG model and the TSSF Framework, two TSD(Task Section Duplication based) algorithms, SMU(Searching-Marking- Unmarking) and Scalable SMU are described in detail to show how to get multiple parallel executing paths based on task section duplication. Compared with four typical traditional task scheduling algorithms,the simulation results show that our algorithms outperform other algorithms signifiantly.",
keywords = "Message passing program, Task duplication algorithm, Task scheduling algorithm",
author = "Yin Ye and Zhihui Du and Song Hao",
year = "2009",
month = "11",
day = "19",
doi = "10.1109/ISPA.2009.98",
language = "English",
isbn = "9780769537474",
pages = "673--678",
booktitle = "Proceedings - 2009 IEEE International Symposium on Parallel and Distributed Processing with Applications, ISPA 2009",

}

TY - GEN

T1 - Optimizing message passing programs based on task section duplication

AU - Ye, Yin

AU - Du, Zhihui

AU - Hao, Song

PY - 2009/11/19

Y1 - 2009/11/19

N2 - The task scheduling model and algorithm is very important to achieve high performance for message passing programs. The SPG (Subtask Precedence Graph) model abstracts a task as a set of communication and computation sections so it can explore the dependence among subtasks precisely. The TSSF (Task Section based Scheduling Framework) is designed to show how to generate subtasks and how to schedule subtasks on to different processors. Based on the SPG model and the TSSF Framework, two TSD(Task Section Duplication based) algorithms, SMU(Searching-Marking- Unmarking) and Scalable SMU are described in detail to show how to get multiple parallel executing paths based on task section duplication. Compared with four typical traditional task scheduling algorithms,the simulation results show that our algorithms outperform other algorithms signifiantly.

AB - The task scheduling model and algorithm is very important to achieve high performance for message passing programs. The SPG (Subtask Precedence Graph) model abstracts a task as a set of communication and computation sections so it can explore the dependence among subtasks precisely. The TSSF (Task Section based Scheduling Framework) is designed to show how to generate subtasks and how to schedule subtasks on to different processors. Based on the SPG model and the TSSF Framework, two TSD(Task Section Duplication based) algorithms, SMU(Searching-Marking- Unmarking) and Scalable SMU are described in detail to show how to get multiple parallel executing paths based on task section duplication. Compared with four typical traditional task scheduling algorithms,the simulation results show that our algorithms outperform other algorithms signifiantly.

KW - Message passing program

KW - Task duplication algorithm

KW - Task scheduling algorithm

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

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

U2 - 10.1109/ISPA.2009.98

DO - 10.1109/ISPA.2009.98

M3 - Conference contribution

SN - 9780769537474

SP - 673

EP - 678

BT - Proceedings - 2009 IEEE International Symposium on Parallel and Distributed Processing with Applications, ISPA 2009

ER -