A model of the solution of the task distribution and load balance among parallel multiprocessors based on the class 2 of Petri Net

Author

Sun, Mian ; Zhu, Jieao ; Liu, Xue ; Zheng, Jeffrey Zhi-jie

Author_Institution

Sch. of Software, Yunnan Univ., Kunming, China

fYear

2010

fDate

17-19 Dec. 2010

Firstpage

857

Lastpage

860

Abstract

If a computing service is composed by several runtime tasks among which dependence relationships exist, the structure of the class 2 of Petri Net can be used to describe the dependence relationships and how much data is depended among runtime tasks; it can be regarded as a model for discovery of parallelism. By determining computing service, constructing Petri Net, calculating the waiting time priority (WTP) for each task, the distribution mapping can be resolved to improve the parallelism, balance the load, and reduce data communication. In this paper, we will investigate the features of the solution and under which circumstance it is appropriate.

Keywords

Petri nets; multiprocessing systems; parallel processing; resource allocation; task analysis; Petri Net; computing service; distribution mapping; load balance; parallel multiprocessors; runtime tasks; task distribution; waiting time priority; Computational modeling; Data communication; Libraries; Load modeling; Parallel processing; Program processors; Runtime; Petri Net; load balance; parallelism computing;

fLanguage

English

Publisher

ieee

Conference_Titel

Information Theory and Information Security (ICITIS), 2010 IEEE International Conference on

Conference_Location

Beijing

Print_ISBN

978-1-4244-6942-0

Type

conf

DOI

10.1109/ICITIS.2010.5689712

Filename

5689712