By Topic

A graph based approach to the synthesis of multi-chip module architectures

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Cherabuddi, R.V. ; Center for Adv. Comput. Studies, Southwestern Louisiana Univ., Lafayette, LA, USA ; Chen, J. ; Bayoumi, M.A.

We present a graph based approach to the time (performance) constrained synthesis of multi-chip module (MCM) architectures. System-level partitioning is performed using the Stochastic Evolution heuristic, which is an effective heuristic for solving several combinatorial optimization problems. The partitioning cost function models the scheduling/allocation constraints (including interchip buses) in the form of incompatible sets. Supernodes are created using the scheduling/allocation constraints which in turn reduces the search space for the partitioner. Scheduling and resource allocation is performed for the case of time (performance) constrained synthesis and includes modeling of inter-chip buses, multi-cycle operations, pipelined functional units and functional pipelining. Efficient synthesis results are obtained for the high-level synthesis benchmarks in far less CPU time compared to the integer linear programming based model

Published in:

VLSI Design, 1996. Proceedings., Ninth International Conference on

Date of Conference:

3-6 Jan 1996