By Topic

Recomposing an Irregular Algorithm Using a Novel Low-Level PGAS Model

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)
Cason, M. ; Inf. Technol. Lab., US Army Corps of Eng., Vicksburg, MS, USA ; Kogge, P.M.

This paper presents analysis and simulation results for a toolkit of parallel graph traversal primitives which were built using a novel, low-level partitioned global address space (PGAS) programming model. Unlike high-level HEC PGAS languages (UPC, Chapel, Fortress), this mobile-subjective (MoS) model does not hide parallelization or communication overhead in the compiler or runtime. Unlike other low-level HEC languages (C/MPI) this model provides 1) facilities for fine-grain synchronization, 2) PGAS view of memory, and 3) object encapsulation. This paper shows how this programming model facilitated the transformation of the well-studied minimum spanning forest (MSF) algorithm into a new MSF algorithm which allowed for million way well-behaved parallelism on a novel multithreaded architecture. We provide analysis to show why naive formulations of MSF are not scalable for certain input graphs. We then provide analysis of the MoS reformulation to show how scalability is achieved by ensuring a good distribution of data and computation for arbitrary input graphs.

Published in:

Parallel Processing Workshops (ICPPW), 2011 40th International Conference on

Date of Conference:

13-16 Sept. 2011