A1 Vertaisarvioitu alkuperäisartikkeli tieteellisessä lehdessä
Performance of work-optimal PRAM simulation algorithms on coated meshes
Tekijät: Leppanen V
Kustantaja: CAMBRIDGE UNIV PRESS
Julkaisuvuosi: 1995
Lehti:: Computer Journal
Tietokannassa oleva lehden nimi: COMPUTER JOURNAL
Lehden akronyymi: COMPUT J
Vuosikerta: 38
Numero: 10
Aloitussivu: 801
Lopetussivu: 810
Sivujen määrä: 10
ISSN: 0010-4620
DOI: https://doi.org/10.1093/comjnl/38.10.801
Tiivistelmä
We study the effect of varying the multithreading level of processors in work-optimal PRAM simulation algorithms on coated meshes. A coated mesh consists of a mesh connected routing machinery and P processor & memory pairs that form a coat on the routing machinery. The algorithms studied are based on greedy routing, sorting, improved virtual leveled network technique, combining queues method, and synchronization wave. Our results show that increasing the multithreading level considerably improves the simulation cost. The cost can be decreased below 5 routing steps per P simulated PRAM processors. In case of one algorithm, even costs 1.1...2 are achieved.
We study the effect of varying the multithreading level of processors in work-optimal PRAM simulation algorithms on coated meshes. A coated mesh consists of a mesh connected routing machinery and P processor & memory pairs that form a coat on the routing machinery. The algorithms studied are based on greedy routing, sorting, improved virtual leveled network technique, combining queues method, and synchronization wave. Our results show that increasing the multithreading level considerably improves the simulation cost. The cost can be decreased below 5 routing steps per P simulated PRAM processors. In case of one algorithm, even costs 1.1...2 are achieved.
Turun yliopiston Tutkimustietojärjestelmän portaali