Pregled bibliografske jedinice broj: 294746
Accessing Sparse Arrays in Parallel Memories
Accessing Sparse Arrays in Parallel Memories // Journal of VLSI and Computer Systems, 1 (1983), 1; 69-100 (međunarodna recenzija, članak, znanstveni)
CROSBI ID: 294746 Za ispravke kontaktirajte CROSBI podršku putem web obrasca
Naslov
Accessing Sparse Arrays in Parallel Memories
Autori
Banerjee, U. ; Gajski, D. D. ; Kuck, D.
Izvornik
Journal of VLSI and Computer Systems (0733-5644) 1
(1983), 1;
69-100
Vrsta, podvrsta i kategorija rada
Radovi u časopisima, članak, znanstveni
Ključne riječi
parallel processing; array operations; multidimensional arrays; parallel memory; sparse array storage
Sažetak
The concept of dense and sparse execution of arrays is introduced. Arrays, themselves, can be stored in a dense or sparse manner in a parallel memory with m memory modules. Hardware is proposed for speeding up the execution of array operations of the form C(c//0 plus cI) implied by A(a//0 plus al) OP B(b//0 plus bI), where a//0, a, b//0, b, c//0, c are integer constants and I is an index variables. The hardware handles 'sparse execution', in which the operation OP is not executed for every value of I. The hardware also makes provision for 'sparse storage', in which memory space is not provided for every array element. It will be shown how to access array elements of the above form without conflict in an efficient way. The efficiency is obtained by using some specialized units which are basically smart memories with priority detection, one's counting, or associative search. Generalization to multidimensional arrays is shown possible under restrictions defined in the paper.
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:
- Scopus