An optimal scheduling procedure for matrix inversion on linear array at a processor level
Journal Article
·
· International Journal of Parallel Programming; (United States)
- Faculty of Electronic Engineering, Serbia (Yugoslavia)
This paper presents a parallel algorithm for computing the inversion of a dense matrix based on modified Jordan's elimination which requires fewer calculation steps than the standard one. The algorithm is proposed for the implementation on the linear array with a small to moderate number of processors which operate in a parallel-pipeline fashion. A communication between neighboring processors is achieved by a common memory module implemented as a FIFO memory module. For the proposed algorithm we define a task scheduling procedure and prove that it is time optimal. In order to compute the speedup and efficiency of the system, two definitions (Amdahl's and Gustafson's) were used. For the proposed architecture, involving two to 16 processors, estimated Gustafson's (Amdahl's) speedups are in the range 1.99 to 13.76 (1.99 to 9.69).
- OSTI ID:
- 6750944
- Journal Information:
- International Journal of Parallel Programming; (United States), Journal Name: International Journal of Parallel Programming; (United States) Vol. 22:4; ISSN IJPPE5; ISSN 0885-7458
- Country of Publication:
- United States
- Language:
- English
Similar Records
Multiprocessors and array processors
Advanced computer architecture for engineering analysis and design
Reactor plant simulation on a distributed-memory parallel processor
Conference
·
Wed Dec 31 23:00:00 EST 1986
·
OSTI ID:6314783
Advanced computer architecture for engineering analysis and design
Thesis/Dissertation
·
Fri Dec 31 23:00:00 EST 1982
·
OSTI ID:5114564
Reactor plant simulation on a distributed-memory parallel processor
Conference
·
Sat Dec 31 23:00:00 EST 1988
· Transactions of the American Nuclear Society; (USA)
·
OSTI ID:6388873