Pregled bibliografske jedinice broj: 294686
An Algorithm for Solving Linear Recurrences on Parallel and Pipelined Machines
An Algorithm for Solving Linear Recurrences on Parallel and Pipelined Machines // IEEE Transactions on Computers, 30 (1981), 3; 190-206 (međunarodna recenzija, članak, znanstveni)
CROSBI ID: 294686 Za ispravke kontaktirajte CROSBI podršku putem web obrasca
Naslov
An Algorithm for Solving Linear Recurrences on Parallel and Pipelined Machines
(An Algorithm for Solving Linear Recurrence Systems on Parallel and Pipelined Machines)
Autori
Gajski, Daniel
Izvornik
IEEE Transactions on Computers (0018-9340) 30
(1981), 3;
190-206
Vrsta, podvrsta i kategorija rada
Radovi u časopisima, članak, znanstveni
Ključne riječi
complexity of algorithms; computer organization; linear recurrences; parallel evaluation; parallel processors; pipelined processors; triangular system solvers
Sažetak
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.
Izvorni jezik
Engleski
Znanstvena područja
Računarstvo
POVEZANOST RADA
Ustanove:
Fakultet elektrotehnike i računarstva, Zagreb
Profili:
Daniel Gajski
(autor)
Citiraj ovu publikaciju:
Časopis indeksira:
- Current Contents Connect (CCC)
- Web of Science Core Collection (WoSCC)
- SCI-EXP, SSCI i/ili A&HCI
- Scopus
