DocumentCode
2643627
Title
Generation of interconnect topologies for communication synthesis
Author
Gasteier, M. ; Münch, M. ; Glesner, M.
Author_Institution
Darmstadt Univ. of Technol., Germany
fYear
1998
fDate
23-26 Feb 1998
Firstpage
36
Lastpage
42
Abstract
One of the key problems in hardware/software co-design is communication synthesis which determines the amount and type of interconnect between the hardware components of a digital system. To do so, communication synthesis derives a communication topology to determine which components are to be connected to a common communication channel in the final hardware implementation. In this paper, we present a novel approach to cluster processes to share a communication channel. An iterative graph-based clustering algorithm is driven by a heterogeneous cost function which takes into account bit widths, the probability of access collisions on the channels, cost for arbitration logic as well as the availability of interface resources on the hardware components to trade-off cost against performance in a most optimum fashion. The key aspects of the approach are demonstrated on a small example
Keywords
circuit layout CAD; circuit optimisation; graph theory; integrated circuit interconnections; integrated circuit layout; iterative methods; network topology; access collisions probability; arbitration logic cost; bit widths; communication channel; communication synthesis; communication topology; hardware/software codesign; heterogeneous cost function; interconnect topologies generation; interface resources availability; iterative graph-based clustering algorithm; Availability; Clustering algorithms; Communication channels; Communication system software; Cost function; Digital systems; Hardware; Iterative algorithms; Logic; Topology;
fLanguage
English
Publisher
ieee
Conference_Titel
Design, Automation and Test in Europe, 1998., Proceedings
Conference_Location
Paris
Print_ISBN
0-8186-8359-7
Type
conf
DOI
10.1109/DATE.1998.655834
Filename
655834
Link To Document