Please use this identifier to cite or link to this item:
https://hdl.handle.net/1959.11/5706
Title: | Fast solution of large N x N matrix equations in an MIMD-SIMD hybrid system | Contributor(s): | Sim, Leo Chin (author); Leedham, Graham (author); Jian, Leo Chin (author); Schroder, Heiko (author) | Publication Date: | 2003 | DOI: | 10.1016/j.parco.2003.05.011 | Handle Link: | https://hdl.handle.net/1959.11/5706 | Abstract: | In this paper, we propose a new high-speed computation algorithm for solving a large N x N matrix system using the MIMD–SIMD Hybrid System. The MIMD–SIMD Hybrid System (also denoted as Hybrid System in this paper) is a new parallel architecture consisting of a combination of Cluster of Workstations (COWs) and SIMD systems working concurrently to produce an optimal parallel computation. We first introduce our prototype SIMD system and our Hybrid System setup before presenting how it can be implemented to find the unknowns in a large N x N linear matrix equation system using the 'Gauss–LU' algorithm. This algorithm basically performs the 'Divide and Conquer' approach by breaking down the large N x N matrix system into a manageable 32 x 32 matrix for fast computation. | Publication Type: | Journal Article | Source of Publication: | Parallel Computing, 29(11-12), p. 1669-1684 | Publisher: | Elsevier BV | Place of Publication: | Netherlands | ISSN: | 1872-7336 0167-8191 |
Fields of Research (FoR) 2008: | 080106 Image Processing 080109 Pattern Recognition and Data Mining 080104 Computer Vision |
Socio-Economic Objective (SEO) 2008: | 810199 Defence not elsewhere classified 890299 Computer Software and Services not elsewhere classified 810107 National Security |
Peer Reviewed: | Yes | HERDC Category Description: | C1 Refereed Article in a Scholarly Journal |
---|---|
Appears in Collections: | Journal Article |
Files in This Item:
File | Description | Size | Format |
---|
SCOPUSTM
Citations
3
checked on Dec 28, 2024
Page view(s)
1,016
checked on Apr 2, 2023
Items in Research UNE are protected by copyright, with all rights reserved, unless otherwise indicated.