Cart (Loading....) | Create Account
Close category search window

The Algorithm of Parallel Recognition Based on Data Dependence

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

2 Author(s)
Zhao Yan ; Coll. of Comput. Sci. & Technol., Jilin Univ., Changchun, China ; Lei Liu

In this paper, the author puts forward a kind of parallel recognition algorithm in implementation of parallelization compiler. Application programs in scientific and technological fields have grown increasingly large and complex, thus, it is becoming more difficult to parallelize these programs by hand using message-passing libraries. To reduce this difficulty, we are researching the compilation technology for serial program automatic parallelization. The algorithm uses the conceptions of medium grain parallel and data dependence to realize the target of the program automatic parallelization. At the first, the author defines the data dependence of blocks by variables that the blocks have accesses at the same time. For another, by this definition, the parallelization compiler can identify all of the parallelizable blocks in the serial program and can provide a certain possibility to implement the application programs automatic parallelization. The goal to speed up the program and to improve the execution ability of the program can be realized when the blocks parallel execute on multi-processors. At the last, in the end of the paper, the author analyzes the performance of the proposed algorithm, so the author puts forward two strategies of parallel optimization.

Published in:

Information Technology and Computer Science, 2009. ITCS 2009. International Conference on  (Volume:1 )

Date of Conference:

25-26 July 2009

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.