A false-sharing-eliminable parallel tasks scheduling algorithm based on DAG

Author

Wang, Lisheng ; Wang, Kete ; Li, Xixi

Author_Institution

Dept. of Comput. Sci., Tongji Univ., Shanghai, China

Volume

9

fYear

2010

fDate

22-24 Oct. 2010

Abstract

Since there exists the possibility for the parallel tasks in the structure of graph DAG to be executed sequentially due to the problem of Cache´s False Sharing in muti-core CPU environment, this paper presents parallel task scheduling algorithm for DAG which could eliminate some of the occurrences of Cache´s False Sharing. This algorithm which is an expansion of usual DAG task scheduling algorithm based on Wave Font Method is designed for decreasing the occurrences of Cache´s false sharing. Also an experiment has been done to simulate the performance of this algorithm and the result shows that compared with WFM, the improved DAG task scheduling algorithm does decrease the occurrences number of tasks´ sequential execution and reduce the total execution time of parallel tasks by 13%, and remain the muti-core CPU load-balanced.

Keywords

cache storage; graph theory; microprocessor chips; multiprocessing systems; parallel processing; processor scheduling; resource allocation; caches false sharing; graph DAG; muticore CPU; parallel tasks scheduling algorithm; wave font method; Algorithm design and analysis; Computer applications; Instruction sets; Nickel; Resource management; Schedules; Scheduling algorithm; DAG; FALSE SHARING; LOAD-BALANCED; MUTI-CORE; PARALLELISM; TASK SCHEDULE;

fLanguage

English

Publisher

ieee

Conference_Titel

Computer Application and System Modeling (ICCASM), 2010 International Conference on

Conference_Location

Taiyuan

Print_ISBN

978-1-4244-7235-2

Electronic_ISBN

978-1-4244-7237-6

Type

conf

DOI

10.1109/ICCASM.2010.5623090

Filename

5623090