CATALOGO DEI PRODOTTI DELLA RICERCA
IRIS è la soluzione IT che facilita la raccolta e la gestione dei dati relativi alle attività e ai prodotti della ricerca. Fornisce a ricercatori, amministratori e valutatori gli strumenti per monitorare i risultati della ricerca, aumentarne la visibilità e allocare in modo efficace le risorse disponibili.
EnglishThis paper shows that an n=2^k processor Partitioned Optical Passive Stars (POPS) network with g groups and d processors per group can simulate either a mono-directional move of an n processor hypercube or a bi-directional move of an n/2 processor hypercube using one slot when d=1 and ⌈d/g ⌉ slots when d>1. Moreover, as a direct application of the simulation, it is shown how a POPS(d, g) network, n=dg and d ≤ q, can compute the prefix sums of n data values in log_2 n + O(1) slots, faster than the best previously known ad-hoc algorithm for this problem.
| Titolo: | Mapping hypercube computations onto Partitioned Optical Passive Star Networks | |
| Autori: | ||
| Data di pubblicazione: | 2003 | |
| Abstract: | This paper shows that an n=2^k processor Partitioned Optical Passive Stars (POPS) network with g groups and d processors per group can simulate either a mono-directional move of an n processor hypercube or a bi-directional move of an n/2 processor hypercube using one slot when d=1 and ⌈d/g ⌉ slots when d>1. Moreover, as a direct application of the simulation, it is shown how a POPS(d, g) network, n=dg and d ≤ q, can compute the prefix sums of n data values in log_2 n + O(1) slots, faster than the best previously known ad-hoc algorithm for this problem. | |
| Handle: | http://hdl.handle.net/11562/435326 | |
| ISBN: | 3540206264 | |
| Appare nelle tipologie: | 04.01 Contributo in atti di convegno |
File in questo prodotto:
http://hdl.handle.net/11562/435326
Copyright © 2022