Pregled bibliografske jedinice broj: 295008
An Algorithm for Array Variable Clustering
An Algorithm for Array Variable Clustering // Procedings of The European Design and Test Conference
Pariz, Francuska: Institute of Electrical and Electronics Engineers (IEEE), 1994. str. 262-266 (predavanje, međunarodna recenzija, cjeloviti rad (in extenso), ostalo)
CROSBI ID: 295008 Za ispravke kontaktirajte CROSBI podršku putem web obrasca
Naslov
An Algorithm for Array Variable Clustering
Autori
Ramachandran, Loganath ; Gajski, Daniel D. ; Chaiyakul, Viraphol
Vrsta, podvrsta i kategorija rada
Radovi u zbornicima skupova, cjeloviti rad (in extenso), ostalo
Izvornik
Procedings of The European Design and Test Conference
/ - : Institute of Electrical and Electronics Engineers (IEEE), 1994, 262-266
ISBN
0-818-65411-2
Skup
The European Design and Test Conference
Mjesto i datum
Pariz, Francuska, 01.03.1994. - 03.03.1994
Vrsta sudjelovanja
Predavanje
Vrsta recenzije
Međunarodna recenzija
Ključne riječi
Algorithm MeSA; Variable Clustering
Sažetak
During synthesis of behavioral descriptions array variables are implemented with memory modules. In this paper we show that simple one-to-one mapping between the array variables and the memory modules lead to inefficient designs. We propose a new algorithm, MeSA, which computes for a given set of array variables, (a) the number of memory modules, (b) the size of each module (c) the number of ports on each module and (d) and the grouping of array variables assigned to each memory module. The effects of address translations are incorporated into the algorithm. While most previous research efforts have concentrated on scalar variables, the primary focus in this paper is deriving efficient storage assignment for array variables.
Izvorni jezik
Engleski
Znanstvena područja
Računarstvo
POVEZANOST RADA
Ustanove:
Fakultet elektrotehnike i računarstva, Zagreb
Profili:
Daniel Gajski
(autor)