By Topic

Programming irregular scientific algorithms with static properties on clusters of SMP nodes

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)
Cirou, B. ; CNRS, Univ. Bordeaux, Talence, France ; Counilh, M.C. ; Roman, J.

We presented PRFX, an API dedicated to the programming of irregular parallel algorithms with static properties and its runtime support for clusters of SMP nodes. The programming model is based on a task paradigm with implicit synchronizations. These tasks operate on data that are dynamically allocated in an isomemory. The synchronization between tasks is statically computed by an inspector. This allows building data dependencies thanks to a partial pre-execution of the code, and produces a task DAG with all necessary information for the static scheduler and the parallel executor. The parallel executor uses POSIX threads with one-sided communications and works on shared and distributed memory machines. Its performances were validated by experimental results for a sparse Cholesky factorization algorithm on an IBM® SP cluster with nodes of 32 Power4 processors.

Published in:

Parallel Processing, 2005. ICPP 2005 Workshops. International Conference Workshops on

Date of Conference:

14-17 June 2005