An approach to locality-conscious load balancing and transparent memory hierarchy management with a global-address-space paralle

The development of efficient parallel out-of-core applications is often tedious, because of the need to explicitly manage the movement of data between files and data structures of the parallel program. Several large-scale applications require multiple passes of processing over data too large to fit in memory, where significant concurrency exists within each pass. This paper describes a global-addressspace framework for the convenient specification and efficient execution of parallel out-of-core applications operating on block-sparse data. The programming model provides a global view of block-sparse matrices and a mechanism for the expression of parallel tasks that operate on blocksparse data. The tasks are automatically partitioned into phases that operate on memory-resident data, and mapped onto processors to optimize load balance and data locality. Experimental results are presented that demonstrate the utility of the approach.

• Type: Conference
• Year: 2006
• Where: IPPS
• Authors: Sriram Krishnamoorthy, Ümit V. Çatalyürek, Jarek Nieplocha, P. Sadayappan
• Keywords: Distributed And Parallel Computing, Efficient Parallel Out-of-core, IPPS 2006, Parallel Out-of-core Applications, Several Large-scale Applications