Welcome to IEEE Xplore 2.0: An algorithm for array variable clustering

Cart | Sitemap | Help

Abstract


	BROWSE	SEARCH	IEEE XPLORE GUIDE	SUPPORT

View TOC

An algorithm for array variable clustering
Ramachandran, L. Gajski, D.D. Chaiyakul, V.
Dept. of Inf. & Comput. Sci., California Univ., Irvine, CA;

This paper appears in: European Design and Test Conference, 1994. EDAC, The European Conference on Design Automation. ETC European Test Conference. EUROASIC, The European Event in ASIC Design, Proceedings.
Publication Date: 28 Feb-3 Mar 1994
On page(s): 262-266
Meeting Date: 02/28/1994 - 03/03/1994
Location: Paris, France
ISBN: 0-8186-5410-4
References Cited: 16
INSPEC Accession Number: 4682279
Digital Object Identifier: 10.1109/EDTC.1994.326867
Current Version Published: 2002-08-06

Abstract
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

Index Terms
Available to subscribers and IEEE members.

References
Available to subscribers and IEEE members.

Citing Documents
Available to subscribers and IEEE members.

You are not logged in.

Guests may access Abstract records free of charge.