The full text of this article

 

A study of successive over-relaxation method parallelisation over modern HPC languages
by Sparsh Mittal
International Journal of High Performance Computing and Networking (IJHPCN), Vol. 7, No. 4, 2014

 

Abstract: Successive over-relaxation (SOR) is a computationally intensive, yet extremely important iterative solver for solving linear systems. Due to recent trends of exponential growth in the amount of data generated and increasing problem sizes, serial platforms have proved to be insufficient in providing the required computational power. In this paper, we present parallel implementations of red-black SOR method using three modern programming languages namely Chapel, D and Go. We employ SOR method for solving 2D steady-state heat conduction problem. We discuss the optimisations incorporated and the features of these languages which are crucial for improving the program performance. Experiments have been performed using two, four, and eight threads and performance results are compared with those obtained using serial execution. The analysis of results provides important insights into the working of SOR method.

Online publication date: Wed, 11-Jun-2014

 

is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

 
Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

 
Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of High Performance Computing and Networking (IJHPCN):
Login with your Inderscience username and password:

 

    Username:        Password:         

Forgotten your password?


 
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

 
If you still need assistance, please email subs@inderscience.com