We present a hardware-algorithm for selecting the ?-th smallest item among N elements (for all ranges of N) using a p-classifier device, while strictly enforcing conflict-free memory accesses. Specifically, we show that, by using our design, selection can be accomplished optimally in O(N/p) time. © 1999 Springer-Verlag Berlin Heidelberg.
An optimal hardware-algorithm for selection using a fixed-size parallel classifier device
1999
Abstract
We present a hardware-algorithm for selecting the ?-th smallest item among N elements (for all ranges of N) using a p-classifier device, while strictly enforcing conflict-free memory accesses. Specifically, we show that, by using our design, selection can be accomplished optimally in O(N/p) time. © 1999 Springer-Verlag Berlin Heidelberg.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
prod_407554-doc_142846.pdf
solo utenti autorizzati
Descrizione: An optimal hardware-algorithm for selection using a fixed-size parallel classifier device
Tipologia:
Versione Editoriale (PDF)
Dimensione
281.48 kB
Formato
Adobe PDF
|
281.48 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
