An algorithm for solving linear recurrence systems on parallel and pipelined machines /

A new algorithm for the solution of linear recurrence systems on parallel or pipelined computers is described. Time bounds, speed-up and efficiency for SIMD and MIMD computers with fixed number of arithmetic elements (AE's), as well as for pipelined computers with fixed number of stages per ope...

Full description

Bibliographic Details
Main Author: 189689 Gajski, Daniel D.
Format:
Subjects:
_version_ 1826365981935534080
author 189689 Gajski, Daniel D.
author_facet 189689 Gajski, Daniel D.
author_sort 189689 Gajski, Daniel D.
collection OCEAN
description A new algorithm for the solution of linear recurrence systems on parallel or pipelined computers is described. Time bounds, speed-up and efficiency for SIMD and MIMD computers with fixed number of arithmetic elements (AE's), as well as for pipelined computers with fixed number of stages per operation, are obtained. The model of each computer is discussed in detail to explain better performance of the pipelined model. A simple modification in the design of AE's for parallel computers makes parallel model superior. Index Terms-Complexity of algorithms, computer organization, linear recurrences, parallelevaluation, parallel processors, pipelined processors, triangular system solvers.
first_indexed 2024-03-04T15:12:58Z
format
id KOHA-OAI-TEST:54786
institution Universiti Teknologi Malaysia - OCEAN
last_indexed 2024-03-04T15:12:58Z
record_format dspace
spelling KOHA-OAI-TEST:547862020-12-19T16:58:52ZAn algorithm for solving linear recurrence systems on parallel and pipelined machines / 189689 Gajski, Daniel D. A new algorithm for the solution of linear recurrence systems on parallel or pipelined computers is described. Time bounds, speed-up and efficiency for SIMD and MIMD computers with fixed number of arithmetic elements (AE's), as well as for pipelined computers with fixed number of stages per operation, are obtained. The model of each computer is discussed in detail to explain better performance of the pipelined model. A simple modification in the design of AE's for parallel computers makes parallel model superior. Index Terms-Complexity of algorithms, computer organization, linear recurrences, parallelevaluation, parallel processors, pipelined processors, triangular system solvers.A new algorithm for the solution of linear recurrence systems on parallel or pipelined computers is described. Time bounds, speed-up and efficiency for SIMD and MIMD computers with fixed number of arithmetic elements (AE's), as well as for pipelined computers with fixed number of stages per operation, are obtained. The model of each computer is discussed in detail to explain better performance of the pipelined model. A simple modification in the design of AE's for parallel computers makes parallel model superior. Index Terms-Complexity of algorithms, computer organization, linear recurrences, parallelevaluation, parallel processors, pipelined processors, triangular system solvers.12PSZJBLComputers, PipelineAlgorithms
spellingShingle Computers, Pipeline
Algorithms
189689 Gajski, Daniel D.
An algorithm for solving linear recurrence systems on parallel and pipelined machines /
title An algorithm for solving linear recurrence systems on parallel and pipelined machines /
title_full An algorithm for solving linear recurrence systems on parallel and pipelined machines /
title_fullStr An algorithm for solving linear recurrence systems on parallel and pipelined machines /
title_full_unstemmed An algorithm for solving linear recurrence systems on parallel and pipelined machines /
title_short An algorithm for solving linear recurrence systems on parallel and pipelined machines /
title_sort algorithm for solving linear recurrence systems on parallel and pipelined machines
topic Computers, Pipeline
Algorithms
work_keys_str_mv AT 189689gajskidanield analgorithmforsolvinglinearrecurrencesystemsonparallelandpipelinedmachines
AT 189689gajskidanield algorithmforsolvinglinearrecurrencesystemsonparallelandpipelinedmachines