Pregled bibliografske jedinice broj: 241803
On the complexity of parallel evaluation of algebraic expressions
On the complexity of parallel evaluation of algebraic expressions // Glasnik Matematički, 26 (1991), 1-2; 219-235 (podatak o recenziji nije dostupan, članak, znanstveni)
CROSBI ID: 241803 Za ispravke kontaktirajte CROSBI podršku putem web obrasca
Naslov
On the complexity of parallel evaluation of algebraic expressions
Autori
Manger, Robert
Izvornik
Glasnik Matematički (0017-095X) 26
(1991), 1-2;
219-235
Vrsta, podvrsta i kategorija rada
Radovi u časopisima, članak, znanstveni
Ključne riječi
parallel algorithms; complexity; algebraic expressions; evaluation
Sažetak
This paper studies the problem of evaluating algebraic expressions on a multiprocessor. Two measures for the complexity of a parallel algorithm are introduced: the computational vs. the communication complexity. General lower bounds on both complexities are established, and applied to the more specific problem of computing products in a semigroup. Finally, two algorithms for solving this specific problem are analyzed.
Izvorni jezik
Engleski
Znanstvena područja
Matematika, Računarstvo
POVEZANOST RADA
Ustanove:
Prirodoslovno-matematički fakultet, Matematički odjel, Zagreb
Profili:
Robert Manger
(autor)
Citiraj ovu publikaciju:
Uključenost u ostale bibliografske baze podataka::
- Mathematical Reviews
