By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Lisheng Wang ; Dept. of Comput. Sci., Tongji Univ., Shanghai, China ; Kete Wang ; Xixi Li

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.

Published in:

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

Date of Conference:

22-24 Oct. 2010