Efficient Parabolic Solvers Scalable across Multi-Architectural Levels

High end computing hardware has been growing fast in both uniprocessor performance and parallel system scales. Steadily advancing but somewhat lagging behind is the speed of memory accesses. Thus, needed are software and algorithms behind software that adapt well with architectural features of high...

Full description

Saved in:
Bibliographic Details
Published in:2012 IEEE 10th International Symposium on Parallel and Distributed Processing with Applications pp. 111 - 118
Main Authors: Yu Zhuang, Heng Wu
Format: Conference Proceeding
Language:English
Published: IEEE 01.07.2012
Subjects:
Accuracy
Algorithm design and analysis
cache performance
Equations
Mathematical model
numerical solution
Numerical stability
Parallel algorithm
Parallel processing
partial differential equation
Power system stability
ISBN:1467316318, 9781467316316
ISSN:2158-9178
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:High end computing hardware has been growing fast in both uniprocessor performance and parallel system scales. Steadily advancing but somewhat lagging behind is the speed of memory accesses. Thus, needed are software and algorithms behind software that adapt well with architectural features of high end computing hardware. Stable explicit implicit domain decomposition (SEIDD) is a class of numerical algorithms originally introduced for solving parabolic equations on parallel computers, which has adequately high parallelism, flexible controllability for load balancing, minimal communication cost, and good stability and efficiency. In this paper, we study the effectiveness of SEIDD in harnessing the computing power at the inter-processor level for parallel processing as well as the level of cache memories for fast memory accesses.
ISBN:1467316318
9781467316316
ISSN:2158-9178
DOI:10.1109/ISPA.2012.23