Parallel gauss-seidel on a torus NOC architecture

Khaled Day*, Mohammad H. Al-Towaiq

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We propose a parallel Gauss-Seidel (GS) iterative algorithm for solving large systems of linear equations on a 2D torus network-con-chip (NoC) architecture. The proposed parallel algorithm is of O(Nn2/k2) time complexity for solving a system with matrix of order n on a k×k torus NoC architecture requiring N iterations assuming n and N are large compared to k (i.e. for large linear systems that require a large number of iterations). We show that under these conditions the proposed parallel GS algorithm has near optimal speedup and efficiency.

Original languageEnglish
Title of host publicationIASTED Multiconferences - Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Networks, PDCN 2013
Pages608-612
Number of pages5
DOIs
Publication statusPublished - 2013
Event11th IASTED International Conference on Parallel and Distributed Computing and Networks, PDCN 2013 - Innsbruck, Austria
Duration: Feb 11 2013Feb 13 2013

Publication series

NameIASTED Multiconferences - Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Networks, PDCN 2013

Other

Other11th IASTED International Conference on Parallel and Distributed Computing and Networks, PDCN 2013
Country/TerritoryAustria
CityInnsbruck
Period2/11/132/13/13

Keywords

  • 2D torus
  • Gauss-seidel
  • Linear system of equations
  • Network-on-Chip
  • Parallel processing

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Software

Fingerprint

Dive into the research topics of 'Parallel gauss-seidel on a torus NOC architecture'. Together they form a unique fingerprint.

Cite this